{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E4ZXUEV6ZP6Z6FOVYERT2JMAKU","short_pith_number":"pith:E4ZXUEV6","schema_version":"1.0","canonical_sha256":"27337a12becbfd9f15d5c1233d2580552b8cd7046b9c7669e487397b4319f4a7","source":{"kind":"arxiv","id":"1202.0747","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.0747","created_at":"2026-05-18T03:36:56.684868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0747v2","created_at":"2026-05-18T03:36:56.684868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0747","created_at":"2026-05-18T03:36:56.684868+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4ZXUEV6ZP6Z","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4ZXUEV6ZP6Z6FOV","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4ZXUEV6","created_at":"2026-05-18T12:27:04.183437+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/E4ZXUEV6ZP6Z6FOVYERT2JMAKU","json":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU.json","graph_json":"https://pith.science/api/pith-number/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/graph.json","events_json":"https://pith.science/api/pith-number/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/events.json","paper":"https://pith.science/paper/E4ZXUEV6"},"agent_actions":{"view_html":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU","download_json":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU.json","view_paper":"https://pith.science/paper/E4ZXUEV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0747&json=true","fetch_graph":"https://pith.science/api/pith-number/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/graph.json","fetch_events":"https://pith.science/api/pith-number/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/action/storage_attestation","attest_author":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/action/author_attestation","sign_citation":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/action/citation_signature","submit_replication":"https://pith.science/pith/E4ZXUEV6ZP6Z6FOVYERT2JMAKU/action/replication_record"}},"created_at":"2026-05-18T03:36:56.684868+00:00","updated_at":"2026-05-18T03:36:56.684868+00:00"}