{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:C5ZBWST73DBDQBOERGX2PRAQSR","short_pith_number":"pith:C5ZBWST7","canonical_record":{"source":{"id":"1010.0654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T18:31:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90269e9e1bfa3f3efa4824f4b7915e91f31c28e047be2ad1776ccecff0c38bfb","abstract_canon_sha256":"7c0a5d45c94ca4e01d1a9fc73da69e85c2a450db6819a2f5effc8d7b9b1260f0"},"schema_version":"1.0"},"canonical_sha256":"17721b4a7fd8c23805c489afa7c410945990632e216145d1e29ebd23c5e9a872","source":{"kind":"arxiv","id":"1010.0654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0654","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0654v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0654","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZBWST73DBD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZBWST73DBDQBOE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZBWST7","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:C5ZBWST73DBDQBOERGX2PRAQSR","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T18:31:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90269e9e1bfa3f3efa4824f4b7915e91f31c28e047be2ad1776ccecff0c38bfb","abstract_canon_sha256":"7c0a5d45c94ca4e01d1a9fc73da69e85c2a450db6819a2f5effc8d7b9b1260f0"},"schema_version":"1.0"},"canonical_sha256":"17721b4a7fd8c23805c489afa7c410945990632e216145d1e29ebd23c5e9a872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:47.151920Z","signature_b64":"8vzgV9KgIdvuXoNln3v+rkuo6U5M7zNr0r2bNBKIrGFQFZMuCt1vOaVB10R3robjfMti+En7TTGy+bAAF/XLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17721b4a7fd8c23805c489afa7c410945990632e216145d1e29ebd23c5e9a872","last_reissued_at":"2026-05-18T02:23:47.151141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:47.151141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0654","source_version":1,"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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJjoVJckMW0OdTWXYyY/jx2U0z6+iFqqB7B1UAupo4S6e+p09C/Z0tdMI61ToJmY/vX/sAxVf45DZK7DYgNzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:10:42.372347Z"},"content_sha256":"d9f0d8afb8addddcf7ad30c80a690da7be210055f3f3d50895e87c57518891e9","schema_version":"1.0","event_id":"sha256:d9f0d8afb8addddcf7ad30c80a690da7be210055f3f3d50895e87c57518891e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:C5ZBWST73DBDQBOERGX2PRAQSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Equivalence Between Network Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michelle Effros, Shirin Jalali, Tracey Ho","submitted_at":"2010-10-04T18:31:44Z","abstract_excerpt":"One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their computational complexity grows very quickly with the size of the network. This motivates us to propose a new hierarchical approach which finds upper and lower bounding networks of smaller size for a given network. This approach sequentially replaces components of the network with simpler structures, i.e., with fewer links or nodes, so that the resulting network is more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0654","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":""},"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:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3kw+sTPKhHK1eHic7DC4EuI7en1wTmrrX9LgNmTSEWYMmYOz6do9fLa4zm+t6joKq2S4oPVskznGEGeqvSMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:10:42.373016Z"},"content_sha256":"7d79c2a4bced9523316e77c2809ebb4dd8379d67cfe9132446368c52042c6e48","schema_version":"1.0","event_id":"sha256:7d79c2a4bced9523316e77c2809ebb4dd8379d67cfe9132446368c52042c6e48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5ZBWST73DBDQBOERGX2PRAQSR/bundle.json","state_url":"https://pith.science/pith/C5ZBWST73DBDQBOERGX2PRAQSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5ZBWST73DBDQBOERGX2PRAQSR/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-06-09T23:10:42Z","links":{"resolver":"https://pith.science/pith/C5ZBWST73DBDQBOERGX2PRAQSR","bundle":"https://pith.science/pith/C5ZBWST73DBDQBOERGX2PRAQSR/bundle.json","state":"https://pith.science/pith/C5ZBWST73DBDQBOERGX2PRAQSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5ZBWST73DBDQBOERGX2PRAQSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:C5ZBWST73DBDQBOERGX2PRAQSR","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":"7c0a5d45c94ca4e01d1a9fc73da69e85c2a450db6819a2f5effc8d7b9b1260f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T18:31:44Z","title_canon_sha256":"90269e9e1bfa3f3efa4824f4b7915e91f31c28e047be2ad1776ccecff0c38bfb"},"schema_version":"1.0","source":{"id":"1010.0654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0654","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0654v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0654","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZBWST73DBD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZBWST73DBDQBOE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZBWST7","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:7d79c2a4bced9523316e77c2809ebb4dd8379d67cfe9132446368c52042c6e48","target":"graph","created_at":"2026-05-18T02:23:47Z","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":"One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their computational complexity grows very quickly with the size of the network. This motivates us to propose a new hierarchical approach which finds upper and lower bounding networks of smaller size for a given network. This approach sequentially replaces components of the network with simpler structures, i.e., with fewer links or nodes, so that the resulting network is more","authors_text":"Michelle Effros, Shirin Jalali, Tracey Ho","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T18:31:44Z","title":"On Equivalence Between Network Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0654","kind":"arxiv","version":1},"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:d9f0d8afb8addddcf7ad30c80a690da7be210055f3f3d50895e87c57518891e9","target":"record","created_at":"2026-05-18T02:23:47Z","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":"7c0a5d45c94ca4e01d1a9fc73da69e85c2a450db6819a2f5effc8d7b9b1260f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T18:31:44Z","title_canon_sha256":"90269e9e1bfa3f3efa4824f4b7915e91f31c28e047be2ad1776ccecff0c38bfb"},"schema_version":"1.0","source":{"id":"1010.0654","kind":"arxiv","version":1}},"canonical_sha256":"17721b4a7fd8c23805c489afa7c410945990632e216145d1e29ebd23c5e9a872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17721b4a7fd8c23805c489afa7c410945990632e216145d1e29ebd23c5e9a872","first_computed_at":"2026-05-18T02:23:47.151141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:47.151141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8vzgV9KgIdvuXoNln3v+rkuo6U5M7zNr0r2bNBKIrGFQFZMuCt1vOaVB10R3robjfMti+En7TTGy+bAAF/XLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:47.151920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9f0d8afb8addddcf7ad30c80a690da7be210055f3f3d50895e87c57518891e9","sha256:7d79c2a4bced9523316e77c2809ebb4dd8379d67cfe9132446368c52042c6e48"],"state_sha256":"8ff7c47528a155f67bfed79695e39674591170584e80f17c05fc06f7b0527716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SffGkUr/l1UiPZ7iQ4Zx5APDeUzmKdTUilbtrsTwprcNjhpu13BQdhx9KjL4SFD27ADAewxYZK8xwnRixGn3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:10:42.377491Z","bundle_sha256":"2ae4a837a916ca2d8bdce315d09e616f32b1e8cfc2563b80ce180f86cd55a799"}}