{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TR4RJ4LLXG4G2ALHNP6JB2NKND","short_pith_number":"pith:TR4RJ4LL","schema_version":"1.0","canonical_sha256":"9c7914f16bb9b86d01676bfc90e9aa68ccd737840ce986ee297460cef9d9a71d","source":{"kind":"arxiv","id":"1008.1079","version":1},"attestation_state":"computed","paper":{"title":"Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Prakash Narayan, Sirin Nitinawarat","submitted_at":"2010-08-05T20:34:33Z","abstract_excerpt":"We consider perfect secret key generation for a ``pairwise independent network'' model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper.\n  First, we show how the notion"},"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":"1008.1079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-05T20:34:33Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"b10b915b485e16743261cbb6ff32f1cf7128c83d124309e6fa3bf1e94d0db332","abstract_canon_sha256":"ac449ae0632f051e3bbb4a952e00eac8fcbc7338b228e0fc39038e6600f4271e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:34.154190Z","signature_b64":"tt0TnqOdwr//EN6nsEOHR3FKQNzTJCVQnbAiR+KIl4A+WRT4vYOKrWG83uqxIqnQ5umwjTPgZEOVOCitpDOdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c7914f16bb9b86d01676bfc90e9aa68ccd737840ce986ee297460cef9d9a71d","last_reissued_at":"2026-05-18T04:42:34.153793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:34.153793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Prakash Narayan, Sirin Nitinawarat","submitted_at":"2010-08-05T20:34:33Z","abstract_excerpt":"We consider perfect secret key generation for a ``pairwise independent network'' model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity. All the terminals as well as an eavesdropper observe this communication. The objective is to generate a perfect secret key shared by a given set of terminals at the largest rate possible, and concealed from the eavesdropper.\n  First, we show how the notion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1079","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":"1008.1079","created_at":"2026-05-18T04:42:34.153848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1079v1","created_at":"2026-05-18T04:42:34.153848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1079","created_at":"2026-05-18T04:42:34.153848+00:00"},{"alias_kind":"pith_short_12","alias_value":"TR4RJ4LLXG4G","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TR4RJ4LLXG4G2ALH","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TR4RJ4LL","created_at":"2026-05-18T12:26:15.391820+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/TR4RJ4LLXG4G2ALHNP6JB2NKND","json":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND.json","graph_json":"https://pith.science/api/pith-number/TR4RJ4LLXG4G2ALHNP6JB2NKND/graph.json","events_json":"https://pith.science/api/pith-number/TR4RJ4LLXG4G2ALHNP6JB2NKND/events.json","paper":"https://pith.science/paper/TR4RJ4LL"},"agent_actions":{"view_html":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND","download_json":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND.json","view_paper":"https://pith.science/paper/TR4RJ4LL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1079&json=true","fetch_graph":"https://pith.science/api/pith-number/TR4RJ4LLXG4G2ALHNP6JB2NKND/graph.json","fetch_events":"https://pith.science/api/pith-number/TR4RJ4LLXG4G2ALHNP6JB2NKND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND/action/storage_attestation","attest_author":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND/action/author_attestation","sign_citation":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND/action/citation_signature","submit_replication":"https://pith.science/pith/TR4RJ4LLXG4G2ALHNP6JB2NKND/action/replication_record"}},"created_at":"2026-05-18T04:42:34.153848+00:00","updated_at":"2026-05-18T04:42:34.153848+00:00"}