{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VELQVPKMWSFHHSGM5IB37PMX4J","short_pith_number":"pith:VELQVPKM","schema_version":"1.0","canonical_sha256":"a9170abd4cb48a73c8ccea03bfbd97e24397bcb6144a282c03e4c334cd9f04d4","source":{"kind":"arxiv","id":"1805.03319","version":1},"attestation_state":"computed","paper":{"title":"Quadratically Constrained Channels with Causal Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anand D. Sarwate, Bikash Kumar Dey, Michael Langberg, Sidharth Jaggi, Tongxin Li","submitted_at":"2018-05-08T23:48:35Z","abstract_excerpt":"We consider the problem of communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiver Bob by transmitting a real-valued length-$n$ codeword $\\mathbf{x}=x_1,...,x_n$ through a communication channel. Alice and Bob do not share common randomness. Knowing Alice's encoding strategy, an adversarial jammer James chooses a real-valued length-n noise sequence $\\mathbf{s}=s_1,..,s_n$ in a causal manner, i.e., each $s_t (1<=t<=n)$ can only depend on $x_1,...,x_t$. Bob receives $\\mathbf{y}$, the sum of Alice's"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.03319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-08T23:48:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d6316be75609e05874b01b0fca3f0ccd32832fdc09c234207ee5827eb21f0d8","abstract_canon_sha256":"c88d72d1c0f3d58b14d4a70f021bff51b6f935350ec4f92f3e48499c537dd934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.516716Z","signature_b64":"wmJ8f/HAt0AZ63l4rpbEPyzSiHRIDOzQv4tCuPx3mVkuAl+iI34Ev7VBy+t6V1O66uEC0wFIQOW2ZlSdafHDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9170abd4cb48a73c8ccea03bfbd97e24397bcb6144a282c03e4c334cd9f04d4","last_reissued_at":"2026-05-18T00:16:20.516173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.516173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratically Constrained Channels with Causal Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anand D. Sarwate, Bikash Kumar Dey, Michael Langberg, Sidharth Jaggi, Tongxin Li","submitted_at":"2018-05-08T23:48:35Z","abstract_excerpt":"We consider the problem of communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiver Bob by transmitting a real-valued length-$n$ codeword $\\mathbf{x}=x_1,...,x_n$ through a communication channel. Alice and Bob do not share common randomness. Knowing Alice's encoding strategy, an adversarial jammer James chooses a real-valued length-n noise sequence $\\mathbf{s}=s_1,..,s_n$ in a causal manner, i.e., each $s_t (1<=t<=n)$ can only depend on $x_1,...,x_t$. Bob receives $\\mathbf{y}$, the sum of Alice's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03319","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03319","created_at":"2026-05-18T00:16:20.516268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03319v1","created_at":"2026-05-18T00:16:20.516268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03319","created_at":"2026-05-18T00:16:20.516268+00:00"},{"alias_kind":"pith_short_12","alias_value":"VELQVPKMWSFH","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VELQVPKMWSFHHSGM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VELQVPKM","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J","json":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J.json","graph_json":"https://pith.science/api/pith-number/VELQVPKMWSFHHSGM5IB37PMX4J/graph.json","events_json":"https://pith.science/api/pith-number/VELQVPKMWSFHHSGM5IB37PMX4J/events.json","paper":"https://pith.science/paper/VELQVPKM"},"agent_actions":{"view_html":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J","download_json":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J.json","view_paper":"https://pith.science/paper/VELQVPKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03319&json=true","fetch_graph":"https://pith.science/api/pith-number/VELQVPKMWSFHHSGM5IB37PMX4J/graph.json","fetch_events":"https://pith.science/api/pith-number/VELQVPKMWSFHHSGM5IB37PMX4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J/action/storage_attestation","attest_author":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J/action/author_attestation","sign_citation":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J/action/citation_signature","submit_replication":"https://pith.science/pith/VELQVPKMWSFHHSGM5IB37PMX4J/action/replication_record"}},"created_at":"2026-05-18T00:16:20.516268+00:00","updated_at":"2026-05-18T00:16:20.516268+00:00"}