{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTXSRAAQUYG6AFHUCLMZDAK7XV","short_pith_number":"pith:MTXSRAAQ","schema_version":"1.0","canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","source":{"kind":"arxiv","id":"1808.07332","version":1},"attestation_state":"computed","paper":{"title":"On Reachability Mixed Arborescence Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shin-ichi Tanigawa, Tatsuya Matsuoka","submitted_at":"2018-08-22T12:28:45Z","abstract_excerpt":"As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root. Fortier--Kir\\'aly--L\\'eonard--Szigeti--Talon (2018) asked whether the result can be extended to mixed graphs by allowing both directed arcs and undirected edges. In this paper, we solve this question by developing a polynomial-time algorithm for finding a collection of edge and arc-disjoint arborescences spanning the set of vertices reachable from each root"},"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":"1808.07332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-22T12:28:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aebe37b55bf990dd0445ce652785244244e6cf5d3edc5642eb073faf858428c5","abstract_canon_sha256":"51df99747a4014c6021c8aecc0b51e4d83d1405fd1760afd48ea6cee6adc4218"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:29.156895Z","signature_b64":"6ngCKWedfcfVt4vz9SUicsCK/xN1wJB/EnO+iCafd+1ifqVDkQXSCBzvql0qVy6BmEf6pzGdAZ1Tb42lfWVlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","last_reissued_at":"2026-05-18T00:07:29.156205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:29.156205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Reachability Mixed Arborescence Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shin-ichi Tanigawa, Tatsuya Matsuoka","submitted_at":"2018-08-22T12:28:45Z","abstract_excerpt":"As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root. Fortier--Kir\\'aly--L\\'eonard--Szigeti--Talon (2018) asked whether the result can be extended to mixed graphs by allowing both directed arcs and undirected edges. In this paper, we solve this question by developing a polynomial-time algorithm for finding a collection of edge and arc-disjoint arborescences spanning the set of vertices reachable from each root"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07332","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":"1808.07332","created_at":"2026-05-18T00:07:29.156303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07332v1","created_at":"2026-05-18T00:07:29.156303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07332","created_at":"2026-05-18T00:07:29.156303+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTXSRAAQUYG6","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTXSRAAQUYG6AFHU","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTXSRAAQ","created_at":"2026-05-18T12:32:40.477152+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/MTXSRAAQUYG6AFHUCLMZDAK7XV","json":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV.json","graph_json":"https://pith.science/api/pith-number/MTXSRAAQUYG6AFHUCLMZDAK7XV/graph.json","events_json":"https://pith.science/api/pith-number/MTXSRAAQUYG6AFHUCLMZDAK7XV/events.json","paper":"https://pith.science/paper/MTXSRAAQ"},"agent_actions":{"view_html":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV","download_json":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV.json","view_paper":"https://pith.science/paper/MTXSRAAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07332&json=true","fetch_graph":"https://pith.science/api/pith-number/MTXSRAAQUYG6AFHUCLMZDAK7XV/graph.json","fetch_events":"https://pith.science/api/pith-number/MTXSRAAQUYG6AFHUCLMZDAK7XV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/action/storage_attestation","attest_author":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/action/author_attestation","sign_citation":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/action/citation_signature","submit_replication":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/action/replication_record"}},"created_at":"2026-05-18T00:07:29.156303+00:00","updated_at":"2026-05-18T00:07:29.156303+00:00"}