{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LPP4TJW43IURBLX3ML6JKO7OUB","short_pith_number":"pith:LPP4TJW4","schema_version":"1.0","canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","source":{"kind":"arxiv","id":"1608.05722","version":2},"attestation_state":"computed","paper":{"title":"Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Krist\\'of B\\'erczi","submitted_at":"2016-08-19T20:09:25Z","abstract_excerpt":"The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$ each having a specified number $\\mu _i$ of arcs, (B) as an extension of Ryser's maximum term rank formula, determine the largest possible matching number of simple bipartite graphs complying with degree-constraints. The solutions to these problems and to their generalizations will be obtained from a new min-max theorem on covering a supermodular function by a "},"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":"1608.05722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T20:09:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64cde9b5994107e389196362d4b59c9b31ea7ec1a30d44bd5d45d464a67cd171","abstract_canon_sha256":"6b269a55e89810a58100c154dce0c11a6415055a0459684b745c6a05fa97aa3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:09.645237Z","signature_b64":"p+ArDHjS6bkCccOKzxdvoS6XMipM2ovmpcwgCvnEh37yYZ28EXnPrM5ajzOuT5udfYLdPcrP5eCAkVhXZXvBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","last_reissued_at":"2026-05-18T00:36:09.644678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:09.644678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Krist\\'of B\\'erczi","submitted_at":"2016-08-19T20:09:25Z","abstract_excerpt":"The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$ each having a specified number $\\mu _i$ of arcs, (B) as an extension of Ryser's maximum term rank formula, determine the largest possible matching number of simple bipartite graphs complying with degree-constraints. The solutions to these problems and to their generalizations will be obtained from a new min-max theorem on covering a supermodular function by a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05722","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":"1608.05722","created_at":"2026-05-18T00:36:09.644772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05722v2","created_at":"2026-05-18T00:36:09.644772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05722","created_at":"2026-05-18T00:36:09.644772+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPP4TJW43IUR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPP4TJW43IURBLX3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPP4TJW4","created_at":"2026-05-18T12:30:29.479603+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/LPP4TJW43IURBLX3ML6JKO7OUB","json":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB.json","graph_json":"https://pith.science/api/pith-number/LPP4TJW43IURBLX3ML6JKO7OUB/graph.json","events_json":"https://pith.science/api/pith-number/LPP4TJW43IURBLX3ML6JKO7OUB/events.json","paper":"https://pith.science/paper/LPP4TJW4"},"agent_actions":{"view_html":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB","download_json":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB.json","view_paper":"https://pith.science/paper/LPP4TJW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05722&json=true","fetch_graph":"https://pith.science/api/pith-number/LPP4TJW43IURBLX3ML6JKO7OUB/graph.json","fetch_events":"https://pith.science/api/pith-number/LPP4TJW43IURBLX3ML6JKO7OUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/action/storage_attestation","attest_author":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/action/author_attestation","sign_citation":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/action/citation_signature","submit_replication":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/action/replication_record"}},"created_at":"2026-05-18T00:36:09.644772+00:00","updated_at":"2026-05-18T00:36:09.644772+00:00"}