{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LPP4TJW43IURBLX3ML6JKO7OUB","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":"6b269a55e89810a58100c154dce0c11a6415055a0459684b745c6a05fa97aa3a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T20:09:25Z","title_canon_sha256":"64cde9b5994107e389196362d4b59c9b31ea7ec1a30d44bd5d45d464a67cd171"},"schema_version":"1.0","source":{"id":"1608.05722","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05722","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05722v2","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05722","created_at":"2026-05-18T00:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"LPP4TJW43IUR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPP4TJW43IURBLX3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPP4TJW4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:0a84756353905938c7844356491f7cc4d57baf700b08ef2b907016702c61f5a6","target":"graph","created_at":"2026-05-18T00:36:09Z","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":"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 ","authors_text":"Andr\\'as Frank, Krist\\'of B\\'erczi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T20:09:25Z","title":"Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05722","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:437171f0b22130cd59b104b383eb0b0e9f36098d71ac825608c34f4fe1271048","target":"record","created_at":"2026-05-18T00:36:09Z","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":"6b269a55e89810a58100c154dce0c11a6415055a0459684b745c6a05fa97aa3a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T20:09:25Z","title_canon_sha256":"64cde9b5994107e389196362d4b59c9b31ea7ec1a30d44bd5d45d464a67cd171"},"schema_version":"1.0","source":{"id":"1608.05722","kind":"arxiv","version":2}},"canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","first_computed_at":"2026-05-18T00:36:09.644678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:09.644678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p+ArDHjS6bkCccOKzxdvoS6XMipM2ovmpcwgCvnEh37yYZ28EXnPrM5ajzOuT5udfYLdPcrP5eCAkVhXZXvBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:09.645237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05722","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:437171f0b22130cd59b104b383eb0b0e9f36098d71ac825608c34f4fe1271048","sha256:0a84756353905938c7844356491f7cc4d57baf700b08ef2b907016702c61f5a6"],"state_sha256":"81281b4d9a69b66c6e57bc1250df5b5d80b538ebca0ab84d0813f23be43a6e7c"}