{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JKFD2ZOV4MQOMW7LCKIN7RBME6","short_pith_number":"pith:JKFD2ZOV","schema_version":"1.0","canonical_sha256":"4a8a3d65d5e320e65beb1290dfc42c27a260e4b35451a7d1ab8b8fadb39e3330","source":{"kind":"arxiv","id":"2212.00060","version":3},"attestation_state":"computed","paper":{"title":"Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz","submitted_at":"2022-11-30T19:04:22Z","abstract_excerpt":"We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes."},"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":"2212.00060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-30T19:04:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f67e82dac7519ac6775813f556f7f374bcc78b38584096f80dc01e0f5444ba33","abstract_canon_sha256":"ddd21aa6fc350f206a3a992a123c69eca2ccabd29c5624d3112ad8f8136224cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:00.076782Z","signature_b64":"qispNffTY/4BnU6AYVglAHn0NtzBBfTalRIXwd3C/IFx2kw/tX+/WAmANBJyHdpyTpXUGUG/wg2+UGIpnSasCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a8a3d65d5e320e65beb1290dfc42c27a260e4b35451a7d1ab8b8fadb39e3330","last_reissued_at":"2026-07-05T09:09:00.076286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:00.076286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz","submitted_at":"2022-11-30T19:04:22Z","abstract_excerpt":"We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.00060","kind":"arxiv","version":3},"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/2212.00060/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":"2212.00060","created_at":"2026-07-05T09:09:00.076365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.00060v3","created_at":"2026-07-05T09:09:00.076365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.00060","created_at":"2026-07-05T09:09:00.076365+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKFD2ZOV4MQO","created_at":"2026-07-05T09:09:00.076365+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKFD2ZOV4MQOMW7L","created_at":"2026-07-05T09:09:00.076365+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKFD2ZOV","created_at":"2026-07-05T09:09:00.076365+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/JKFD2ZOV4MQOMW7LCKIN7RBME6","json":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6.json","graph_json":"https://pith.science/api/pith-number/JKFD2ZOV4MQOMW7LCKIN7RBME6/graph.json","events_json":"https://pith.science/api/pith-number/JKFD2ZOV4MQOMW7LCKIN7RBME6/events.json","paper":"https://pith.science/paper/JKFD2ZOV"},"agent_actions":{"view_html":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6","download_json":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6.json","view_paper":"https://pith.science/paper/JKFD2ZOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.00060&json=true","fetch_graph":"https://pith.science/api/pith-number/JKFD2ZOV4MQOMW7LCKIN7RBME6/graph.json","fetch_events":"https://pith.science/api/pith-number/JKFD2ZOV4MQOMW7LCKIN7RBME6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6/action/storage_attestation","attest_author":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6/action/author_attestation","sign_citation":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6/action/citation_signature","submit_replication":"https://pith.science/pith/JKFD2ZOV4MQOMW7LCKIN7RBME6/action/replication_record"}},"created_at":"2026-07-05T09:09:00.076365+00:00","updated_at":"2026-07-05T09:09:00.076365+00:00"}