{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E4ZXUEV6ZP6Z6FOVYERT2JMAKU","short_pith_number":"pith:E4ZXUEV6","canonical_record":{"source":{"id":"1202.0747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T16:10:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00dab520318264eb4d0b7d2ab0620d565620ed3721605e93a4988284f872cdfb","abstract_canon_sha256":"d8e6315c0a3a8bd44b177d7376eac1249148b02840e0f6b4dea63de259625b38"},"schema_version":"1.0"},"canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","source":{"kind":"arxiv","id":"1202.0747","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0747","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0747v2","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0747","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"E4ZXUEV6ZP6Z","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E4ZXUEV6ZP6Z6FOV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E4ZXUEV6","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E4ZXUEV6ZP6Z6FOVYERT2JMAKU","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T16:10:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00dab520318264eb4d0b7d2ab0620d565620ed3721605e93a4988284f872cdfb","abstract_canon_sha256":"d8e6315c0a3a8bd44b177d7376eac1249148b02840e0f6b4dea63de259625b38"},"schema_version":"1.0"},"canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.685261Z","signature_b64":"OPC84ky2zVI1bgHbFR7X0zSKS1q+AycHMvKWD8r8Mkwk3q3QLUBSMzXU7WU74cpJq6lKvDdhb1Xwcyskfd/tDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","last_reissued_at":"2026-05-18T03:36:56.684805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.684805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0747","source_version":2,"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-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3TUUPK3GqZFs/oWmYirUbJhRb69QeRFd9umTwU0lPBUsnmrpqBelZeC7aitbyBw5E6Kcor3hrw5ZqSlIMJwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:51:57.379888Z"},"content_sha256":"0540673a212e391876df0686c7db3205710593ede53108a786b10955fa7e9188","schema_version":"1.0","event_id":"sha256:0540673a212e391876df0686c7db3205710593ede53108a786b10955fa7e9188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E4ZXUEV6ZP6Z6FOVYERT2JMAKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph Theoretical Approach to Network Encoding Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guangyue Han, Li Xu, Weiping Shang","submitted_at":"2012-02-03T16:10:23Z","abstract_excerpt":"Consider an acyclic directed network $G$ with sources $S_1, S_2,..., S_l$ and distinct sinks $R_1, R_2,..., R_l$. For $i=1, 2,..., l$, let $c_i$ denote the min-cut between $S_i$ and $R_i$. Then, by Menger's theorem, there exists a group of $c_i$ edge-disjoint paths from $S_i$ to $R_i$, which will be referred to as a group of Menger's paths from $S_i$ to $R_i$ in this paper. Although within the same group they are edge-disjoint, the Menger's paths from different groups may have to merge with each other. It is known that by choosing Menger's paths appropriately, the number of mergings among diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0747","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"},"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-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqEPBKkL87Y6SMJshNu9p/C4gcRHYnMk16NZOrXn5Rwax1p3CotFt4IGdpISRx0ox3uN83VuDVFRPBqLexkDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:51:57.380626Z"},"content_sha256":"400abf83f36a62ebfc2ef6dce566087b6a1b6d9a3a3d6d57c73f61797bf9192c","schema_version":"1.0","event_id":"sha256:400abf83f36a62ebfc2ef6dce566087b6a1b6d9a3a3d6d57c73f61797bf9192c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/bundle.json","state_url":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/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-11T16:51:57Z","links":{"resolver":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU","bundle":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/bundle.json","state":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E4ZXUEV6ZP6Z6FOVYERT2JMAKU","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":"d8e6315c0a3a8bd44b177d7376eac1249148b02840e0f6b4dea63de259625b38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T16:10:23Z","title_canon_sha256":"00dab520318264eb4d0b7d2ab0620d565620ed3721605e93a4988284f872cdfb"},"schema_version":"1.0","source":{"id":"1202.0747","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0747","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0747v2","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0747","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"E4ZXUEV6ZP6Z","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E4ZXUEV6ZP6Z6FOV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E4ZXUEV6","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:400abf83f36a62ebfc2ef6dce566087b6a1b6d9a3a3d6d57c73f61797bf9192c","target":"graph","created_at":"2026-05-18T03:36:56Z","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":"Consider an acyclic directed network $G$ with sources $S_1, S_2,..., S_l$ and distinct sinks $R_1, R_2,..., R_l$. For $i=1, 2,..., l$, let $c_i$ denote the min-cut between $S_i$ and $R_i$. Then, by Menger's theorem, there exists a group of $c_i$ edge-disjoint paths from $S_i$ to $R_i$, which will be referred to as a group of Menger's paths from $S_i$ to $R_i$ in this paper. Although within the same group they are edge-disjoint, the Menger's paths from different groups may have to merge with each other. It is known that by choosing Menger's paths appropriately, the number of mergings among diff","authors_text":"Guangyue Han, Li Xu, Weiping Shang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T16:10:23Z","title":"A Graph Theoretical Approach to Network Encoding Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0747","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:0540673a212e391876df0686c7db3205710593ede53108a786b10955fa7e9188","target":"record","created_at":"2026-05-18T03:36:56Z","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":"d8e6315c0a3a8bd44b177d7376eac1249148b02840e0f6b4dea63de259625b38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-03T16:10:23Z","title_canon_sha256":"00dab520318264eb4d0b7d2ab0620d565620ed3721605e93a4988284f872cdfb"},"schema_version":"1.0","source":{"id":"1202.0747","kind":"arxiv","version":2}},"canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","first_computed_at":"2026-05-18T03:36:56.684805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.684805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPC84ky2zVI1bgHbFR7X0zSKS1q+AycHMvKWD8r8Mkwk3q3QLUBSMzXU7WU74cpJq6lKvDdhb1Xwcyskfd/tDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:56.685261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0747","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0540673a212e391876df0686c7db3205710593ede53108a786b10955fa7e9188","sha256:400abf83f36a62ebfc2ef6dce566087b6a1b6d9a3a3d6d57c73f61797bf9192c"],"state_sha256":"fdb4ba5053deb23a62754f15dabc6c8c223cec8b230d9fae793fa604d304e22c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ov2QC138Uoy6srEh0ASNMgZhRSw0pKYjmRHCT4C9J/EoyrDV8BOBzDSfBq3KSPL6OAckkBxsiqhidqm4ZsvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:51:57.384171Z","bundle_sha256":"09e7d8ab46f491609792b4a9f267821dc15e7f5e30dfb177cc47130c5c50b787"}}