{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WNEO72AEMXIVQCANVDGN5CC6EJ","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":"c2720435ac52ded0dec4872323c744485a645849aecde13e8836c7e497ca862d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T21:58:17Z","title_canon_sha256":"bdc0d5a1b571da940bd54a7265f0ff6c7282ca943f732a03b2bc54e9d223be3a"},"schema_version":"1.0","source":{"id":"1401.4189","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4189","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4189v2","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4189","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"WNEO72AEMXIV","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WNEO72AEMXIVQCAN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WNEO72AE","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:398f73d0b53af963f7162052a1a37602fbe92d1355e4fcd25086544f353e175a","target":"graph","created_at":"2026-05-18T01:31:30Z","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":"The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper (resp. lower) bounding models, which can be used to calculate the outer (resp. inner) bounds for the capacity region of the original noisy network. Based on the network equivalence framework, this paper presents scalable upper and lower bounding models for wireless networks with potentially many nodes. A channel decoupling method is proposed to decompose wireless networks into decoupled multiple-access channels (MACs) and broadcast channels (","authors_text":"Jinfeng Du, Mikael Skoglund, Ming Xiao, Muriel Medard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T21:58:17Z","title":"Scalable Capacity Bounding Models for Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4189","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:3eb2dddc1f091724afeccc303236538306cd4fc07d93b3450b1b7c289753046b","target":"record","created_at":"2026-05-18T01:31:30Z","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":"c2720435ac52ded0dec4872323c744485a645849aecde13e8836c7e497ca862d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T21:58:17Z","title_canon_sha256":"bdc0d5a1b571da940bd54a7265f0ff6c7282ca943f732a03b2bc54e9d223be3a"},"schema_version":"1.0","source":{"id":"1401.4189","kind":"arxiv","version":2}},"canonical_sha256":"b348efe80465d158080da8ccde885e224873da4ddd0c18763ada656cc258f3fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b348efe80465d158080da8ccde885e224873da4ddd0c18763ada656cc258f3fd","first_computed_at":"2026-05-18T01:31:30.347628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:30.347628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0Ja3e0Z5VA93y+K6K3BuWxRJbo3dn6ZA2EaVKeGiuoDukN8yjvNJj8UcanKlhcevzrdNdxav+hsgpFaMlYUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:30.348381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4189","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eb2dddc1f091724afeccc303236538306cd4fc07d93b3450b1b7c289753046b","sha256:398f73d0b53af963f7162052a1a37602fbe92d1355e4fcd25086544f353e175a"],"state_sha256":"8ae3965e0148aec32bb11dd790a289f14217d30e04f7cf0a555e200c89a3005f"}