{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FN76LWEOJCHDTB3N6BUBH43OFS","short_pith_number":"pith:FN76LWEO","schema_version":"1.0","canonical_sha256":"2b7fe5d88e488e39876df06813f36e2cb86b39475b8aef3827e5913ee4a8b90d","source":{"kind":"arxiv","id":"1802.03235","version":1},"attestation_state":"computed","paper":{"title":"The $b$-bibranching Problem: TDI System, Packing, and Discrete Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Kenjiro Takazawa","submitted_at":"2018-02-09T12:51:20Z","abstract_excerpt":"In this paper, we introduce the $b$-bibranching problem in digraphs, which is a common generalization of the bibranching and $b$-branching problems. The bibranching problem, introduced by Schrijver (1982), is a common generalization of the branching and bipartite edge cover problems. Previous results on bibranchings include polynomial algorithms, a linear programming formulation with total dual integrality, a packing theorem, and an M-convex submodular flow formulation. The $b$-branching problem, recently introduced by Kakimura, Kamiyama, and Takazawa (2018), is a generalization of the branchi"},"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":"1802.03235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-09T12:51:20Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"6b705669f43d3024561e79e93fd49982af622593f8fc34250da93a72f7dfdbff","abstract_canon_sha256":"10e6e7fbcca823fcd7551792cd390a0077ff19f904d602c7de1e77c091dbb6a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.216853Z","signature_b64":"aZ22cGlBCyOPKOjgBc9iwW92TUbJ6x0sqRt3RmhHYRJFtn9s8X/NXZpxcjZMD5xFGSPpuw5JoOn7aNSdfG1fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b7fe5d88e488e39876df06813f36e2cb86b39475b8aef3827e5913ee4a8b90d","last_reissued_at":"2026-05-18T00:23:58.216187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.216187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $b$-bibranching Problem: TDI System, Packing, and Discrete Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Kenjiro Takazawa","submitted_at":"2018-02-09T12:51:20Z","abstract_excerpt":"In this paper, we introduce the $b$-bibranching problem in digraphs, which is a common generalization of the bibranching and $b$-branching problems. The bibranching problem, introduced by Schrijver (1982), is a common generalization of the branching and bipartite edge cover problems. Previous results on bibranchings include polynomial algorithms, a linear programming formulation with total dual integrality, a packing theorem, and an M-convex submodular flow formulation. The $b$-branching problem, recently introduced by Kakimura, Kamiyama, and Takazawa (2018), is a generalization of the branchi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03235","kind":"arxiv","version":1},"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":"1802.03235","created_at":"2026-05-18T00:23:58.216293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03235v1","created_at":"2026-05-18T00:23:58.216293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03235","created_at":"2026-05-18T00:23:58.216293+00:00"},{"alias_kind":"pith_short_12","alias_value":"FN76LWEOJCHD","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FN76LWEOJCHDTB3N","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FN76LWEO","created_at":"2026-05-18T12:32:22.470017+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/FN76LWEOJCHDTB3N6BUBH43OFS","json":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS.json","graph_json":"https://pith.science/api/pith-number/FN76LWEOJCHDTB3N6BUBH43OFS/graph.json","events_json":"https://pith.science/api/pith-number/FN76LWEOJCHDTB3N6BUBH43OFS/events.json","paper":"https://pith.science/paper/FN76LWEO"},"agent_actions":{"view_html":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS","download_json":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS.json","view_paper":"https://pith.science/paper/FN76LWEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03235&json=true","fetch_graph":"https://pith.science/api/pith-number/FN76LWEOJCHDTB3N6BUBH43OFS/graph.json","fetch_events":"https://pith.science/api/pith-number/FN76LWEOJCHDTB3N6BUBH43OFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS/action/storage_attestation","attest_author":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS/action/author_attestation","sign_citation":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS/action/citation_signature","submit_replication":"https://pith.science/pith/FN76LWEOJCHDTB3N6BUBH43OFS/action/replication_record"}},"created_at":"2026-05-18T00:23:58.216293+00:00","updated_at":"2026-05-18T00:23:58.216293+00:00"}