{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2XXS7LDJBTIAMLDLKNUMDIXTCC","short_pith_number":"pith:2XXS7LDJ","canonical_record":{"source":{"id":"1901.05817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:42:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcb7c64962506b593dbe20e8162a1de3eddd22a698e887da52ff5dcd220dd090","abstract_canon_sha256":"1d0742b7d93820451f707cfedac506479fab4cca88769777b1f7f281e1fc5305"},"schema_version":"1.0"},"canonical_sha256":"d5ef2fac690cd0062c6b5368c1a2f310b9afba7629c549eb2cdb4808f0143b20","source":{"kind":"arxiv","id":"1901.05817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05817","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05817v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05817","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"2XXS7LDJBTIA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2XXS7LDJBTIAMLDL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2XXS7LDJ","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2XXS7LDJBTIAMLDLKNUMDIXTCC","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:42:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcb7c64962506b593dbe20e8162a1de3eddd22a698e887da52ff5dcd220dd090","abstract_canon_sha256":"1d0742b7d93820451f707cfedac506479fab4cca88769777b1f7f281e1fc5305"},"schema_version":"1.0"},"canonical_sha256":"d5ef2fac690cd0062c6b5368c1a2f310b9afba7629c549eb2cdb4808f0143b20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.113353Z","signature_b64":"NIp42cSjT/7O2K2v4873r5o2o3Q/0sO2dHjwoVloGJg1g4QViSeR5BFMZ8ycF8CymSDudxoLMR6rGn7PpzvCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5ef2fac690cd0062c6b5368c1a2f310b9afba7629c549eb2cdb4808f0143b20","last_reissued_at":"2026-05-17T23:56:06.112753Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.112753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05817","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ox1GWLFdNFUt+qRoENlInDev80++03vSy2AOF9bh7lJ8SEJgnyWCdQ58lhBsX5wya4PgNLjeNpNg0iyGpDdfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:23:28.985595Z"},"content_sha256":"40ce79c2f7b62d6d8a81608eb69d42720dec8a738d6f2b86a79d1ca922910ece","schema_version":"1.0","event_id":"sha256:40ce79c2f7b62d6d8a81608eb69d42720dec8a738d6f2b86a79d1ca922910ece"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2XXS7LDJBTIAMLDLKNUMDIXTCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Shot Perfect Secret Key Agreement for Finite Linear Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou","submitted_at":"2019-01-17T14:42:39Z","abstract_excerpt":"We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. Restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. The minimum discussion is achieved by a non-interactive protocol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05817","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIO6q/kIrJS22zl4uviZhEZmE8CX6yDzfiNFSO7sQbk13lwMiZfvFl2I2S+K+1qwVnMhtJX+KksITGlPh1PyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:23:28.985952Z"},"content_sha256":"079cab1eb789cac092cda78e33c7cf1ed409ab79737dec1735f70fc4d87dfe08","schema_version":"1.0","event_id":"sha256:079cab1eb789cac092cda78e33c7cf1ed409ab79737dec1735f70fc4d87dfe08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/bundle.json","state_url":"https://pith.science/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T03:23:28Z","links":{"resolver":"https://pith.science/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC","bundle":"https://pith.science/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/bundle.json","state":"https://pith.science/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XXS7LDJBTIAMLDLKNUMDIXTCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2XXS7LDJBTIAMLDLKNUMDIXTCC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d0742b7d93820451f707cfedac506479fab4cca88769777b1f7f281e1fc5305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:42:39Z","title_canon_sha256":"fcb7c64962506b593dbe20e8162a1de3eddd22a698e887da52ff5dcd220dd090"},"schema_version":"1.0","source":{"id":"1901.05817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05817","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05817v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05817","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"2XXS7LDJBTIA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2XXS7LDJBTIAMLDL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2XXS7LDJ","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:079cab1eb789cac092cda78e33c7cf1ed409ab79737dec1735f70fc4d87dfe08","target":"graph","created_at":"2026-05-17T23:56:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. Restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. The minimum discussion is achieved by a non-interactive protocol","authors_text":"Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:42:39Z","title":"One-Shot Perfect Secret Key Agreement for Finite Linear Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05817","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:40ce79c2f7b62d6d8a81608eb69d42720dec8a738d6f2b86a79d1ca922910ece","target":"record","created_at":"2026-05-17T23:56:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d0742b7d93820451f707cfedac506479fab4cca88769777b1f7f281e1fc5305","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T14:42:39Z","title_canon_sha256":"fcb7c64962506b593dbe20e8162a1de3eddd22a698e887da52ff5dcd220dd090"},"schema_version":"1.0","source":{"id":"1901.05817","kind":"arxiv","version":1}},"canonical_sha256":"d5ef2fac690cd0062c6b5368c1a2f310b9afba7629c549eb2cdb4808f0143b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5ef2fac690cd0062c6b5368c1a2f310b9afba7629c549eb2cdb4808f0143b20","first_computed_at":"2026-05-17T23:56:06.112753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.112753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NIp42cSjT/7O2K2v4873r5o2o3Q/0sO2dHjwoVloGJg1g4QViSeR5BFMZ8ycF8CymSDudxoLMR6rGn7PpzvCAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.113353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40ce79c2f7b62d6d8a81608eb69d42720dec8a738d6f2b86a79d1ca922910ece","sha256:079cab1eb789cac092cda78e33c7cf1ed409ab79737dec1735f70fc4d87dfe08"],"state_sha256":"4a6c0624e05fa89f879cc18d17750a7ac2d1a24aba43a82363f571db76e55206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19RcJCftSLSe7YMoKrrXaRLKux90Z3q3npWXR7Gydslfmm/k8zjqDNJQiG5lSLjFJwsTl13zGSflyJJGOYnaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:23:28.987981Z","bundle_sha256":"0b6839b4ddc0cd46c96a9202e7594e22e5a7e2da9df75ada62f35825427a49fb"}}