{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2UILCYEIYSP33G673YA26ATAVQ","short_pith_number":"pith:2UILCYEI","schema_version":"1.0","canonical_sha256":"d510b16088c49fbd9bdfde01af0260ac3254fd4fc7a53ce0e3f5eddd644a55ab","source":{"kind":"arxiv","id":"2107.02144","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.02144","created_at":"2026-07-05T02:55:03.984415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.02144v1","created_at":"2026-07-05T02:55:03.984415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02144","created_at":"2026-07-05T02:55:03.984415+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UILCYEIYSP3","created_at":"2026-07-05T02:55:03.984415+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UILCYEIYSP33G67","created_at":"2026-07-05T02:55:03.984415+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UILCYEI","created_at":"2026-07-05T02:55:03.984415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03361","citing_title":"Multishot Capacity of Networks with Restricted Adversaries","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ","json":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ.json","graph_json":"https://pith.science/api/pith-number/2UILCYEIYSP33G673YA26ATAVQ/graph.json","events_json":"https://pith.science/api/pith-number/2UILCYEIYSP33G673YA26ATAVQ/events.json","paper":"https://pith.science/paper/2UILCYEI"},"agent_actions":{"view_html":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ","download_json":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ.json","view_paper":"https://pith.science/paper/2UILCYEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.02144&json=true","fetch_graph":"https://pith.science/api/pith-number/2UILCYEIYSP33G673YA26ATAVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2UILCYEIYSP33G673YA26ATAVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/action/storage_attestation","attest_author":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/action/author_attestation","sign_citation":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/action/citation_signature","submit_replication":"https://pith.science/pith/2UILCYEIYSP33G673YA26ATAVQ/action/replication_record"}},"created_at":"2026-07-05T02:55:03.984415+00:00","updated_at":"2026-07-05T02:55:03.984415+00:00"}