{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2UILCYEIYSP33G673YA26ATAVQ","short_pith_number":"pith:2UILCYEI","canonical_record":{"source":{"id":"2107.02144","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-05T17:08:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c6a4041367af0f41cc3a8aeb40ecca36bde775715418349413122172c8419284","abstract_canon_sha256":"a6f5fd0e3d527ef5cd733c2214bcc4cec82ff50b47c0948b2fb49383b81872fb"},"schema_version":"1.0"},"canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","source":{"kind":"arxiv","id":"2107.02144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02144","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02144v1","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02144","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"2UILCYEIYSP3","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_16","alias_value":"2UILCYEIYSP33G67","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_8","alias_value":"2UILCYEI","created_at":"2026-07-05T02:55:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2UILCYEIYSP33G673YA26ATAVQ","target":"record","payload":{"canonical_record":{"source":{"id":"2107.02144","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-05T17:08:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"c6a4041367af0f41cc3a8aeb40ecca36bde775715418349413122172c8419284","abstract_canon_sha256":"a6f5fd0e3d527ef5cd733c2214bcc4cec82ff50b47c0948b2fb49383b81872fb"},"schema_version":"1.0"},"canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:03.984821Z","signature_b64":"1EO+LzH3kh2+gWKfQhJhIEP7jQd0Uos0sFZ3gy2d388T+brh8reot7VFnN4hDoqKMrqecnToN3+bN3g/cRFMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","last_reissued_at":"2026-07-05T02:55:03.984357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:03.984357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.02144","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-07-05T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+ys3xRwLRZJG1cx1BhPglH/SHZM5ofnh5MYYQmm0TOAAEoca/Odl4s1JBzudXDiduvISG7P0T8JPcb4usC3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:42:56.173296Z"},"content_sha256":"48a3273ae5ccb824f70d905e11c9b9e7ea581f092aa9108350ddb232a2285ed1","schema_version":"1.0","event_id":"sha256:48a3273ae5ccb824f70d905e11c9b9e7ea581f092aa9108350ddb232a2285ed1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2UILCYEIYSP33G673YA26ATAVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Curious Case of the Diamond Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Ravagnani, Allison Beemer","submitted_at":"2021-07-05T17:08:53Z","abstract_excerpt":"This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-established upper bounds on one-shot capacity. We introduce the Diamond Network as a minimal example to show that known cut-set bounds are not sharp in general. We then give a capacity-achieving scheme for the Diamond Network that implements an adversary detection strategy. Finally, we give a sufficient condition for tightness of the Singleton Cut-Set Bound in a family of two-level networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.02144/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2iKVE51qZry1/4sdqmsc8JDK/6mM128/qOQFqp1/ayeoLON4fFOPC9FYyn3CLyQyy2Q19N4CO6gDF7J5ei5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:42:56.173819Z"},"content_sha256":"3ee8a4f321c7ff1c3591552ad4e717a35e1d6f5373263282423adbc2f858c5e2","schema_version":"1.0","event_id":"sha256:3ee8a4f321c7ff1c3591552ad4e717a35e1d6f5373263282423adbc2f858c5e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/bundle.json","state_url":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UILCYEIYSP33G673YA26ATAVQ/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-08-08T15:42:56Z","links":{"resolver":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ","bundle":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/bundle.json","state":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UILCYEIYSP33G673YA26ATAVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2UILCYEIYSP33G673YA26ATAVQ","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":"a6f5fd0e3d527ef5cd733c2214bcc4cec82ff50b47c0948b2fb49383b81872fb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-05T17:08:53Z","title_canon_sha256":"c6a4041367af0f41cc3a8aeb40ecca36bde775715418349413122172c8419284"},"schema_version":"1.0","source":{"id":"2107.02144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02144","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02144v1","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02144","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"2UILCYEIYSP3","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_16","alias_value":"2UILCYEIYSP33G67","created_at":"2026-07-05T02:55:03Z"},{"alias_kind":"pith_short_8","alias_value":"2UILCYEI","created_at":"2026-07-05T02:55:03Z"}],"graph_snapshots":[{"event_id":"sha256:3ee8a4f321c7ff1c3591552ad4e717a35e1d6f5373263282423adbc2f858c5e2","target":"graph","created_at":"2026-07-05T02:55:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.02144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-established upper bounds on one-shot capacity. We introduce the Diamond Network as a minimal example to show that known cut-set bounds are not sharp in general. We then give a capacity-achieving scheme for the Diamond Network that implements an adversary detection strategy. Finally, we give a sufficient condition for tightness of the Singleton Cut-Set Bound in a family of two-level networks.","authors_text":"Alberto Ravagnani, Allison Beemer","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-05T17:08:53Z","title":"The Curious Case of the Diamond Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02144","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:48a3273ae5ccb824f70d905e11c9b9e7ea581f092aa9108350ddb232a2285ed1","target":"record","created_at":"2026-07-05T02:55:03Z","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":"a6f5fd0e3d527ef5cd733c2214bcc4cec82ff50b47c0948b2fb49383b81872fb","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-05T17:08:53Z","title_canon_sha256":"c6a4041367af0f41cc3a8aeb40ecca36bde775715418349413122172c8419284"},"schema_version":"1.0","source":{"id":"2107.02144","kind":"arxiv","version":1}},"canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","first_computed_at":"2026-07-05T02:55:03.984357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:55:03.984357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1EO+LzH3kh2+gWKfQhJhIEP7jQd0Uos0sFZ3gy2d388T+brh8reot7VFnN4hDoqKMrqecnToN3+bN3g/cRFMBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:55:03.984821Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.02144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a3273ae5ccb824f70d905e11c9b9e7ea581f092aa9108350ddb232a2285ed1","sha256:3ee8a4f321c7ff1c3591552ad4e717a35e1d6f5373263282423adbc2f858c5e2"],"state_sha256":"f5687bdc2e9be374a7a3e51fb51c376cd29bd21abc9074d8d0324b7efbbd192f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNjCpp0rSVvRUwoiKYZDsgPdrqYnVtkzyfnp3SIXKfqzsWJWMXR261uDLyB/0nnNOrrogOxh5hyHHzJ6wLqoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:42:56.179580Z","bundle_sha256":"d0d1f4b9a7d5dae42052114b6f3b51ac06ed046b66018f5762c8907247d086c4"}}