Preql is a no-code data transformation solution built for business users. Check us out at preql.com!

Preql

preql

This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license.
Authors:
(1) Ehud Shapiro,  Department of Computer Science and Applied Math, Weizmann Institute of Science, Israel and ehud.shapiro@weizmann.ac.il. Table of Links Abstract and Introduction
Grassroots Protocols
Grassroots Implementation of Grassroots Dissemination
Applications of Grassroots Dissemination Supporting Digital Sovereignty
Future Work & Discussion
References
A. Preliminaries: Asynchronous Distributed Multiagent Transition Systems
B. All-to-All Dissemination is not Grassroots
C. Proofs A Preliminaries: Asynchronous Distributed Multiagent Transition Systems Here we introduce definitions and results regarding asynchronous distributed multiagent transition systems [24], needed for the definition and proofs of grassroots protocols. The original reference introduces them in four stages: transition systems; multiagent; distributed; asynchronous, and in addition to proofs it includes examples illustrating the various concepts. Here, we introduce distributed multiagent transition systems at once and simplify other notions by adhering to this special case. Assume a set Π of agents, each equipped with a single and unique key-pair, and identify an agent p ∈ Π by its public key. While the set of all agents Π could in principle be infinite (think of all the agents that are yet to be born), when we refer to a particular set of agents P ⊆ Π we assume P to be finite. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. Authors: (1) Ehud Shapiro,  Department of Computer Science and Applied Math, Weizmann Institute of Science, Israel and ehud.shapiro@weizmann.ac.il. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. Authors: Authors: (1) Ehud Shapiro,  Department of Computer Science and Applied Math, Weizmann Institute of Science, Israel and ehud.shapiro@weizmann.ac.il. Table of Links Abstract and Introduction Grassroots Protocols Grassroots Implementation of Grassroots Dissemination Applications of Grassroots Dissemination Supporting Digital Sovereignty Future Work & Discussion References A. Preliminaries: Asynchronous Distributed Multiagent Transition Systems B. All-to-All Dissemination is not Grassroots C. Proofs Abstract and Introduction Abstract and Introduction Grassroots Protocols Grassroots Protocols Grassroots Implementation of Grassroots Dissemination Grassroots Implementation of Grassroots Dissemination Applications of Grassroots Dissemination Supporting Digital Sovereignty Applications of Grassroots Dissemination Supporting Digital Sovereignty Future Work & Discussion Future Work & Discussion References References A. Preliminaries: Asynchronous Distributed Multiagent Transition Systems A. Preliminaries: Asynchronous Distributed Multiagent Transition Systems B. All-to-All Dissemination is not Grassroots B. All-to-All Dissemination is not Grassroots C. Proofs C. Proofs A Preliminaries: Asynchronous Distributed Multiagent Transition Systems Here we introduce definitions and results regarding asynchronous distributed multiagent transition systems [24], needed for the definition and proofs of grassroots protocols. The original reference introduces them in four stages: transition systems; multiagent; distributed; asynchronous, and in addition to proofs it includes examples illustrating the various concepts. Here, we introduce distributed multiagent transition systems at once and simplify other notions by adhering to this special case. Assume a set Π of agents, each equipped with a single and unique key-pair, and identify an agent p ∈ Π by its public key. While the set of all agents Π could in principle be infinite (think of all the agents that are yet to be born), when we refer to a particular set of agents P ⊆ Π we assume P to be finite.

Grassroots Distributed Systems: Preliminaries: Asynchronous Distributed Multiagent Transition System

This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license.
Authors:
(1) U Jin Choi, Department of mathematical science, Korea Advanced Institute of Science and Technology & ujchoi@kaist.ac.kr;
(2) Kyung Soo Rim, Department of mathematics, Sogang University & ksrim@sogang.ac.kr. Table of Links Introduction
Organization and notation
Problem Setting and Preliminaries
Generalized Wiener algebra and Fréchet derivative
Characterization of coefficients
Coefficients from an ergodic process
Conclusion & References 3. Problem Setting and Preliminaries. This section will set the mathematical model that is being addressed and provide basic background information relevant to understanding it. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. Authors: (1) U Jin Choi, Department of mathematical science, Korea Advanced Institute of Science and Technology & ujchoi@kaist.ac.kr; (2) Kyung Soo Rim, Department of mathematics, Sogang University & ksrim@sogang.ac.kr. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. Authors: Authors: (1) U Jin Choi, Department of mathematical science, Korea Advanced Institute of Science and Technology & ujchoi@kaist.ac.kr; (2) Kyung Soo Rim, Department of mathematics, Sogang University & ksrim@sogang.ac.kr. Table of Links Introduction Organization and notation Problem Setting and Preliminaries Generalized Wiener algebra and Fréchet derivative Characterization of coefficients Coefficients from an ergodic process Conclusion & References Introduction Introduction Organization and notation Organization and notation Problem Setting and Preliminaries Problem Setting and Preliminaries Generalized Wiener algebra and Fréchet derivative Generalized Wiener algebra and Fréchet derivative Characterization of coefficients Characterization of coefficients Coefficients from an ergodic process Coefficients from an ergodic process Conclusion & References Conclusion & References 3. Problem Setting and Preliminaries. This section will set the mathematical model that is being addressed and provide basic background information relevant to understanding it.

Variational Non-Bayesian Inference: Problem Setting and Preliminaries

Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Preliminaries

This paper is under CC 4.0 license. available on arxiv Authors: (1) Kota Chin, University of Tsukuba, National Institute of Information and Communications Technology Japan; (2) Keita Emura, Kanazawa University, Japan National Institute of Information and Communications Technology Japan; (3) Kazumasa Omote, University of Tsukuba National Institute of Information and Communications Technology Japan. Table of Links Abstract & Introduction Preliminaries Proposed Anonymous Yet Accountable Contract Wallet System Implementation Conclusion & References II. PRELIMINARIES A. Accountable Ring Signatures As a generalization of ring signatures [29] and group signatures [13], Xu and Yung proposed accountable ring signatures [34]. Briefly, as in ring signatures, each user generates their own public key pk and secret key sk. This decentralized structure matches blockchain systems. An opener has a public key opk and a secret key osk. When a user who has (pk,sk) generates a ring signature Σ on a message M, the user selects a set of public keys, which we refer to as ring R, and we assume that pk ∈ R, and selects the opener by indicating opk. We say that (Σ, M) is valid if the signer is a member of R, i.e., there exists pk ∈ R for which the corresponding sk has been used to generate Σ. As in group signatures, the designated opener can trace the signer using osk. Moreover, the opening algorithm produces a proof π proving that Σ is generated by sk corresponding to pk ∈ R. We introduce the syntax defined by Bootle et al. [10] as follows. Definition 1 (Syntax of Accountable Ring Signatures [10]): • Setup(1λ ): The setup algorithm takes the security parameter λ ∈ N as input and outputs the common parameter pp. • OKGen(pp): The opener key generation algorithm takes pp as input and outputs the opener public and secret keys opk and osk, respectively. • UKGen(pp): The user key generation algorithm takes pp as input and outputs the user public verification key pk and user secret signing key sk. • RSign(opk, M, R,sk): The signing algorithm takes opk, a message M to be signed, a ring R, and sk as inputs and outputs a ring signature Σ. Here, R is a set of user public keys and the pk corresponding to sk is assumed to be pk ∈ R. • RVerify(opk, M, R, Σ): The verification algorithm takes opk, M, R, and Σ as inputs and outputs 1 (accept) or 0 (reject). • Open(M, R, Σ, osk): The open algorithm takes as M, R, Σ, and osk as inputs and outputs pk ∈ R of the signer and its proof π or ⊥ otherwise. • Judge(opk, M, R, Σ, pk, π): The judge algorithm takes opk, M, R, Σ, pk, and π as inputs and outputs 0 if RVerify(opk, M, R, Σ) = 0; otherwise, it outputs 1 to indicate that Σ is generated by sk corresponding to pk, and 0 otherwise. We require correctness holds where an honestly generated signature is always valid (the RVerify algorithm outputs 1), and a proof generated by the Open algorithm against the signature and corresponding verification key is always accepted by the Judge algorithm. Bootle et al. defined full unforgeability, anonymity, traceability, and tracing soundness, which are briefly explained as follows. Refer to the literature [10] for details on these security definitions. • Full Unforgeability: It ensures that no adversary A (who may control the opener) can falsely accuse an honest user of creating a ring signature, nor A can forge a ring signature on behalf of an honest ring. • Anonymity: It ensures that no adversary A (who does not have osk) can identify the signer, i.e., a signature does not reveal the identity of the ring member who generated it. • Traceability: It ensures that no adversary A can produce a signature that is valid but untraceable. • Tracing Soundness: It ensures that no adversary A can produce proofs for a signature that are accepted by the Judge algorithm for different verification keys. Some studies have employed accountable ring signatures in blockchain systems [19], [31] due to its decentralized structure. In addition, Qiao et al. [28] removed the opening functionality from group signatures to reduce its centralized structure; however, it still has a centralized structure because a group manager issues signing keys to the group members unlike to (accountable) ring signatures. Linkable ring signatures [8], [23], [24] have been employed to provide a pseudonymity level privacy protection. As mentioned previously, this is insufficient; thus, anonymity level privacy protection is desirable. Delegatable anonymous credentials (DAC) [12] have been employed for eKYC systems [9], [32], where KYC stands for Know-Your-Customer. However, DACs are not applicable in the proposed system because they do not provide tracing functionality. Connolly et al. [14] proposed a revocable and auditable anonymous credential scheme called Protego, and they considered its application to Hyperledger Fabric. Although it might be employed in the proposed system, Connolly et al. only considered permissioned blockchains. Thus, accountable ring signatures are employed in the proposed system. B. Layer 2 Ethereum is widely recognized as providing high security as a smart contract-enabled blockchain. However, in terms of ensuring security and providing a distributed structure, there is room for improvement regarding scalability. Concretely, the number of transactions that can be processed within a certain time period is less than that of other blockchain systems. Thus, transaction fees (gas costs) will increase when many EOAs want to issue transactions. To solve this problem, we can issue a transaction off-chain, and the proof that the transaction is generated correctly, is only stored on the Ethereum blockchain. In this case, the blockchain and off-chain are referred to as Layer 1 (L1) and Layer 2 (L2), respectively. For example, when a Merkle tree is used to generate a hash chain, the proof that the hash chain satisfies the Merkle tree is stored in L1. To reduce the proof size stored in L1, the zk-STARK (zeroknowledge Scalable Transparent ARgument of Knowledge) [6] or zk-SNARK (zero-knowledge Succinct Non-interactive ARguments of Knowledge) [21], [27] are employed. zkSync [3] is an Ethereum L2 network technology that supports zk-SNARK. The goal of L2 technologies to provide the same execution environment of Ethereum (i.e., the EVM: Ethereum Virtual Machine), and zkSync nearly supports the same execution environment of Ethereum, i.e., it is EVMcompatible and can run a smart contract programed by Solidity. Thus, we can utilize Ethereum ecosystem tools, and smart contracts on zkSync are described by Solidity. This means that the proposed system can be used directly when Ethereum supports account abstraction. C. Account Abstraction In the following, we describe account abstraction. A user sends the code of a contract wallet to nodes that support account abstraction, and requests to its deployment. Note that the user does not need to be an issuer of a transaction. After deploying the contract wallet, an issuer sends transaction data to blockchain via nodes. Finally, the contract wallet runs the transaction according to the rule described in the code. We illustrate the flow of transaction issuing when account abstraction is/is not employed in Figure 3 and Figure 4. Here, the issuer (User (EOA)) communicates with nodes, their IP address is known by nodes which break anonymity trivially. Thus, we exclude the nodes in our anonymity requirement.[6] [6] This restriction can be removed if a user (who issued a transaction) prepares a node. However, currently only a test net su

Anonymous, Accountable Contract Wallet System With Account Abstraction: Preliminaries

This paper is available on arxiv under CC BY-SA 4.0 DEED license. Authors: (1) Tomáš Jakl, Czech Academy of Sciences and Czech Technical University; (2) Dan Marsden, School of Computer Science University of Nottingham; (3) Nihil Shah, Department of Computer Science University of Oxford. Table of Links Abstract & Introduction Prelimenaries FVM Theorems for Positive Existential Fragments FVM Theorems for Counting Logic FVM Theorems for The Full Logic Abstract FVM Theorems for Products Adding Equality and Other Enrichment Conclusions, Acknowledgments & References Appendix A FVM theorems for coproducts Appendix B Proofs Omitted from Section III Appendix C Proofs Omitted from Section IV Appendix D Proofs Omitted from Section V Appendix E Proofs Omitted from Section VI Appendix F Proofs Omitted from Section VII II. PRELIMINARIES A. Categories of Relational Structures We assume the basic definitions of category theory, including categories, functors and natural transformations, as can be found in any standard introduction such as [29] or [30]. Background on comonads, and any less standard material is introduced as needed. troduced as needed. A relational signature σ is a set of relation symbols, each with an associated strictly positive natural number arity. A σstructure A consists of a universe set, also denoted A, and for each relation symbol R ∈ σ of arity n, an n-ary relation RA on A. A morphism of σ-structures f : A → B is a function of type A → B, preserving relations, in the sense that for n-ary R ∈ σ For a fixed σ, σ-structures and their morphisms form our main category of interest R(σ). We will also have need of the category of pointed relational structures R∗(σ). Here the objects (A, a) are a σ-structure A with a distinguished element a ∈ A. The morphisms are σ-structure morphisms that also preserve the distinguished element. B. Comonads The intuition for each of these comonads is that they encode the moves within one structure during the corresponding model comparison game. We shall introduce their mathematical properties as needed in later sections. See [11] for detailed discussions of all three comonads.

A Categorical Account of
Composition Methods in Logic: Prelimenaries

This paper is available on arxiv under CC 4.0 license. Authors: (1) Jeffrey Ouyang-Zhang, UT Austin (2) Daniel J. Diaz, UT Austin (3) Adam R. Klivans, UT Austin (4) Philipp Krähenbühl, UT Austin Table of Links Abstract & Introduction Related Works Preliminary Methodology Results Limitations Conclusion, Acknowledgements, & References Experimental Setting & Additional Results 3 Preliminary

Predicting a Protein’s Stability
under a Million Mutations: Preliminary

This paper is under CC 4.0 license. available on arxiv Authors: (1) Tariq Bontekoe, University of Groningen; (2) Dimka Karastoyanova, University of Groningen; (3) Fatih Turkmen, University of Groningen. Table of Links Abstract & Introduction Preliminaries Zero-knowledge proofs and verifiable computing Privacy-preserving computations Requirements: an application’s perspective Verifiable, privacy-preserving computing Open challenges and future directions Conclusion & References 2. Preliminaries This section provides background on DLTs and methods for decentralized computation. Next to this, we provide an overview of the most common threat models used to describe cryptographic solutions for verifiable or privacypreserving computations. 2.1. DLTs and decentralized computations DLTs describe the collection of technologies where a (large) number of parties collectively create, maintain, and agree on a shared state or ledger. The shared state can be known completely to all parties, but can also be spread out over the respective parties. A well-known example of a DLT is blockchain, where all parties agree — via some predetermined consensus mechanism — on a public ledger containing the full state of a system. Blockchain is best known for realizing decentralized currencies such as Bitcoin [10], or smart contract systems like Ethereum [11]. However, DLTs, and specifically blockchains, also have applications in many other domains: from identity management [12] (e.g., self-sovereign identity (SSI)) to healthcare [13]. We specifically observe the proliferation of decentralized apps (or dApps), each of which can be seen as a blockchainbased autonomous application, whose behavior is defined by a collection of scripts (or smart contracts). In lockstep with an increasing number of dApps, we also observe an increase in using DLT for decentralized computations. Such decentralized computations can be applied in a DLT setting, but more importantly to any situation where multiple parties wish to perform a group computation. In this case, group computation can refer to: (1) a single computation on distributed data; (2) a decentralized computation on centrally stored data; (3) a combination of the first two. Decentralized computation becomes especially of interest when privacy of data or computation has to be taken into consideration. Examples of decentralized computation use cases that take privacy into account can be found in literature on outsourced computations, MPC, federated learning (FL), and DLTs. In subsequent sections, we will see that both DLTs and MPC are often used as base building blocks for realizing decentralized, verifiable, privacypreserving computation schemes. To analyze the privacy and security guarantees provided by those schemes, we also require an understanding of relevant threat models. 2.2. Threat models We informally describe the three most common security models regarding the possible behavior of the parties that have been corrupted by the adversary. For a more detailed treatment of the topic, we refer the reader to e.g., [14]: • Semi-honest adversaries: In this scenario, also known as the honest-but-curious or passive model, corrupted parties do not deviate from the selected protocol. The adversary does have access to all data received and owned by the corrupted parties, and tries to deduce as much as possible from this. • Malicious adversaries: In the malicious or active setting, the adversary can make corrupted parties deviate from the protocol in any way. A protocol is secure if it can prevent any malicious adversary from breaking security or privacy. When a protocol not only prevents cheating but also allows for determining who cheated, the protocol is said to support cheater detection, e.g., [15]. • Covert adversaries: Corrupted parties show the same behavior as in the malicious model. However, honest parties need only detect cheating parties with a given probability. In practice, it is assumed that the risk of getting caught and receiving a financial or reputation penalty is sufficient to deter an adversary. The notion of covert security with public verifiability was introduced in [16]. With public verifiability, not only can honest parties detect cheating with some probability, they can also construct a publicly verifiable certificate proving that a certain party has cheated, without revealing information on the private data of any honest party.

Verifiable Privacy-Preserving Computing: Preliminaries

This paper is available on arxiv under CC 4.0 license. Authors: (1) Ruta Jawale; (2) Dakshita Khurana. Table of Links Abstract and Introduction Technical Overview Preliminaries Unclonable Non-Interactive Zero-Knowledge in the CRS Model Unclonable NIZK in the Quantum Ramdon Oracle Model Unclonable Signatures of Knowledge References 3 Preliminaries 3.1 Post-Quantum Commitments and Encryption (Post-Quantum Commitments). Com is a post-quantum commitment scheme if it has the following syntax and properties. Definition 3.1 Syntax. • c ← Com(m; r): The polynomial-time algorithm Com on input a message m and randomness r ∈ {0, 1} r(λ) outputs commitment a c. Properties. (Post-Quantum Commitment). [LS19] Assuming the polynomial quantum hardness of LWE, there exists a non-interactive commitment with perfect binding and computational hiding (Definition 3.1). Theorem 3.2 (Post-Quantum Public-Key Encryption). (Gen, Enc, Dec) is a post-quantum publickey encryption scheme if it has the following syntax and properties. Definition 3.3 Syntax. • (pk,sk) ← Gen(1λ ): The polynomial-time algorithm Gen on input security parameter 1 λ outputs a public key pk and a secret key sk. • c ← Enc(pk, m; r): The polynomial-time algorithm Enc on input a public key pk, message m and randomness r ∈ {0, 1} r(λ) outputs a ciphertext c. • m ← Dec(sk, c): The polynomial-time algorithm Dec on input a secret key sk and a ciphertext c outputs a message m. Properties. 3.2 Sigma protocols Definition 3.4 (Post-Quantum Sigma Protocol for NP). [LZ19] Let NP relation R with corresponding language L be given such that they can be indexed by a security parameter λ ∈ N. Π = (P = (P.Com, P.Prove),V = (V.Ch,V.Ver)) is a post-quantum sigma protocol if it has the following syntax and properties. . The input 1 λ is left out when it is clear from context. Syntax • (α,st) ← P.Com(1λ , x, w): The probabilistic polynomial-size circuit on input an instance and witness pair (x, w) ∈ Lλ outputs a commitment α and an internal prover state st. P.Com • β ← V.Ch(1λ , x, α): The probabilistic polynomial-size circuit V.Ch on input an instance x outputs a uniformly random challenge β. • γ ← P.Prove(1λ , x, w,st, β): The probabilistic polynomial-size circuit on input an instance and witness pair (x, w) ∈ Lλ, an internal prover state st, and a challenge β outputs the partial opening (to α as indicated by β) γ. P. Prove • (1λ , x, α, β, γ) ∈ {0, 1}: The probabilistic polynomial-size circuit V.Ver on input an instance x, a commitment α, a challenge β, and a partial opening γ outputs 1 iff γ is a valid opening to α at locations indicated by β. V. Ver Properties. . For every λ ∈ N and every (x, w) ∈ Rλ, • Perfect Completeness There exists a quantum polynomial-size circuit Sim and a negligible function negl(·) such that for every polynomial-size quantum circuit D, every sufficiently large λ ∈ N, and every (x, w) ∈ Rλ, • Computational Honest-Verifier Zero-Knowledge with Quantum Simulator. • Unpredictable Commitment. There exists a negligible function such that for every sufficiently large λ ∈ N and every (x, w) ∈ Rλ, negl(·) We note that the unpredictable commitment property in the definition above may appear to be an unusual requirement, but this property is w.l.o.g. for post quantum sigma protocols as shown in [LZ19]. In particular, any sigma protocol which does not have unpredictable commitments, can be modified into one that does: the prover can append a random string r to the end of their commitment message α, and the verifier can ignore this appended string r when they perform their checks. 3.3 NIZKs in the CRS model We consider the common reference string model. Definition 3.5 (Post-Quantum (Quantum) NIZK for NP in the CRS Model). Let NP relation R with corresponding language L be given such that they can be indexed by a security parameter λ ∈ N is a non-interactive post-quantum (quantum) zero-knowledge argument for in the CRS model if it has the following syntax and properties. Π = (Setup, P,V) NP Syntax. The input 1 λ is left out when it is clear from context. • ← Setup(1λ ): The probabilistic polynomial-size circuit Setup on input 1 λ outputs a common reference string crs. crs • π ← P(1λ , , x, w): The probabilistic (quantum) polynomial-size circuit P on input a common reference string crs and instance and witness pair (x, w) ∈ Rλ, outputs a proof π. crs • V(1λ , , x, π) ∈ {0, 1}: The probabilistic (quantum) polynomial-size circuit V on input a common reference string , an instance x, and a proof π outputs 1 iff π is a valid proof for x. crs crs Properties. For every λ ∈ N and every (x, w) ∈ Rλ, • Perfect Completeness. There exists a negligible function such that for every polynomial-size quantum circuit A and every sufficiently large λ ∈ N, • Adaptive Computational Soundness. negl(·) There exists a probabilistic (quantum) polynomial-size circuit Sim = ( ) and a negligible function such that for every polynomial-size quantum circuit A, every polynomial-size quantum circuit D, and every sufficiently large λ ∈ N, • Adaptive Computational Zero-Knowledge. Sim0, Sim1 negl(·) (Post-Quantum NIZK argument for NP in the CRS Model). [PS19] Theorem 3.6 Assuming the polynomial quantum hardness of LWE, there exists a non-interactive adaptively computationally sound, adaptively computationally zero-knowledge argument for NP in the common reference string model (Definition 3.5). (Post-Quantum (Quantum) Simulation-Sound NIZK for NP in CRS Model). Let NP relation R with corresponding language L be given such that they can be indexed by a security parameter λ ∈ N Definition 3.7 Π = ( ) is a post-quantum (quantum) non-interactive simulation-sound, adaptive multi-theorem computational zero-knowledge protocol for in the CRS model if it has the following syntax and properties. Setup, P,V NP • Π is a post-quantum (quantum) non-interactive zero-knowledge argument for in the model (Definition 3.5). NP CRS • Adaptive Multi-Theorem Computational Zero-Knowledge. [FLS90] There exists a probabilistic (quantum) polynomial-size circuit Sim = ( ) 1 and a negligible function such that for every polynomial-size quantum circuit A, every polynomial-size quantum circuit D, and every sufficiently large λ ∈ N, Sim0, Sim1 negl(·) [Sah99, SCO+01] Let Sim = (Sim0, Sim1) be the simulator given by the adaptive multi-theorem computational zero-knowledge property. There exists a negligible function negl(·) such that for every oracle-aided polynomial-size quantum circuit A and every sufficiently large λ ∈ N, • Simulation Soundness. where is the list of queries from to Q A Sim1. REMARK 3.1. In Definition 3.7, adaptive multi-theorem computational zero-knowledge implies adaptive computational zero-knowledge. REMARK 3.2. As defined in Definition 3.7, a simulation-sound zero-knowledge protocol has adaptive computational soundness (Definition 3.5). (Simulation Sound Compiler). [SCO+01] Given one-way functions and a single-theorem NIZK proof system for NP, then there exists a non-interactive simulation sound, adaptively multi-theorem computationally zero-knowledge proof for NP in the common reference string model (Definition 3.7). Theorem 3.8 (Post-Quantum Simulation Sound NIZK for NP). Assuming the polynomial quantum hardness of LWE, there exists a post-quantum non-interactive simulation sound, adaptively multi-theorem computationally zero-knowledge proof for NP in the common reference string model (Definition 3.7). Corollary 3.9 . This follows from Theorem 3.6 and Theorem 3.8. Proof 3.4 NIZKs in the QRO model We now consider the quantum random oracle model. For sake of completeness, we briefly outline a definition for a quantum random oracle. A quantum random oracle O is a random function which support quantum queries and allows for the following accesses: Definition 3.10. On input a message, O outputs a uniformly random value. This is the usual access provided. When quantum access may be invoked, we denote the oracle as |O. • Query Access. Given programmability access, O can be set to output a specified value on a specified input. An arbitrary number of distinct points can be programmed. • Programmability Access. Given extractability access, specific queries to |O can be read. • Extractability Access. Definition 3.11 ((Quantum) Post-Quantum for in QROM). [LZ19] Let O be a random oracle. Let NP relation R with corresponding language L be given such that they can be indexed by a security parameter λ ∈ N. NIZKPoK NP Π = ( ) is a (quantum) non-interactive zero-knowledge proof of knowledge protocol with respect to a random oracle if it has the following syntax and properties. P,V Syntax. The input 1 λ is left out when it is clear from context. Properties. • Perfect Completeness. For every λ ∈ N and every (x, w) ∈ Rλ, There exists a quantum polynomial-size circuit Sim which ignores its second input and a negligible function such that for every oracle-aided polynomial-size quantum circuit D which is limited to making queries (x, ω) ∈ Rλ on input 1 λ , and every sufficiently large λ ∈ N, • Zero-Knowledge with Quantum Simulator. negl(·) • Proof of Knowledge with Quantum Extractor. There exists an oracle-aided quantum polynomial-size circuit extractor Ext that simulates a random oracle |O , a constant c, a polynomial p(·), and negligible functions negl0 (·), negl1 (·) such that for every polynomial-size quantum circuit A and every x with associated λ ∈ N satisfying Exti (NIZKPoK in QROM [Unr17, LZ19]). Let Π be a post-quantum sigma protocol (Definition 3.4). The Fiat-Shamir heuristic applied to Π yields a classical post-quantum NIZKPoK in the QROM (Definition 3.11). Theorem 3.12 3.5 Quantum Money (Public Key Quantum Money Mini-Scheme). [AC13, Zha19b] (Gen,Ver) is a public key quantum money scheme if it has the following syntax and properties. Definition 3.13 Syntax. Properties. (Quantum Money from Subspace Hiding Obfuscation [AC13, Zha19b]). Theorem 3.14 If injective one-way functions and post-quantum iO exist, then public-key quantum money exists (Definition 3.13). (Public Key Quantum Money Mini-Scheme in QROM). ( ) is a public key quantum money scheme with respect to a quantum random oracle O if it has the following syntax and properties. Definition 3.15 Gen, Ver Syntax. Properties The unpredicable serial number property is w.l.o.g., just as above. 3.6 Quantum Signature of Knowledge Definition 3.16 (Quantum SimExt-secure Signature [CL06]). Let relation R with corresponding language L be given such that they can be indexed by a security parameter λ ∈ N. Let a message space M be given such that it can be indexed by a security parameter λ ∈ N. NP ( ) is a SimExt-secure quantum signature of knowledge of a witness with respect to L and M if it has the following syntax and properties. Syntax. The input 1 λ is left out when it is clear from context. Setup, Sign, Verify • ( ) ← Setup(1λ ): The probabilistic polynomial-time algorithm Setup on input 1 λ outputs a common reference string and a trapdoor td. crs, td crs • σ ← (1λ , , x, w, m): The polynomial-time quantum algorithm Sign on input a common reference string , an instance and witness pair (x, w) ∈ Rλ, and a message m ∈ Mλ, outputs a signature σ. Sign crs crs • (1λ , crs, x, m, σ) ∈ {0, 1}: The polynomial-time quantum algorithm Verify on input a common reference string crs, an instance x, a message m ∈ Mλ, and a signature σ, outputs 1 iff σ is a valid signature of m with respect to crs, Rλ, and x. Verify Properties.

Unclonable Non-Interactive Zero-Knowledge: Preliminaries

This paper is available on arxiv under CC BY 4.0 DEED license. Authors: (1) Zhipeng Wang, Department of Computing, Imperial College London; (2) Nanqing Dong Department of Computer Science, University of Oxford; (3) Jiahao Sun, Data Science Institute, Imperial College London; (4) William Knottenbelt, Department of Computing, Imperial College London. TABLE OF LINKS Abstract & Introduction Related Work & Preliminaries Methodology Theoretical and Empirical Analysis Results Conclusion & References Related Work Zero-Knowledge Proofs. Zero-knowledge proofs (ZKPs) have emerged as a revolutionary cryptographic concept that allows one party (the prover) to demonstrate the truth of a statement to another party (the verifier) without revealing any information beyond the statement’s validity [12]. One of the most notable applications of ZKPs is in privacy-preserving authentication, where a user can prove to a aggregator that they know a secret without revealing the secret itself. ZKPs have also been applied in other areas, including blockchains [28,30], machine learning [22,31,9] and FL [6]. However, existing research, such as RoFL [6,21], has predominantly focused on using ZKPs to address malicious client behaviors or enhance the client privacy, while assuming the existence of a “honest-butcurious” (i.e., semi-honest) aggregator. In this work, we break away from this assumption and leverage ZKPs to ensure the honest aggregation of the centralized aggregator without requiring trust in the aggregator itself. Blockchain-based Federated Learning. Blockchain is a decentralized and immutable distributed ledger technology [15,10,4] that underpins cryptocurrencies such as Bitcoin [25] and Ethereum [33]. It provides a secure and transparent way to record and verify transactions across a network of nodes. Blockchain has been integrated with FL to tackle the security and privacy issues in existing FL [34,16,27,19,32]. Specifically, blockchain is used to store and manage the training model’s updates and the associated metadata securely and transparently. Instead of relying solely on a centralized aggregator to manage the model updates, the blockchain enables a decentralized and distributed consensus mechanism among the participating clients. However, existing blockchain-based FL designs [8] rely heavily on the computation of smart contracts (i.e., self-executing programs that run on a blockchain network and are triggered by blockchain events), which will cause expensive costs for FL networks with a large number of parameters. In our work, we address the scalability issue of blockchain-based FL by using zero-Knowledge proofs. Preliminaries In this section, we present the cryptographic building blocks for our zkFL system. Commitments. A commitment scheme enables an entity to conceal a value while committing to it, with the ability to disclose the value at a later time if desired. The commitment scheme typically comprises two rounds: the committing round and the revealing round. In the committing round, the client commits to specific values while ensuring their confidentiality from others. The client retains the option to reveal the committed value in the subsequent revealing round. A commitment scheme includes two algorithms: cm ← Commit(m, r) accepts a message m and a secret randomness r as inputs and returns the commitment cm. 0/1 ← Verify(m, r, cm) accepts a message m, a commitment cm and a decommitment value r as inputs, and returns 1 if the commitment is opened correctly and 0 otherwise. In this paper, we leverage Pedersen commitments [26,1] to compute the clients’ commitments/encryption on their local training model updates. Specifically, given the model update wi , a client will encrypt the update by computing Enc(wi) = g wi · h si , where g and h are public parameters and si is a random number generated by the client. Zero-Knowledge Proof Zero-knowledge proof [18,11,29] is a cryptographic primitive that allows a prover to convince the verifier about the correctness of some assertions without providing any meaningful information to the verifier. A zeroknowledge proof of some statement satisfies the following three properties: Completeness: If the statement st is true, an honest verifier will always be convinced by an honest prover. Soundness: For false statements, a prover cannot convince the verifier (even if the prover cheats and deviates from the protocol). Zero-knowledge: No verifier learns anything other than the fact that st is valid if it is true. In other words, knowing the statement, but not the secret, is enough to construct a scenario in which the prover knows the secret. A zero-knowledge Succinct Non-interactive ARgument of Knowledge (zkSNARK) is a “succinct” non-interactive zero-knowledge proof (NIZK) for arithmetic circuit satisfiability. The construction of zk-SNARK is based on a field F and an arithmetic circuit C. An arithmetic circuit satisfiability problem of a circuit C : F n × F h → F l is captured by the statement stC : {(x,wit) ∈ F n × F h : C(x,wit) = 0l}, with the language LC = {x ∈ F n | ∃ wit ∈ F h s.t. C(x,wit) = 0 l}. Apart from correctness, soundness, and zero-knowledge properties of zeroknowledge proof, a zk-SNARK requires two additional properties, i.e., succinctness and simulation extractability [12,2]. System and Threat Models In this section, we outline our system model, threat model, and system goals. System Model In the context of FL, clients represent individual devices, such as smartphones, tablets, or computers, each possessing its local dataset. These datasets remain secure and never leave the clients’ devices. Instead, the clients independently train their machine learning models on their local data and communicate only the model updates to the central aggregator. Clients: The aggregator acts as a central entity responsible for aggregating these model updates from multiple clients and computing a global model. This global model is then sent back to the clients, ensuring that each client benefits from the collective knowledge of the entire network while preserving data privacy and security. Aggregator: Threat Model We consider a malicious aggregator that can choose not to honestly aggregate the local model updates from clients. The malicious aggregator can deviate from the protocol by: Abandoning the updates generated from one or several honest clients. Creating fake model updates to replace the updates generated from honest clients Inserting fake model updates to the updates generated from honest clients. We would like to remark that the scope of this work centers around the malicious aggregator rather than the honest-but-curious one, with a specific emphasis on ensuring aggregation integrity. We also acknowledge the potential for the aggregator to carry out model inversion attacks on the clients, a topic we intend to delve into in a future study. System Goals The aggregator cannot abandon or replace the local model updates generated from honest clients, nor insert any fake model updates into the final aggregated model update. Otherwise, the clients will detect the malicious behaviors of the aggregator and halt the FL training process. Security: Only the participants (i.e., the aggregator and clients) in the FL system can know the aggregated model updates during each round. Privacy:

Zero Knowledge Proof based Gradient Aggregation for Federated Learning: Related Work & Preliminaries

The Mysterious Island by Jules Verne, is part of the HackerNoon Books Series. You can jump to any chapter in this book . Chapter XI here Chapter XI Gideon Spilett took the box and opened it. It contained nearly two hundred grains of a white powder, a few particles of which he carried to his lips. The extreme bitterness of the substance precluded all doubt; it was certainly the precious extract of quinine, that pre-eminent antifebrile. This powder must be administered to Herbert without delay. How it came there might be discussed later. “Some coffee!” said Spilett. In a few moments Neb brought a cup of the warm infusion. Gideon Spilett threw into it about eighteen grains of quinine, and they succeeded in making Herbert drink the mixture. There was still time, for the third attack of the malignant fever had not yet shown itself. How they longed to be able to add that it would not return! Besides, it must be remarked, the hopes of all had now revived. The mysterious influence had been again exerted, and in a critical moment, when they had despaired of it. In a few hours Herbert was much calmer. The colonists could now discuss this incident. The intervention of the stranger was more evident than ever. But how had he been able to penetrate during the night into Granite House? It was inexplicable, and, in truth, the proceedings of the genius of the island were not less mysterious than was that genius himself. During this day the sulphate of quinine was administered to Herbert every three hours. The next day some improvement in Herbert’s condition was apparent. Certainly, he was not out of danger, intermittent fevers being subject to frequent and dangerous relapses, but the most assiduous care was bestowed on him. And besides, the specific was at hand; nor, doubtless, was he who had brought it far distant! And the hearts of all were animated by returning hope. This hope was not disappointed. Ten days after, on the 20th of December, Herbert’s convalescence commenced. He was still weak, and strict diet had been imposed upon him, but no access of fever supervened. And then, the poor boy submitted with such docility to all the prescriptions ordered him! He longed so to get well! Pencroft was as a man who has been drawn up from the bottom of an abyss. Fits of joy approaching delirium seized him. When the time for the third attack had passed by, he nearly suffocated the reporter in his embrace. Since then, he always called him Dr. Spilett. The real doctor, however, remained undiscovered. “We will find him!” repeated the sailor. Certainly, this man, whoever he was, might expect a somewhat too energetic embrace from the worthy Pencroft! The month of December ended, and with it the year 1867, during which the colonists of Lincoln Island had of late been so severely tried. They commenced the year 1868 with magnificent weather, great heat, and a tropical temperature, delightfully cooled by the sea-breeze. Herbert’s recovery progressed, and from his bed, placed near one of the windows of Granite House, he could inhale the fresh air, charged with ozone, which could not fail to restore his health. His appetite returned, and what numberless delicate, savory little dishes Neb prepared for him! “It is enough to make one wish to have a fever oneself!” said Pencroft. During all this time, the convicts did not once appear in the vicinity of Granite House. There was no news of Ayrton, and though the engineer and Herbert still had some hopes of finding him again, their companions did not doubt but that the unfortunate man had perished. However, this uncertainty could not last, and when once the lad should have recovered, the expedition, the result of which must be so important, would be undertaken. But they would have to wait a month, perhaps, for all the strength of the colony must be put into requisition to obtain satisfaction from the convicts. However, Herbert’s convalescence progressed rapidly. The congestion of the liver had disappeared, and his wounds might be considered completely healed. During the month of January, important work was done on the plateau of Prospect Heights; but it consisted solely in saving as much as was possible from the devastated crops, either of corn or vegetables. The grain and the plants were gathered, so as to provide a new harvest for the approaching half-season. With regard to rebuilding the poultry-yard, wall, or stables, Cyrus Harding preferred to wait. While he and his companions were in pursuit of the convicts, the latter might very probably pay another visit to the plateau, and it would be useless to give them an opportunity of recommencing their work of destruction. When the island should be cleared of these miscreants, they would set about rebuilding. The young convalescent began to get up in the second week of January, at first for one hour a day, then two, then three. His strength visibly returned, so vigorous was his constitution. He was now eighteen years of age. He was tall, and promised to become a man of noble and commanding presence. From this time his recovery, while still requiring care,—and Dr. Spilett was very strict,—made rapid progress. Towards the end of the month, Herbert was already walking about on Prospect Heights, and the beach. He derived, from several sea-baths, which he took in company with Pencroft and Neb, the greatest possible benefit. Cyrus Harding thought he might now settle the day for their departure, for which the 15th of February was fixed. The nights, very clear at this time of year, would be favorable to the researches they intended to make all over the island. The necessary preparations for this exploration were now commenced, and were important, for the colonists had sworn not to return to Granite House until their twofold object had been achieved; on the one hand, to exterminate the convicts, and rescue Ayrton, if he was still living; on the other, to discover who it was that presided so effectually over the fortunes of the colony. Of Lincoln Island, the settlers knew thoroughly all the eastern coast from Claw Cape to the Mandible Capes, the extensive Tadorn Marsh, the neighborhood of Lake Grant, Jacamar Wood, between the road to the corral and the Mercy, the courses of the Mercy and Red Creek, and lastly, the spurs of Mount Franklin, among which the corral had been established. They had explored, though only in an imperfect manner, the vast shore of Washington Bay from Claw Cape to Reptile End, the woody and marshy border of the west coast, and the interminable downs, ending at the open mouth of Shark Gulf. But they had in no way surveyed the woods which covered the Serpentine Peninsula, all to the right of the Mercy, the left bank of Falls River, and the wilderness of spurs and valleys which supported three quarters of the base of Mount Franklin, to the east, the north, and the west, and where doubtless many secret retreats existed. Consequently, many millions of acres of the island had still escaped their investigations. It was, therefore, decided that the expedition should be carried through the Far West, so as to include all that region situated on the right of the Mercy. It might, perhaps, be better worth while to go direct to the corral, where it might be supposed that the convicts had again taken refuge, either to pillage or to establish themselves there. But either the devastation of the corral would have been an accomplished fact by this time, and it would be too late to prevent it, or it had been the convicts’ interest to entrench themselves there, and there would be still time to go and turn them out on their return. Therefore, after some discussion, the first plan was adhered to, and the settlers resolved to proceed through the wood to Reptile End. They would make their way with their hatchets, and thus lay the first draft of a road which would place Granite House in communication with the end of the peninsula for a length of from sixteen to seventeen miles. The cart was in good condition. The onagers, well rested, could go a long journey. Provisions, camp effects, a portable stove, and various utensils were packed in the cart, as also weapons and ammunition, carefully chosen from the now complete arsenal of Granite House. But it was necessary to remember that the convicts were, perhaps, roaming about the woods, and that in the midst of these thick forests a shot might quickly be fired and received. It was therefore resolved that the little band of settlers should remain together and not separate under any pretext whatever. It was also decided that no one should remain at Granite House. Top and Jup themselves were to accompany the expedition; the inaccessible dwelling needed no guard. The 14th of February, eve of the departure, was consecrated entirely to repose, and—thanksgiving addressed by the colonists to the Creator. A place in the cart was reserved for Herbert, who, though thoroughly convalescent, was still a little weak. The next morning, at daybreak, Cyrus Harding took the necessary measures to protect Granite House from any invasion. The ladders, which were formerly used for the ascent, were brought to the Chimneys and buried deep in the sand, so that they might be available on the return of the colonists, for the machinery of the lift had been taken to pieces, and nothing of the apparatus remained. Pencroft stayed the last in Granite House in order to finish this work, and he then lowered himself down by means of a double rope held below, and which, when once hauled down, left no communication between the upper landing and the beach. The weather was magnificent. “We shall have a warm day of it,” said the reporter, laughing. “Pooh! Dr. Spilett,” answered Pencroft, “we shall walk under the shade of the trees and shan’t even see the sun!” “Forward!” said the engineer. The cart was waiting on the beach before the Chimneys. The reporter made Herbert take his place in it during the first hours at least of the journey, and the lad was obliged to submit to his doctor’s orders. Neb placed himself at the onagers’ heads. Cyrus Harding, the reporter, and the sailor, walked in front. Top bounded joyfully along. Herbert offered a seat in his vehicle to Jup, who accepted it without ceremony. The moment for departure had arrived, and the little band set out. The cart first turned the angle of the mouth of the Mercy, then, having ascended the left bank for a mile, crossed the bridge, at the other side of which commenced the road to Port Balloon, and there the explorers, leaving this road on their left, entered the cover of the immense woods which formed the region of the Far West. For the first two miles the widely scattered trees allowed the cart to pass with ease; from time to time it became necessary to cut away a few creepers and bushes, but no serious obstacle impeded the progress of the colonists. The thick foliage of the trees threw a grateful shade on the ground. Deodars, Douglas firs, casuarinas, banksias, gum-trees, dragon-trees, and other well-known species, succeeded each other far as the eye could reach. The feathered tribes of the island were all represented—grouse, jacamars, pheasants, lories, as well as the chattering cockatoos, parrots, and paroquets. Agouties, kangaroos, and capybaras fled swiftly at their approach; and all this reminded the settlers of the first excursions they had made on their arrival at the island. “Nevertheless,” observed Cyrus Harding, “I notice that these creatures, both birds and quadrupeds, are more timid than formerly. These woods have, therefore, been recently traversed by the convicts, and we shall certainly find some traces of them.” And, in fact, in several places they could distinguish traces, more or less recent, of the passage of a band of men—here branches broken off the trees, perhaps to mark out the way; there the ashes of a fire, and footprints in clayey spots; but nothing which appeared to belong to a settled encampment. The engineer had recommended his companions to refrain from hunting. The reports of the firearms might give the alarm to the convicts, who were, perhaps, roaming through the forest. Moreover, the hunters would necessarily ramble some distance from the cart, which it was dangerous to leave unguarded. In the afterpart of the day, when about six miles from Granite House, their progress became much more difficult. In order to make their way through some thickets, they were obliged to cut down trees. Before entering such places Harding was careful to send in Top and Jup, who faithfully accomplished their commission, and when the dog and orang returned without giving any warning, there was evidently nothing to fear, either from convicts or wild beasts, two varieties of the animal kingdom, whose ferocious instincts placed them on the same level. On the evening of the first day the colonists encamped about nine miles from Granite House, on the border of a little stream falling into the Mercy, and of the existence of which they had till then been ignorant; it evidently, however, belonged to the hydiographical system to which the soil owed its astonishing fertility. The settlers made a hearty meal, for their appetites were sharpened, and measures were then taken that the night might be passed in safety. If the engineer had had only to deal with wild beasts, jaguars or others, he would have simply lighted fires all around his camp, which would have sufficed for its defense; but the convicts would be rather attracted than terrified by the flames, and it was, therefore, better to be surrounded by the profound darkness of night. The watch was, however, carefully organized. Two of the settlers were to watch together, and every two hours it was agreed that they should be relieved by their comrades. And so, notwithstanding his wish to the contrary, Herbert was exempted from guard. Pencroft and Gideon Spilett in one party, the engineer and Neb in another, mounted guard in turns over the camp. The night, however, was but of few hours. The darkness was due rather to the thickness of the foliage than to the disappearance of the sun. The silence was scarcely disturbed by the howling of jaguars and the chattering of the monkeys, the latter appearing to particularly irritate Master Jup. The night passed without incident, and on the next day, the 15th of February, the journey through the forest, tedious rather than difficult, was continued. This day they could not accomplish more than six miles, for every moment they were obliged to cut a road with their hatchets. Like true settlers, the colonists spared the largest and most beautiful trees, which would besides have cost immense labor to fell, and the small ones only were sacrificed, but the result was that the road took a very winding direction, and lengthened itself by numerous detours. During the day Herbert discovered several new specimens not before met with in the island, such as the tree-fern, with its leaves spread out like the waters of a fountain, locust-trees, on the long pods of which the onagers browsed greedily, and which supplied a sweet pulp of excellent flavor. There, too, the colonists again found groups of magnificent kauries, their cylindrical trunks, crowded with a cone of verdure, rising to a height of two hundred feet. These were the tree-kings of New Zealand, as celebrated as the cedars of Lebanon. As to the fauna, there was no addition to those species already known to the hunters. Nevertheless, they saw, though unable to get near them, a couple of those large birds peculiar to Australia, a sort of cassowary, called emu, five feet in height, and with brown plumage, which belong to the tribe of waders. Top darted after them as fast as his four legs could carry him, but the emus distanced him with ease, so prodigious was their speed. As to the traces left by the convicts, a few more were discovered. Some footprints found near an apparently recently extinguished fire were attentively examined by the settlers. By measuring them one after the other, according to their length and breadth, the marks of five men’s feet were easily distinguished. The five convicts had evidently camped on this spot; but,—and this was the object of so minute an examination,—a sixth footprint could not be discovered, which in that case would have been that of Ayrton. “Ayrton was not with them!” said Herbert. “No,” answered Pencroft, “and if he was not with them, it was because the wretches had already murdered him! but then these rascals have not a den to which they may be tracked like tigers!” “No,” replied the reporter, “it is more probable that they wander at random, and it is their interest to rove about until the time when they will be masters of the island!” “The masters of the island!” exclaimed the sailor; “the masters of the island!...” he repeated, and his voice was choked, as if his throat was seized in an iron grasp. Then in a calmer tone, “Do you know, Captain Harding,” said he, “what the ball is which I have rammed into my gun?” “No, Pencroft!” “It is the ball that went through Herbert’s chest, and I promise you it won’t miss its mark!” But this just retaliation would not bring Ayrton back to life, and from the examination of the footprints left in the ground, they must, alas! conclude that all hopes of ever seeing him again must be abandoned. That evening they encamped fourteen miles from Granite House, and Cyrus Harding calculated that they could not be more than five miles from Reptile Point. And indeed, the next day the extremity of the peninsula was reached, and the whole length of the forest had been traversed; but there was nothing to indicate the retreat in which the convicts had taken refuge, nor that, no less secret, which sheltered the mysterious unknown. About HackerNoon Book Series: We bring you the most important technical, scientific, and insightful public domain books. This book is part of the public domain. Jules Verne (1998). The Mysterious Island. Urbana, Illinois: Project Gutenberg. Retrieved October 2022 https://www.gutenberg.org/files/1268/1268-h/1268-h.htm This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this eBook or online at , located at . www.gutenberg.org https://www.gutenberg.org/policy/license.html

The extreme bitterness of the substance precluded all doubt

THE LANGUEDOCIAN SCORPION: PRELUDES TO THE WEDDING

Welcome back to the Power Leaders series -- interviews with tech leaders who are leading change, innovation and disrupting their respective industries. The past few days have been, to put it lightly, a tumultuous time for the startup world with the and all of the fallout related to that. Over the weekend I reflected heavily on the culture of “startup” and the risk that is inherent in everything founders do. What was once the “thought” of risk in a time where it seemed everyone was closing $100M+ Series A rounds, is now front and center and forcing everyone in the industry to be mindful of every successful moment. collapse of SVB It is important to me to continue to recognize leaders who persevere through tough times, remain focused on their goals and, for some, achieve levels of success despite all of the risk all around. Up next is co-founder and CEO Narek Vardanyan. product concept and validation platform Prelaunch.com Let’s jump in. SE: Thanks so much for sharing with the community, Narek. What innovations are you bringing to your industry? What sets you apart from your competitors? Prelaunch.com is a product validation platform.  Unlike surveys and focus groups, which are based on peoples’ opinions, Prelaunch is based on actual purchase intent. Potential customers are screened by placing $10-20 to reserve a discount if product launches into the market. But more importantly, it confirms their actual buying intent. As the model is based on real buying behavior, there has never been a better indicator for launch success. This changes everything. NV: SE: What is a recent win or announcement your company just celebrated? Why does it matter? (e.g. funding, new product, new hire, new feature, etc...) Funding: seed funding from Big Story VC, Formula VC, Grantaus Ventures and notable angles like Vahe Kuzoyan, co-founder of Service Titan (10B+ company).  Notable Campaigns: ex-Harley Davidson design legend decided to prelaunch his much anticipated electric motorcycle — — exclusively on Prelaunch.com. Other notable campaigns were and Air-to-Water Dispenser. Both launched and generated more than $1M in sales. Kara Water was recognized as of 2022.  CES 2023: As a creative concept for CES 2023 we developed a fun concept of the Gallery of Flops, and featured some of the biggest product failures in consumer electronics of the last 25 years from Apple, Amazon, Nike etc. It got covered over 200 times from top media such as , , , and many more. NV: We raised $1.5m Erik Buell Fuell Fllow Dragonfly Hyperscooter Kara Pure Times Best Inventions Daily Mail Fast Company Wired SE: What pain point(s) does your company solve? Hardware companies are spending hundreds of thousands of dollars on various research and focus group companies. It’s taking a lot of time and the results are not trustworthy as it’s based on peoples’ opinions, which can be biased. NV: Prelaunch takes away the bias by relying on customers actual buying behavior. It’s also 10x cheaper and faster. SE: What are your company’s industry major challenges right now? Product development is a long process. The "lean methodology" is considered a religion in software, but hardware companies still work in isolation without incorporating actionable customers' feedback into the production process. As a result, large amounts of money are invested in products that fail. One third of the entire stock in the fashion and hardware industries is unused stock, which is returned and is not recyclable. NV: SE: What stories aren’t currently being told about your industry that your audience should know? In order to understand the market demand, companies and founders create surveys and promote them in social media. It’s not only can result in wrong answers from wrong people, but is also very dangerous. It can rlead to the false-positive perception whereas there’s not a strong demand in the market, but the signals are positive. As well as false-negative, whereas the product actually has a not bad potential but the audience is wrong and doesn’t engage with it. When somebody pays actual money, it’s when their opinion starts to matter. NV: SE: How do you envision your business changing in the next 3-5 years? In 3-5 years these practices should become a standard for any new innovative product development. Companies across various verticals of ecommerce will prelaunch their early stage concepts, assess the data, meet their customers and confidently co-create meaningful innovations together. NV: SE: What changes do you think are necessary for your industry to stay competitive in current economic times? Don’t work in isolation, don’t assume that the market remains the same and will consume the exact products that were popular last year. But rather, actively engage with your potential customers at a very early stage, get feedback and assess te data. It will help you to not waste precious resources on products that don’t have a demand. NV: SE: What measures has your organization taken to ensure you're driving towards the most important goals? We are implementing what we advocate others to implement. We have a closed group composed from our creators who constantly participate in product creation and actively engage with the testing of new features and in defining the priorities. It helps us not spend resources on developing features that are not the most important ones. NV: SE: Anything else we should know? Prelaunch for Consumers: From a Consumer perspective, Prelaunch provides with an access to the coming soon products of their favorite brands. They can put down $10-20 and reserve a very significant discount if those products are released in the markets. The best part is that there’s no risk and if they change their minds or Creator decides to stop the production, Consumers get a full refund. We don’t give these reservations to Creators (unlike crowdfunding platforms) but keep them on our escrow accounts until they start the shipping. NV:

POWER LEADER: How Prelaunch's Narek Vardanyan Helps Companies Validate Market Entry

Difficulties and Preliminary Approach

First and Last Things by H. G. Wells, is part of the HackerNoon Books Series. You can jump to any chapter in this book here . THE PRELIMINARY SOCIAL DUTY THE PRELIMINARY SOCIAL DUTY. The belief I have that contributing to the development of the collective being of man is the individual’s general meaning and duty, and the formulae of the Socialism which embodies this belief so far as our common activities go, give a general framework and direction how a man or woman should live. (I do throughout all this book mean man or woman equally when I write of “man,” unless it is manifestly inapplicable.) And first in this present time he must see to it that he does live, that is to say he must get food, clothing, covering, and adequate leisure for the finer aspects of living. Socialism plans an organized civilization in which these things will be a collective solicitude, and the gaining of a subsistence an easy preliminary to the fine drama of existence, but in the world as we have it we are forced to engage much of our energy in scrambling for these preliminary necessities. Our problems of conduct lie in the world as it is and not in the world as we want it to be. First then a man must get a living, a fair civilized living for himself. It is a fundamental duty. It must be a fair living, not pinched nor mean nor strained. A man can do nothing higher, he can be no service to any cause, until he himself is fed and clothed and equipped and free. He must earn this living or equip himself to earn it in some way not socially disadvantageous, he must contrive as far as possible that the work he does shall be constructive and contributory to the general well-being. And these primary necessities of food, clothing and freedom being secured, one comes to the general disposition of one’s surplus energy. With regard to that I think that a very simple proposition follows from the broad beliefs I have chosen to adopt. The general duty of a man, his existence being secured, is to educate, and chiefly to educate and develop himself. It is his duty to live, to make all he can out of himself and life, to get full of experience, to make himself fine and perceiving and expressive, to render his experience and perceptions honestly and helpfully to others. And in particular he has to educate himself and others with himself in Socialism. He has to make and keep this idea of synthetic human effort and of conscious constructive effort clear first to himself and then clear in the general mind. For it is an idea that comes and goes. We are all of us continually lapsing from it towards individual isolation again. He needs, we all need, constant refreshment in this belief if it is to remain a predominant living fact in our lives. And that duty of education, of building up the collective idea and organization of humanity, falls into various divisions depending in their importance upon individual quality. For all there is one personal work that none may evade, and that is thinking hard, criticising strenuously and understanding as clearly as one can religion, socialism and the general principle of one’s acts. The intellectual factor is of primary importance in my religion. I can see no more reason why salvation should come to the intellectually incapable than to the morally incapable. For simple souls thinking in simple processes, salvation perhaps comes easily, but there is none for the intellectual coward, for the mental sloven and sluggard, for the stupid and obdurate mind. The Believer will think hard and continue to grow and learn, to read and seek discussion as his needs determine. Correlated with one’s own intellectual activity, part of it and growing out of it for almost everyone, is intellectual work with and upon others. By teaching we learn. Not to communicate one’s thoughts to others, to keep one’s thoughts to oneself as people say, is either cowardice or pride. It is a form of sin. It is a duty to talk, teach, explain, write, lecture, read and listen. Every truly religious man, every good Socialist, is a propagandist. Those who cannot write or discuss can talk, those who cannot argue can induce people to listen to others and read. We have a belief and an idea that we want to spread, each to the utmost of his means and measure, throughout all the world. We have a thought that we want to make humanity’s thought. And it is a duty too that one should, within the compass of one’s ability, make teaching, writing and lecturing possible where it has not existed before. This can be done in a hundred ways, by founding and enlarging schools and universities and chairs, for example; by making print and reading and all the material of thought cheap and abundant, by organizing discussion and societies for inquiry. And talk and thought and study are but the more generalized aspects of duty. The Believer may find his own special aptitude lies rather among concrete things, in experimenting and promoting experiments in collective action. Things teach as well as words, and some of us are most expressive by concrete methods. The Believer will work himself and help others to his utmost in all those developments of material civilization, in organized sanitation for example, all those developments that force collective acts upon communities and collective realizations into the minds of men. And the whole field of scientific research is a field of duty calling to everyone who can enter it, to add to the permanent store of knowledge and new resources for the race. The Mind of that Civilized State we seek to make by giving ourselves into its making, is evidently the central work before us. But while the writer, the publisher and printer, the bookseller and librarian and teacher and preacher, the investigator and experimenter, the reader and everyone who thinks, will be contributing themselves to this great organized mind and intention in the world, many sorts of specialized men will be more immediately concerned with parallel and more concrete aspects of the human synthesis. The medical worker and the medical investigator, for example, will be building up the body of a new generation, the body of the civilized state, and he will be doing all he can, not simply as an individual, but as a citizen, to ORGANIZE his services of cure and prevention, of hygiene and selection. A great and growing multitude of men will be working out the apparatus of the civilized state; the organizers of transit and housing, the engineers in their incessantly increasing variety, the miners and geologists estimating the world’s resources in metals and minerals, the mechanical inventors perpetually economizing force. The scientific agriculturist again will be studying the food supply of the world as a whole, and how it may be increased and distributed and economized. And to the student of law comes the task of rephrasing his intricate and often quite beautiful science in relation to modern conceptions. All these and a hundred other aspects are integral to the wide project of Constructive Socialism as it shapes itself in my faith. About HackerNoon Book Series: We bring you the most important technical, scientific, and insightful public domain books. This book is part of the public domain. H. G. Wells (2009). First and Last Things: A Confession of Faith and Rule of Life. Urbana, Illinois: Project Gutenberg. Retrieved October 2022, https://www.gutenberg.org/files/4225/4225-h/4225-h.htm This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this eBook or online at www.gutenberg.org , located at https://www.gutenberg.org/policy/license.html .

THE PRELIMINARY SOCIAL DUTY

Introduction When I did my first “What The Heck Is…?” on a few months ago, I expected that to be a one-off, but then I ran across and did another one. Now I’ve run across (pronounced Prequel) which stands for “Pipelined Relational Query Language”, and I’m wondering what the heck it is exactly, so this is looking like a series as long as I keep finding things I want to know what the heck they are. At first glance, PRQL seems very similar to Malloy, so join me won’t you while we explore what the heck PRQL is. DuckDB Malloy PRQL Digging In From the PRQL website, they describe it this way: “ ” continuing.. PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement. Like SQL, it's readable, explicit, and declarative. Unlike SQL, it forms a logical pipeline of transformations and supports abstractions such as variables and functions. It can be used with any database that uses SQL, since it compiles to SQL. “ ” PRQL consists of a curated set of orthogonal transformations, which are combined together to form a pipeline. That makes it easy to compose and extend queries. The language also benefits from modern features, such syntax for dates, ranges and f-strings as well as functions, type checking and better null handling. Let’s look at a couple of screenshots of examples of PRQL, I’m using screenshots to preserve the formatting and syntax coloring, I wasn’t pleased with the results in my piece about Malloy. The resulting SQL, here is a basic example that reads from the employees' table and shows the id, name, and age, sorted by age and limited to 10: How about this example where we read from the employee table and do some date math: I love the brevity of this example, which really illustrates how simple you can make a task with PRQL: And just one more that illustrates the all-important JOIN: Ecosystem There is a concise set of for everything you can read online. In addition to that, there is a robust, growing list of tools and integrations: documentation Integrations - Allows writing PRQL in dbt models. dbt - PyPrql contains a Jupyter extension, which can also be used with Jupyter/IPython DuckDB - Extension for syntax highlighting Visual Studio Code - Adds PRQL models to your Prefect workflows Prefect Tools - In-browser (WASM) playground that compiles PRQL to SQL interactively Playground - Python TUI to connect to databases, includes a native interactive console for Jupyter/IPython PyPrql Bindings - Python bindings for prql-compiler prql-python - JavaScroipt bindings for prql-compiler prql-js - PRQL compiler library (written in Rust) prql-compiler ** **Let’s take a little look at the__ __ while we’re at it, I’m a big fan of all these projects illustrating cool uses of of late. This first example is joining multiple tables to look at average salaries per department. The PRQL is less than half the code and arguably, easier to read: playground WASM This next one is more complex, and while only a few lines shorter based on the formatting for readability, I’d argue is very readable. Obviously, you need to get accustomed to the syntax, but I like where this is headed. Summary SQL is certainly ubiquitous, but it isn’t without its problems, especially around scaling and reusability. Between Malloy and PRQL in particular, there are now some compelling alternatives to look at. Yes, as I said with Malloy, it’s another language, but it is generally easy to read, write and understand. I think they probably could have just used some SQL keywords like “LIMIT” instead of “TAKE” and maybe kept “SELECT” instead of “DERIVE”, but I get what they are doing. I would have liked to have seen bindings for golang and Julia, but I imagine those will show up when someone is interested enough. I really appreciated the WASM playground they provided, and it’s probably something a SQL person would want to keep handy as a reference to make sure things are being translated as expected. This article was really meant to just bring your attention to something you might find useful Is it for you? Try it and see, and big kudos to the core developers Aljaž Mur Eržen, Maximilian Roos, and Charlie Sanders for their hard work, and make sure to follow the project on and as well. GitHub Twitter

What the Heck is PRQL?

This paper is available on arxiv under CC BY-NC-SA 4.0 DEED license.
Authors:
(1) Yejin Bang, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology;
(2) Nayeon Lee, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology;
(3) Pascale Fung, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology. Table of Links Abstract and Intro
Related Work
Approach
Experiments
Conclusion
Limitations, Ethics Statement and References
A. Experimental Details
B. Generation Results 6.1. Limitations The study is limited by its adherence to the benchmark’s English-based task setup. The analysis is constrained to political ideologies in the United States and the English language. Additionally, the BART model’s 1024 sub-token input limit restricts the number of biased source articles that can be included as an input. It is important to note that these limitations, while potentially impacting the scope of the study’s findings, are not uncommon in natural language processing research. Nonetheless, future research may benefit from addressing these limitations by exploring alternative methods for a broader range of political ideologies (NonU.S. political ideologies) and languages, as well as incorporating longer input texts to capture a more comprehensive range of source articles. 6.2. Ethics Statement The issue of biased articles with framing has been extensively studied, as it can lead to polarization by influencing readers’ opinions toward a certain person, group, or topic. To address this problem, our research focuses on introducing a loss function that can be incorporated to enable the model to reduce framing bias in the generated summary. However, it is important to recognize that automatic technologies can also have unintended negative consequences if not developed with careful consideration of their broader impacts. For example, machine learning models can introduce bias in their output, replacing known source bias with another form of bias (Lee et al., 2022). To mitigate this risk, Lee et al. (2022) have suggested including explicit mention of the source articles alongside automatically generated neutral summaries. Furthermore, while our work aims to remove framing bias in human-generated articles, there is the potential for hallucination in the generation, which is a well-known problem of generative models (Ji et al., 2023). Thus, it is important to equip a guardrail (e.g., a provision of source reference) if such automatic technology is implemented for actual use cases. Despite these challenges, our research can contribute to the effort of mitigating human-generated framing bias in order to reduce polarization in society. One of the use cases can be to aid human experts in the process of providing multi-view synthesized articles without framing bias. In terms of broader societal impact, we hope our work can help online users access more depolarized information online. 6.3. References 2021. Center – what does a "center" media bias rating mean? Ramy Baly, Giovanni Da San Martino, James Glass, and Preslav Nakov. 2020. We can detect your bias: Predicting the political ideology of news articles. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 4982–4991, Online. Association for Computational Linguistics. Adriana Beratšová, Kristína Krchová, Nikola Gažová, and Michal Jirásek. 2016. Framing and bias: a literature review of recent findings. Central European journal of management, 3(2). Dennis Chong and James N Druckman. 2007. Framing theory. Annu. Rev. Polit. Sci., 10:103–126. Robert M Entman. 2002. Framing: Towards clarification of a fractured paradigm. McQuail’s Reader in Mass Communication Theory. London, California and New Delhi: Sage. Robert M Entman. 2007. Framing bias: Media in the distribution of power. Journal of communication, 57(1):163–173. Robert M Entman. 2010. Media framing biases and political power: Explaining slant in news of campaign 2008. Journalism, 11(4):389–408. Alexander R Fabbri, Irene Li, Tianwei She, Suyi Li, and Dragomir R Radev. 2019. Multi-news: A large-scale multi-document summarization dataset and abstractive hierarchical model. arXiv preprint arXiv:1906.01749 Lisa Fan, Marshall White, Eva Sharma, Ruisi Su, Prafulla Kumar Choubey, Ruihong Huang, and Lu Wang. 2019. In plain sight: Media bias through the lens of factual reporting. arXiv preprint arXiv:1909.02670. Matthew Gentzkow and Jesse M Shapiro. 2006. Media bias and reputation. Journal of political Economy, 114(2):280–316. Matthew Gentzkow, Jesse M Shapiro, and Daniel F Stone. 2015. Media bias in the marketplace: Theory. In Handbook of media economics, volume 1, pages 623–645. Elsevier. Erving Goffman. 1974. Frame analysis: An essay on the organization of experience. Harvard University Press Felix Hamborg, Karsten Donnay, and Bela Gipp. 2019. Automated identification of media bias in news articles: an interdisciplinary literature review. International Journal on Digital Libraries, 20(4):391–415. Felix Hamborg, Norman Meuschke, and Bela Gipp. 2017. Matrix-based news aggregation: exploring different news perspectives. In 2017 ACM/IEEE Joint Conference on Digital Libraries (JCDL), pages 1–10. IEEE. Ziwei Ji, Nayeon Lee, Rita Frieske, Tiezheng Yu, Dan Su, Yan Xu, Etsuko Ishii, Ye Jin Bang, Andrea Madotto, and Pascale Fung. 2023. Survey of hallucination in natural language generation. ACM Comput. Surv., 55(12). Daniel Kahneman and Amos Tversky. 2013. Prospect theory: An analysis of decision under risk. In Handbook of the fundamentals of financial decision making: Part I, pages 99–127. World Scientific. Philippe Laban and Marti A Hearst. 2017. newslens: building and visualizing long-ranging news stories. In Proceedings of the Events and Stories in the News Workshop, pages 1–9. Nayeon Lee, Yejin Bang, Tiezheng Yu, Andrea Madotto, and Pascale Fung. 2022. NeuS: Neutral multi-news summarization for mitigating framing bias. In Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 3131–3148, Seattle, United States. Association for Computational Linguistics. Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Ves Stoyanov, and Luke Zettlemoyer. 2019. Bart: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension. arXiv preprint arXiv:1910.13461. Yujian Liu, Xinliang Frederick Zhang, David Wegsman, Nicholas Beauchamp, and Lu Wang. 2022. POLITICS: Pretraining with same-story article comparison for ideology prediction and stance detection. In Findings of the Association for Computational Linguistics: NAACL 2022, pages 1354–1374, Seattle, United States. Association for Computational Linguistics. Saif Mohammad. 2018. Obtaining reliable human ratings of valence, arousal, and dominance for 20,000 english words. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 174–184. Fred Morstatter, Liang Wu, Uraz Yavanoglu, Stephen R Corman, and Huan Liu. 2018. Identifying framing bias in online news. ACM Transactions on Social Computing, 1(2):1–18. Kishore Papineni, Salim Roukos, Todd Ward, and WeiJing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of the 40th annual meeting of the Association for Computational Linguistics, pages 311–318. Souneil Park, Seungwoo Kang, Sangyoung Chung, and Junehwa Song. 2009. Newscube: delivering multiple aspects of news to mitigate media bias. In Proceedings of the SIGCHI conference on human factors in computing systems, pages 443–452. Dietram A Scheufele. 2000. Agenda-setting, priming, and framing revisited: Another look at cognitive effects of political communication. Mass communication & society, 3(2-3):297–316. All Sides. 2018. Media bias ratings. Allsides.com. Timo Spinde, Christina Kreuter, Wolfgang Gaissmaier, Felix Hamborg, Bela Gipp, and Helge Giese. 2021. Do you think it’s biased? how to ask for the perception of media bias. In 2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL), pages 61–69. IEEE. Esther van den Berg and Katja Markert. 2020. Context in informational bias detection. In Proceedings of the 28th International Conference on Computational Linguistics, pages 6315–6326, Barcelona, Spain (Online). International Committee on Computational Linguistics. George Wright and Paul Goodwin. 2002. Eliminating a framing bias by using simple instructions to ‘think harder’and respondents with managerial experience: Comment on ‘breaking the frame’. Strategic management journal, 23(11):1059–1067. Jingqing Zhang, Yao Zhao, Mohammad Saleh, and Peter J. Liu. 2019a. Pegasus: Pre-training with extracted gap-sentences for abstractive summarization. Tianyi Zhang*, Varsha Kishore*, Felix Wu*, Kilian Q. Weinberger, and Yoav Artzi. 2020. Bertscore: Evaluating text generation with bert. In International Conference on Learning Representations. Yifan Zhang, Giovanni Da San Martino, Alberto BarrónCedeno, Salvatore Romeo, Jisun An, Haewoon Kwak, Todor Staykovski, Israa Jaradat, Georgi Karadzhov, Ramy Baly, et al. 2019b. Tanbih: Get to know what you are reading. EMNLP-IJCNLP 2019, page 223. This paper is available on arxiv under CC BY-NC-SA 4.0 DEED license. Authors: (1) Yejin Bang, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology; (2) Nayeon Lee, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology; (3) Pascale Fung, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology. This paper is available on arxiv under CC BY-NC-SA 4.0 DEED license. Authors: Authors: (1) Yejin Bang, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology; (2) Nayeon Lee, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology; (3) Pascale Fung, Centre for Artificial Intelligence Research (CAiRE), The Hong Kong University of Science and Technology. Table of Links Abstract and Intro Related Work Approach Experiments Conclusion Limitations, Ethics Statement and References A. Experimental Details B. Generation Results Abstract and Intro Abstract and Intro Related Work Related Work Approach Approach Experiments Experiments Conclusion Conclusion Limitations, Ethics Statement and References Limitations, Ethics Statement and References A. Experimental Details A. Experimental Details B. Generation Results B. Generation Results 6.1. Limitations The study is limited by its adherence to the benchmark’s English-based task setup. The analysis is constrained to political ideologies in the United States and the English language. Additionally, the BART model’s 1024 sub-token input limit restricts the number of biased source articles that can be included as an input. It is important to note that these limitations, while potentially impacting the scope of the study’s findings, are not uncommon in natural language processing research. Nonetheless, future research may benefit from addressing these limitations by exploring alternative methods for a broader range of political ideologies (NonU.S. political ideologies) and languages, as well as incorporating longer input texts to capture a more comprehensive range of source articles. 6.2. Ethics Statement The issue of biased articles with framing has been extensively studied, as it can lead to polarization by influencing readers’ opinions toward a certain person, group, or topic. To address this problem, our research focuses on introducing a loss function that can be incorporated to enable the model to reduce framing bias in the generated summary. However, it is important to recognize that automatic technologies can also have unintended negative consequences if not developed with careful consideration of their broader impacts. For example, machine learning models can introduce bias in their output, replacing known source bias with another form of bias (Lee et al., 2022). To mitigate this risk, Lee et al. (2022) have suggested including explicit mention of the source articles alongside automatically generated neutral summaries. Furthermore, while our work aims to remove framing bias in human-generated articles, there is the potential for hallucination in the generation, which is a well-known problem of generative models (Ji et al., 2023). Thus, it is important to equip a guardrail (e.g., a provision of source reference) if such automatic technology is implemented for actual use cases. Despite these challenges, our research can contribute to the effort of mitigating human-generated framing bias in order to reduce polarization in society. One of the use cases can be to aid human experts in the process of providing multi-view synthesized articles without framing bias. In terms of broader societal impact, we hope our work can help online users access more depolarized information online. 6.3. References 2021. Center – what does a "center" media bias rating mean? Ramy Baly, Giovanni Da San Martino, James Glass, and Preslav Nakov. 2020. We can detect your bias: Predicting the political ideology of news articles. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 4982–4991, Online. Association for Computational Linguistics. Adriana Beratšová, Kristína Krchová, Nikola Gažová, and Michal Jirásek. 2016. Framing and bias: a literature review of recent findings. Central European journal of management, 3(2). Dennis Chong and James N Druckman. 2007. Framing theory. Annu. Rev. Polit. Sci., 10:103–126. Robert M Entman. 2002. Framing: Towards clarification of a fractured paradigm. McQuail’s Reader in Mass Communication Theory. London, California and New Delhi: Sage. Robert M Entman. 2007. Framing bias: Media in the distribution of power. Journal of communication, 57(1):163–173. Robert M Entman. 2010. Media framing biases and political power: Explaining slant in news of campaign 2008. Journalism, 11(4):389–408. Alexander R Fabbri, Irene Li, Tianwei She, Suyi Li, and Dragomir R Radev. 2019. Multi-news: A large-scale multi-document summarization dataset and abstractive hierarchical model. arXiv preprint arXiv:1906.01749 Lisa Fan, Marshall White, Eva Sharma, Ruisi Su, Prafulla Kumar Choubey, Ruihong Huang, and Lu Wang. 2019. In plain sight: Media bias through the lens of factual reporting. arXiv preprint arXiv:1909.02670. Matthew Gentzkow and Jesse M Shapiro. 2006. Media bias and reputation. Journal of political Economy, 114(2):280–316. Matthew Gentzkow, Jesse M Shapiro, and Daniel F Stone. 2015. Media bias in the marketplace: Theory. In Handbook of media economics, volume 1, pages 623–645. Elsevier. Erving Goffman. 1974. Frame analysis: An essay on the organization of experience. Harvard University Press Felix Hamborg, Karsten Donnay, and Bela Gipp. 2019. Automated identification of media bias in news articles: an interdisciplinary literature review. International Journal on Digital Libraries, 20(4):391–415. Felix Hamborg, Norman Meuschke, and Bela Gipp. 2017. Matrix-based news aggregation: exploring different news perspectives. In 2017 ACM/IEEE Joint Conference on Digital Libraries (JCDL), pages 1–10. IEEE. Ziwei Ji, Nayeon Lee, Rita Frieske, Tiezheng Yu, Dan Su, Yan Xu, Etsuko Ishii, Ye Jin Bang, Andrea Madotto, and Pascale Fung. 2023. Survey of hallucination in natural language generation. ACM Comput. Surv., 55(12). Daniel Kahneman and Amos Tversky. 2013. Prospect theory: An analysis of decision under risk. In Handbook of the fundamentals of financial decision making: Part I, pages 99–127. World Scientific. Philippe Laban and Marti A Hearst. 2017. newslens: building and visualizing long-ranging news stories. In Proceedings of the Events and Stories in the News Workshop, pages 1–9. Nayeon Lee, Yejin Bang, Tiezheng Yu, Andrea Madotto, and Pascale Fung. 2022. NeuS: Neutral multi-news summarization for mitigating framing bias. In Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 3131–3148, Seattle, United States. Association for Computational Linguistics. Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Ves Stoyanov, and Luke Zettlemoyer. 2019. Bart: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension. arXiv preprint arXiv:1910.13461. Yujian Liu, Xinliang Frederick Zhang, David Wegsman, Nicholas Beauchamp, and Lu Wang. 2022. POLITICS: Pretraining with same-story article comparison for ideology prediction and stance detection. In Findings of the Association for Computational Linguistics: NAACL 2022, pages 1354–1374, Seattle, United States. Association for Computational Linguistics. Saif Mohammad. 2018. Obtaining reliable human ratings of valence, arousal, and dominance for 20,000 english words. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 174–184. Fred Morstatter, Liang Wu, Uraz Yavanoglu, Stephen R Corman, and Huan Liu. 2018. Identifying framing bias in online news. ACM Transactions on Social Computing, 1(2):1–18. Kishore Papineni, Salim Roukos, Todd Ward, and WeiJing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of the 40th annual meeting of the Association for Computational Linguistics, pages 311–318. Souneil Park, Seungwoo Kang, Sangyoung Chung, and Junehwa Song. 2009. Newscube: delivering multiple aspects of news to mitigate media bias. In Proceedings of the SIGCHI conference on human factors in computing systems, pages 443–452. Dietram A Scheufele. 2000. Agenda-setting, priming, and framing revisited: Another look at cognitive effects of political communication. Mass communication & society, 3(2-3):297–316. All Sides. 2018. Media bias ratings. Allsides.com. Timo Spinde, Christina Kreuter, Wolfgang Gaissmaier, Felix Hamborg, Bela Gipp, and Helge Giese. 2021. Do you think it’s biased? how to ask for the perception of media bias. In 2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL), pages 61–69. IEEE. Esther van den Berg and Katja Markert. 2020. Context in informational bias detection. In Proceedings of the 28th International Conference on Computational Linguistics, pages 6315–6326, Barcelona, Spain (Online). International Committee on Computational Linguistics. George Wright and Paul Goodwin. 2002. Eliminating a framing bias by using simple instructions to ‘think harder’and respondents with managerial experience: Comment on ‘breaking the frame’. Strategic management journal, 23(11):1059–1067. Jingqing Zhang, Yao Zhao, Mohammad Saleh, and Peter J. Liu. 2019a. Pegasus: Pre-training with extracted gap-sentences for abstractive summarization. Tianyi Zhang*, Varsha Kishore*, Felix Wu*, Kilian Q. Weinberger, and Yoav Artzi. 2020. Bertscore: Evaluating text generation with bert. In International Conference on Learning Representations. Yifan Zhang, Giovanni Da San Martino, Alberto BarrónCedeno, Salvatore Romeo, Jisun An, Haewoon Kwak, Todor Staykovski, Israa Jaradat, Georgi Karadzhov, Ramy Baly, et al. 2019b. Tanbih: Get to know what you are reading. EMNLP-IJCNLP 2019, page 223.

Stories, News & Mentions about PREQL

Preql’s Stories on HackerNoon