{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SQY23P7TVWSVKN6AO5BHLQL2SD","short_pith_number":"pith:SQY23P7T","schema_version":"1.0","canonical_sha256":"9431adbff3ada55537c0774275c17a90e0585649d8e4e6b30803569086a28484","source":{"kind":"arxiv","id":"1101.2061","version":1},"attestation_state":"computed","paper":{"title":"The graphs with the max-Mader-flow-min-multiway-cut property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Guyslain Naves, Vincent Jost (LIX)","submitted_at":"2011-01-11T08:13:09Z","abstract_excerpt":"We are given a graph $G$, an independant set $\\mathcal{S} \\subset V(G)$ of \\emph{terminals}, and a function $w:V(G) \\to \\mathbb{N}$. We want to know if the maximum $w$-packing of vertex-disjoint paths with extremities in $\\mathcal{S}$ is equal to the minimum weight of a vertex-cut separating $\\mathcal{S}$. We call \\emph{Mader-Mengerian} the graphs with this property for each independant set $\\mathcal{S}$ and each weight function $w$. We give a characterization of these graphs in term of forbidden minors, as well as a recognition algorithm and a simple algorithm to find maximum packing of paths"},"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":"1101.2061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-11T08:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"f890e8e9cb6b411bc00b7f65535ce0aadb3992f4540b253d97ca6d560f3fd512","abstract_canon_sha256":"6728d7607f652f5a40ab161d3ae9f47102584bab579b6003d4c158a5e5730ee3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:50.881812Z","signature_b64":"SywMPpQMlBK9WdeZhRB8L9gBZSXyn7tSO+0PFM+PLlnmWh6rSECAvddehbMVV7B+3XRHs9MUXNi3CknqhG16Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9431adbff3ada55537c0774275c17a90e0585649d8e4e6b30803569086a28484","last_reissued_at":"2026-05-18T04:31:50.881417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:50.881417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The graphs with the max-Mader-flow-min-multiway-cut property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Guyslain Naves, Vincent Jost (LIX)","submitted_at":"2011-01-11T08:13:09Z","abstract_excerpt":"We are given a graph $G$, an independant set $\\mathcal{S} \\subset V(G)$ of \\emph{terminals}, and a function $w:V(G) \\to \\mathbb{N}$. We want to know if the maximum $w$-packing of vertex-disjoint paths with extremities in $\\mathcal{S}$ is equal to the minimum weight of a vertex-cut separating $\\mathcal{S}$. We call \\emph{Mader-Mengerian} the graphs with this property for each independant set $\\mathcal{S}$ and each weight function $w$. We give a characterization of these graphs in term of forbidden minors, as well as a recognition algorithm and a simple algorithm to find maximum packing of paths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2061","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2061","created_at":"2026-05-18T04:31:50.881482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2061v1","created_at":"2026-05-18T04:31:50.881482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2061","created_at":"2026-05-18T04:31:50.881482+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQY23P7TVWSV","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQY23P7TVWSVKN6A","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQY23P7T","created_at":"2026-05-18T12:26:41.206345+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/SQY23P7TVWSVKN6AO5BHLQL2SD","json":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD.json","graph_json":"https://pith.science/api/pith-number/SQY23P7TVWSVKN6AO5BHLQL2SD/graph.json","events_json":"https://pith.science/api/pith-number/SQY23P7TVWSVKN6AO5BHLQL2SD/events.json","paper":"https://pith.science/paper/SQY23P7T"},"agent_actions":{"view_html":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD","download_json":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD.json","view_paper":"https://pith.science/paper/SQY23P7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2061&json=true","fetch_graph":"https://pith.science/api/pith-number/SQY23P7TVWSVKN6AO5BHLQL2SD/graph.json","fetch_events":"https://pith.science/api/pith-number/SQY23P7TVWSVKN6AO5BHLQL2SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD/action/storage_attestation","attest_author":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD/action/author_attestation","sign_citation":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD/action/citation_signature","submit_replication":"https://pith.science/pith/SQY23P7TVWSVKN6AO5BHLQL2SD/action/replication_record"}},"created_at":"2026-05-18T04:31:50.881482+00:00","updated_at":"2026-05-18T04:31:50.881482+00:00"}