{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AN6CHDVAAU3Y46VTTLWU7HQOJR","short_pith_number":"pith:AN6CHDVA","canonical_record":{"source":{"id":"1401.8244","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T18:01:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6203592e4911a455b7331d5be1c5c5b0863f613e062511f35db8534b940a7176","abstract_canon_sha256":"e0071a01b224ad238920301401d0606d3e3816c6602464300b69125fc49714b5"},"schema_version":"1.0"},"canonical_sha256":"037c238ea005378e7ab39aed4f9e0e4c6c8d73636eeee08a8c10cc0f7dda6221","source":{"kind":"arxiv","id":"1401.8244","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8244","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8244v4","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8244","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"AN6CHDVAAU3Y","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AN6CHDVAAU3Y46VT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AN6CHDVA","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AN6CHDVAAU3Y46VTTLWU7HQOJR","target":"record","payload":{"canonical_record":{"source":{"id":"1401.8244","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T18:01:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6203592e4911a455b7331d5be1c5c5b0863f613e062511f35db8534b940a7176","abstract_canon_sha256":"e0071a01b224ad238920301401d0606d3e3816c6602464300b69125fc49714b5"},"schema_version":"1.0"},"canonical_sha256":"037c238ea005378e7ab39aed4f9e0e4c6c8d73636eeee08a8c10cc0f7dda6221","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:55.707176Z","signature_b64":"mU3XozxLyILOi1t2RjgR9mHsR1TyooLawWh6JvfqEfYebLc1uS0hEZl/9SrIQ4tBQLsvA6nfLCJA/QyxrvKuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037c238ea005378e7ab39aed4f9e0e4c6c8d73636eeee08a8c10cc0f7dda6221","last_reissued_at":"2026-05-18T02:52:55.706575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:55.706575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.8244","source_version":4,"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-05-18T02:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LEzHiCeM+gtoEMqCPwgyGoXhuHlvB74IRAnN7T0bMBvdz+W8DgkPttIzR8Dfimr7bVHTSpLckV8GmmURfKcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:11:30.745494Z"},"content_sha256":"92669d65f6026eddc56cfd6f013cb6c3d7a9d4ed3721ec8b37b3ece3291296fc","schema_version":"1.0","event_id":"sha256:92669d65f6026eddc56cfd6f013cb6c3d7a9d4ed3721ec8b37b3ece3291296fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AN6CHDVAAU3Y46VTTLWU7HQOJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Routing-Optimal Network for Multiple Unicasts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Athina Markopoulou, Chun Meng, Minghua Chen","submitted_at":"2014-01-31T18:01:15Z","abstract_excerpt":"In this paper, we consider networks with multiple unicast sessions. Generally, non-linear network coding is needed to achieve the whole rate region of network coding. Yet, there exist networks for which routing is sufficient to achieve the whole rate region, and we refer to them as routing-optimal networks. We identify a class of routing-optimal networks, which we refer to as information-distributive networks, defined by three topological features. Due to these features, for each rate vector achieved by network coding, there is always a routing scheme such that it achieves the same rate vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8244","kind":"arxiv","version":4},"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"},"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-05-18T02:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Xp/iEmmGOSDw2BFpiWchZOqkFhfSDULSw1P5Kxaj3BSj8mg2rbWrXEyvOiDxTA7Yx+TAuQynW+WTLMpAZnfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:11:30.746176Z"},"content_sha256":"b6b4a1022025928f995f366d45603e9ba9c8c1a5893a5ff2e3456b700ef3fc44","schema_version":"1.0","event_id":"sha256:b6b4a1022025928f995f366d45603e9ba9c8c1a5893a5ff2e3456b700ef3fc44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/bundle.json","state_url":"https://pith.science/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/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-05-26T00:11:30Z","links":{"resolver":"https://pith.science/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR","bundle":"https://pith.science/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/bundle.json","state":"https://pith.science/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN6CHDVAAU3Y46VTTLWU7HQOJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AN6CHDVAAU3Y46VTTLWU7HQOJR","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":"e0071a01b224ad238920301401d0606d3e3816c6602464300b69125fc49714b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T18:01:15Z","title_canon_sha256":"6203592e4911a455b7331d5be1c5c5b0863f613e062511f35db8534b940a7176"},"schema_version":"1.0","source":{"id":"1401.8244","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8244","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8244v4","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8244","created_at":"2026-05-18T02:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"AN6CHDVAAU3Y","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AN6CHDVAAU3Y46VT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AN6CHDVA","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b6b4a1022025928f995f366d45603e9ba9c8c1a5893a5ff2e3456b700ef3fc44","target":"graph","created_at":"2026-05-18T02:52:55Z","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":"In this paper, we consider networks with multiple unicast sessions. Generally, non-linear network coding is needed to achieve the whole rate region of network coding. Yet, there exist networks for which routing is sufficient to achieve the whole rate region, and we refer to them as routing-optimal networks. We identify a class of routing-optimal networks, which we refer to as information-distributive networks, defined by three topological features. Due to these features, for each rate vector achieved by network coding, there is always a routing scheme such that it achieves the same rate vector","authors_text":"Athina Markopoulou, Chun Meng, Minghua Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T18:01:15Z","title":"On Routing-Optimal Network for Multiple Unicasts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8244","kind":"arxiv","version":4},"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:92669d65f6026eddc56cfd6f013cb6c3d7a9d4ed3721ec8b37b3ece3291296fc","target":"record","created_at":"2026-05-18T02:52:55Z","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":"e0071a01b224ad238920301401d0606d3e3816c6602464300b69125fc49714b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T18:01:15Z","title_canon_sha256":"6203592e4911a455b7331d5be1c5c5b0863f613e062511f35db8534b940a7176"},"schema_version":"1.0","source":{"id":"1401.8244","kind":"arxiv","version":4}},"canonical_sha256":"037c238ea005378e7ab39aed4f9e0e4c6c8d73636eeee08a8c10cc0f7dda6221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037c238ea005378e7ab39aed4f9e0e4c6c8d73636eeee08a8c10cc0f7dda6221","first_computed_at":"2026-05-18T02:52:55.706575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:55.706575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mU3XozxLyILOi1t2RjgR9mHsR1TyooLawWh6JvfqEfYebLc1uS0hEZl/9SrIQ4tBQLsvA6nfLCJA/QyxrvKuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:55.707176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.8244","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92669d65f6026eddc56cfd6f013cb6c3d7a9d4ed3721ec8b37b3ece3291296fc","sha256:b6b4a1022025928f995f366d45603e9ba9c8c1a5893a5ff2e3456b700ef3fc44"],"state_sha256":"c1b77f173a71f45187e596155f71fe1a8dda25762cc69b3cdfa9ece327371191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIdaJo1VSvsFwZUQ87AowxDjI3Ho25X/lbQDbtJl2Jf4YnxHBXK/SnqAIr+9aNxySKNF3lPOh7hT773VKj8wCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:11:30.749957Z","bundle_sha256":"b03bd978aa8014817ca92f7a528c151723323cca124a2ee9d963089e403f8451"}}