{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KQ2EB7QCYYAWC2K5ZCNCSMEBFM","short_pith_number":"pith:KQ2EB7QC","canonical_record":{"source":{"id":"1305.3051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:03:32Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"2e2cc7c0d42936094c194cdfa40faf47467e39230af7532ba08b3a1cd3e058c0","abstract_canon_sha256":"1bb22d1b7b80a5bf2cbc5f1c6ae2f2918ee287d9c16751c51dc5cca3c8b05836"},"schema_version":"1.0"},"canonical_sha256":"543440fe02c60161695dc89a2930812b1c4803b21f6e4aab18a472d120b179fa","source":{"kind":"arxiv","id":"1305.3051","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3051","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3051v2","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3051","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"KQ2EB7QCYYAW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KQ2EB7QCYYAWC2K5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KQ2EB7QC","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KQ2EB7QCYYAWC2K5ZCNCSMEBFM","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:03:32Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"2e2cc7c0d42936094c194cdfa40faf47467e39230af7532ba08b3a1cd3e058c0","abstract_canon_sha256":"1bb22d1b7b80a5bf2cbc5f1c6ae2f2918ee287d9c16751c51dc5cca3c8b05836"},"schema_version":"1.0"},"canonical_sha256":"543440fe02c60161695dc89a2930812b1c4803b21f6e4aab18a472d120b179fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:41.104328Z","signature_b64":"djOwxr5H85ra4HQQ5loUERlHw5ILuYjIx+siqdkHDAXygb68eluHsKnDkl+ynWfHVYJmWwAJm10TkvVKnhxsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543440fe02c60161695dc89a2930812b1c4803b21f6e4aab18a472d120b179fa","last_reissued_at":"2026-05-18T03:24:41.103684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:41.103684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3051","source_version":2,"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-18T03:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpMBZUC5hTU+RSZIJ5+S2kHF6wHkGFmPjuEazsznyzaSqZizfs6fW7eKUJCWTKs88C+Q1FmZo0N++p4EDhvqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:59.129156Z"},"content_sha256":"ae227ad891d279f1ed787be43164166924ef471e78c03d85f3c9b43e72a1f4d4","schema_version":"1.0","event_id":"sha256:ae227ad891d279f1ed787be43164166924ef471e78c03d85f3c9b43e72a1f4d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KQ2EB7QCYYAWC2K5ZCNCSMEBFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Feedback for Secrecy over Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Shaunak Mishra, Suhas Diggavi, Vinod Prabhakaran","submitted_at":"2013-05-14T08:03:32Z","abstract_excerpt":"We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3051","kind":"arxiv","version":2},"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-18T03:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6Jnn1fWTHQDaSKi2uP7OfVB8I5WAurYVO66MdVzJp+Dv5iAI7aNXRL+426jUoT6snVc9blj0xj2aK3W9/OHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:59.129802Z"},"content_sha256":"5f05bc95e0235d3ae76f87ec0cba0752f89eb0dbc88b6f8debdf5501e42adcdb","schema_version":"1.0","event_id":"sha256:5f05bc95e0235d3ae76f87ec0cba0752f89eb0dbc88b6f8debdf5501e42adcdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/bundle.json","state_url":"https://pith.science/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/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-28T20:43:59Z","links":{"resolver":"https://pith.science/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM","bundle":"https://pith.science/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/bundle.json","state":"https://pith.science/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQ2EB7QCYYAWC2K5ZCNCSMEBFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KQ2EB7QCYYAWC2K5ZCNCSMEBFM","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":"1bb22d1b7b80a5bf2cbc5f1c6ae2f2918ee287d9c16751c51dc5cca3c8b05836","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:03:32Z","title_canon_sha256":"2e2cc7c0d42936094c194cdfa40faf47467e39230af7532ba08b3a1cd3e058c0"},"schema_version":"1.0","source":{"id":"1305.3051","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3051","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3051v2","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3051","created_at":"2026-05-18T03:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"KQ2EB7QCYYAW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KQ2EB7QCYYAWC2K5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KQ2EB7QC","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:5f05bc95e0235d3ae76f87ec0cba0752f89eb0dbc88b6f8debdf5501e42adcdb","target":"graph","created_at":"2026-05-18T03:24:41Z","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 study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.","authors_text":"Christina Fragouli, Shaunak Mishra, Suhas Diggavi, Vinod Prabhakaran","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:03:32Z","title":"Using Feedback for Secrecy over Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3051","kind":"arxiv","version":2},"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:ae227ad891d279f1ed787be43164166924ef471e78c03d85f3c9b43e72a1f4d4","target":"record","created_at":"2026-05-18T03:24:41Z","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":"1bb22d1b7b80a5bf2cbc5f1c6ae2f2918ee287d9c16751c51dc5cca3c8b05836","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:03:32Z","title_canon_sha256":"2e2cc7c0d42936094c194cdfa40faf47467e39230af7532ba08b3a1cd3e058c0"},"schema_version":"1.0","source":{"id":"1305.3051","kind":"arxiv","version":2}},"canonical_sha256":"543440fe02c60161695dc89a2930812b1c4803b21f6e4aab18a472d120b179fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"543440fe02c60161695dc89a2930812b1c4803b21f6e4aab18a472d120b179fa","first_computed_at":"2026-05-18T03:24:41.103684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:41.103684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"djOwxr5H85ra4HQQ5loUERlHw5ILuYjIx+siqdkHDAXygb68eluHsKnDkl+ynWfHVYJmWwAJm10TkvVKnhxsAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:41.104328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3051","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae227ad891d279f1ed787be43164166924ef471e78c03d85f3c9b43e72a1f4d4","sha256:5f05bc95e0235d3ae76f87ec0cba0752f89eb0dbc88b6f8debdf5501e42adcdb"],"state_sha256":"b0449b2644f75e5fb16385e06eddce1a14d6310b7aefd282cab5270057c2ac9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3ybZnIp4WJrfRUL8R6TsV4e61dq3FXJiwf8R4SDvtYX/25uHdugMzD4Uci6WZHBRzgDQ8IIOchfLws9/zKYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:43:59.132909Z","bundle_sha256":"7da7f3547109c365ebb98308b4458319b0b5f9493f85c9015cd0e656444ce463"}}