{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6YUEYSHTQLGCIIAIT3ZBW2QQJB","short_pith_number":"pith:6YUEYSHT","schema_version":"1.0","canonical_sha256":"f6284c48f382cc2420089ef21b6a1048618363e8db6961bfc582b7f11ecf8329","source":{"kind":"arxiv","id":"1706.02029","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.02029","created_at":"2026-05-18T00:10:19.418096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02029v2","created_at":"2026-05-18T00:10:19.418096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02029","created_at":"2026-05-18T00:10:19.418096+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YUEYSHTQLGC","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YUEYSHTQLGCIIAI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YUEYSHT","created_at":"2026-05-18T12:31:03.183658+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/6YUEYSHTQLGCIIAIT3ZBW2QQJB","json":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB.json","graph_json":"https://pith.science/api/pith-number/6YUEYSHTQLGCIIAIT3ZBW2QQJB/graph.json","events_json":"https://pith.science/api/pith-number/6YUEYSHTQLGCIIAIT3ZBW2QQJB/events.json","paper":"https://pith.science/paper/6YUEYSHT"},"agent_actions":{"view_html":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB","download_json":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB.json","view_paper":"https://pith.science/paper/6YUEYSHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02029&json=true","fetch_graph":"https://pith.science/api/pith-number/6YUEYSHTQLGCIIAIT3ZBW2QQJB/graph.json","fetch_events":"https://pith.science/api/pith-number/6YUEYSHTQLGCIIAIT3ZBW2QQJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/action/storage_attestation","attest_author":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/action/author_attestation","sign_citation":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/action/citation_signature","submit_replication":"https://pith.science/pith/6YUEYSHTQLGCIIAIT3ZBW2QQJB/action/replication_record"}},"created_at":"2026-05-18T00:10:19.418096+00:00","updated_at":"2026-05-18T00:10:19.418096+00:00"}