{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6YUEYSHTQLGCIIAIT3ZBW2QQJB","short_pith_number":"pith:6YUEYSHT","canonical_record":{"source":{"id":"1706.02029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T02:18:30Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"6b39bc67c537ae3fa221f07907d8fc02a0c721e44711099832dc4ef8b2518fc6","abstract_canon_sha256":"07ba82d43a4519e22eb787fad8ce15a8aad4c26defa13e1463a898702e58369b"},"schema_version":"1.0"},"canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","source":{"kind":"arxiv","id":"1706.02029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02029","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02029v2","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02029","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"6YUEYSHTQLGC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YUEYSHTQLGCIIAI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YUEYSHT","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6YUEYSHTQLGCIIAIT3ZBW2QQJB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T02:18:30Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"6b39bc67c537ae3fa221f07907d8fc02a0c721e44711099832dc4ef8b2518fc6","abstract_canon_sha256":"07ba82d43a4519e22eb787fad8ce15a8aad4c26defa13e1463a898702e58369b"},"schema_version":"1.0"},"canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:19.418664Z","signature_b64":"6JIg9P1kWkZk09gjNf87l59/iSaT9cLDB9tFSM0YIMXBBiOxK80JKPuosM/+VcRjuN/7kHBOHCOUQThTM5+vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","last_reissued_at":"2026-05-18T00:10:19.418004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:19.418004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02029","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:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgYCzwUh0m7VZ+xJM3jaUXsoGYQSdhNjDDVckNiVcA4FtFjX7WfnfMK6Fm0kp6z8oG+8P1LQmyKIxFljC/ZPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:47:55.621853Z"},"content_sha256":"755966a77ec882272d2e35b16e8916a70a1f9987dc0f4bce5bd7dd851c14cabf","schema_version":"1.0","event_id":"sha256:755966a77ec882272d2e35b16e8916a70a1f9987dc0f4bce5bd7dd851c14cabf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6YUEYSHTQLGCIIAIT3ZBW2QQJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relationship of Two Formulations for Shortest Bibranchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Kazuo Murota, Kenjiro Takazawa","submitted_at":"2017-06-07T02:18:30Z","abstract_excerpt":"The shortest bibranching problem is a common generalization of the minimum-weight edge cover problem in bipartite graphs and the minimum-weight arborescence problem in directed graphs. For the shortest bibranching problem, an efficient primal-dual algorithm is given by Keijsper and Pendavingh (1998), and the tractability of the problem is ascribed to total dual integrality in a linear programming formulation by Schrijver (1982). Another view on the tractability of this problem is afforded by a valuated matroid intersection formulation by Takazawa (2012). In the present paper, we discuss the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02029","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:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJdQhEd+NzWEmn3Iz3pWC0uQnPeLzN8gQOa281QBBt051udSXIbk/bLJt/8HsphtEM6gvKw9fX+rXdtp0DmTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:47:55.622524Z"},"content_sha256":"2fdc2c268c7549a338d4aa0412daf03d656cc39c3638b658e13bb443a8a4f0be","schema_version":"1.0","event_id":"sha256:2fdc2c268c7549a338d4aa0412daf03d656cc39c3638b658e13bb443a8a4f0be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/bundle.json","state_url":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/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-05T04:47:55Z","links":{"resolver":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB","bundle":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/bundle.json","state":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6YUEYSHTQLGCIIAIT3ZBW2QQJB","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":"07ba82d43a4519e22eb787fad8ce15a8aad4c26defa13e1463a898702e58369b","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T02:18:30Z","title_canon_sha256":"6b39bc67c537ae3fa221f07907d8fc02a0c721e44711099832dc4ef8b2518fc6"},"schema_version":"1.0","source":{"id":"1706.02029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02029","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02029v2","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02029","created_at":"2026-05-18T00:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"6YUEYSHTQLGC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YUEYSHTQLGCIIAI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YUEYSHT","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:2fdc2c268c7549a338d4aa0412daf03d656cc39c3638b658e13bb443a8a4f0be","target":"graph","created_at":"2026-05-18T00:10:19Z","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 shortest bibranching problem is a common generalization of the minimum-weight edge cover problem in bipartite graphs and the minimum-weight arborescence problem in directed graphs. For the shortest bibranching problem, an efficient primal-dual algorithm is given by Keijsper and Pendavingh (1998), and the tractability of the problem is ascribed to total dual integrality in a linear programming formulation by Schrijver (1982). Another view on the tractability of this problem is afforded by a valuated matroid intersection formulation by Takazawa (2012). In the present paper, we discuss the re","authors_text":"Kazuo Murota, Kenjiro Takazawa","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T02:18:30Z","title":"Relationship of Two Formulations for Shortest Bibranchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02029","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:755966a77ec882272d2e35b16e8916a70a1f9987dc0f4bce5bd7dd851c14cabf","target":"record","created_at":"2026-05-18T00:10:19Z","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":"07ba82d43a4519e22eb787fad8ce15a8aad4c26defa13e1463a898702e58369b","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-07T02:18:30Z","title_canon_sha256":"6b39bc67c537ae3fa221f07907d8fc02a0c721e44711099832dc4ef8b2518fc6"},"schema_version":"1.0","source":{"id":"1706.02029","kind":"arxiv","version":2}},"canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","first_computed_at":"2026-05-18T00:10:19.418004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:19.418004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6JIg9P1kWkZk09gjNf87l59/iSaT9cLDB9tFSM0YIMXBBiOxK80JKPuosM/+VcRjuN/7kHBOHCOUQThTM5+vCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:19.418664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755966a77ec882272d2e35b16e8916a70a1f9987dc0f4bce5bd7dd851c14cabf","sha256:2fdc2c268c7549a338d4aa0412daf03d656cc39c3638b658e13bb443a8a4f0be"],"state_sha256":"75a0e24c14ca624318b29e2914fa87343f7a2e8f9738e942e72f9c0bf76c34a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kiuKX7DLcgd7mmwFkSKa917UYvTnjDA1UTUojuDop2oD1NmkqaYx14f4clFL2/VCXl0lejT7jJS+nHmFdrtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:47:55.625812Z","bundle_sha256":"ca2b5615d002da8dc906d3d9438e5ae88aeda7e7e8407fdb00d474a43b9c6e96"}}