{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F4ULFAIVA2AWTQI4XFEUOHFQ7D","short_pith_number":"pith:F4ULFAIV","schema_version":"1.0","canonical_sha256":"2f28b28115068169c11cb949471cb0f8ff71313f364a15af5a9d25f91e6128c8","source":{"kind":"arxiv","id":"1007.1033","version":2},"attestation_state":"computed","paper":{"title":"A Theory of Network Equivalence, Parts I and II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michelle Effros, Muriel Medard, Ralf Koetter","submitted_at":"2010-07-07T01:35:17Z","abstract_excerpt":"A family of equivalence tools for bounding network capacities is introduced. Part I treats networks of point-to-point channels. The main result is roughly as follows. Given a network of noisy, independent, memoryless point-to-point channels, a collection of communication demands can be met on the given network if and only if it can be met on another network where each noisy channel is replaced by a noiseless bit pipe with throughput equal to the noisy channel capacity. This result was known previously for the case of a single-source multicast demand. The result given here treats general demand"},"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":"1007.1033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T01:35:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44102c6aeda56288b49c0866415bafcce3e1ec7d46f0c7186b904116ae5a6d80","abstract_canon_sha256":"fa5420d5e285a92d02d00ae6bfd4ad026671d28c274f8abefb18e0c47db3a0a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.030699Z","signature_b64":"PSxlGoAbp8FvpWj3kaI4E3fwBZnFzAZmi5TZPvVyEdaD/r6LcW0d8s2m0/Noo3mCXXl9Cl7nioMXdI2LGrrfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f28b28115068169c11cb949471cb0f8ff71313f364a15af5a9d25f91e6128c8","last_reissued_at":"2026-05-18T04:41:26.030228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.030228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory of Network Equivalence, Parts I and II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michelle Effros, Muriel Medard, Ralf Koetter","submitted_at":"2010-07-07T01:35:17Z","abstract_excerpt":"A family of equivalence tools for bounding network capacities is introduced. Part I treats networks of point-to-point channels. The main result is roughly as follows. Given a network of noisy, independent, memoryless point-to-point channels, a collection of communication demands can be met on the given network if and only if it can be met on another network where each noisy channel is replaced by a noiseless bit pipe with throughput equal to the noisy channel capacity. This result was known previously for the case of a single-source multicast demand. The result given here treats general demand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1033","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.1033","created_at":"2026-05-18T04:41:26.030301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1033v2","created_at":"2026-05-18T04:41:26.030301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1033","created_at":"2026-05-18T04:41:26.030301+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4ULFAIVA2AW","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4ULFAIVA2AWTQI4","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4ULFAIV","created_at":"2026-05-18T12:26:06.534383+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/F4ULFAIVA2AWTQI4XFEUOHFQ7D","json":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D.json","graph_json":"https://pith.science/api/pith-number/F4ULFAIVA2AWTQI4XFEUOHFQ7D/graph.json","events_json":"https://pith.science/api/pith-number/F4ULFAIVA2AWTQI4XFEUOHFQ7D/events.json","paper":"https://pith.science/paper/F4ULFAIV"},"agent_actions":{"view_html":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D","download_json":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D.json","view_paper":"https://pith.science/paper/F4ULFAIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1033&json=true","fetch_graph":"https://pith.science/api/pith-number/F4ULFAIVA2AWTQI4XFEUOHFQ7D/graph.json","fetch_events":"https://pith.science/api/pith-number/F4ULFAIVA2AWTQI4XFEUOHFQ7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D/action/storage_attestation","attest_author":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D/action/author_attestation","sign_citation":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D/action/citation_signature","submit_replication":"https://pith.science/pith/F4ULFAIVA2AWTQI4XFEUOHFQ7D/action/replication_record"}},"created_at":"2026-05-18T04:41:26.030301+00:00","updated_at":"2026-05-18T04:41:26.030301+00:00"}