{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LPP4TJW43IURBLX3ML6JKO7OUB","short_pith_number":"pith:LPP4TJW4","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"},"canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","source":{"kind":"arxiv","id":"1608.05722","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LPP4TJW43IURBLX3ML6JKO7OUB","target":"record","payload":{"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"},"canonical_sha256":"5bdfc9a6dcda2910aefb62fc953beea0771d617ba5a047c17b1093859da50ced","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"},"source_kind":"arxiv","source_id":"1608.05722","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-18T00:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsCghmPlBJ1/YoUCcMtJMJPCA1tUnA8v+wZma9iWpxBfp9fxmMgb6CujwKcMY8iQmeJRdcS29tkLuVcS9SpeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:45:13.186731Z"},"content_sha256":"437171f0b22130cd59b104b383eb0b0e9f36098d71ac825608c34f4fe1271048","schema_version":"1.0","event_id":"sha256:437171f0b22130cd59b104b383eb0b0e9f36098d71ac825608c34f4fe1271048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LPP4TJW43IURBLX3ML6JKO7OUB","target":"graph","payload":{"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"},"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-18T00:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyALTV6znp7FQaUyes4sQ8f+vq6GjeAUxgGlk7/hG57mRYux58F57w2iwEgCpAlWjwHiM4cNlTD4sD/ncOkYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:45:13.187071Z"},"content_sha256":"0a84756353905938c7844356491f7cc4d57baf700b08ef2b907016702c61f5a6","schema_version":"1.0","event_id":"sha256:0a84756353905938c7844356491f7cc4d57baf700b08ef2b907016702c61f5a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/bundle.json","state_url":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPP4TJW43IURBLX3ML6JKO7OUB/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-27T13:45:13Z","links":{"resolver":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB","bundle":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/bundle.json","state":"https://pith.science/pith/LPP4TJW43IURBLX3ML6JKO7OUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPP4TJW43IURBLX3ML6JKO7OUB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DywEKwkMkTbxy7zbODwkLYaRqgAPyG3phtie6lMGxyFE64OKB/dJzQixPZ0Dp0WO2DTxiPx5VDXOGqMMv7ViCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:45:13.188974Z","bundle_sha256":"c99bfbbe633c4aff9528068b27704dd58fcc77b697cb8448646fec8d38d09de2"}}