{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTXSRAAQUYG6AFHUCLMZDAK7XV","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":"51df99747a4014c6021c8aecc0b51e4d83d1405fd1760afd48ea6cee6adc4218","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-22T12:28:45Z","title_canon_sha256":"aebe37b55bf990dd0445ce652785244244e6cf5d3edc5642eb073faf858428c5"},"schema_version":"1.0","source":{"id":"1808.07332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07332","created_at":"2026-05-18T00:07:29Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07332v1","created_at":"2026-05-18T00:07:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07332","created_at":"2026-05-18T00:07:29Z"},{"alias_kind":"pith_short_12","alias_value":"MTXSRAAQUYG6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTXSRAAQUYG6AFHU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTXSRAAQ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:189516922a9a77fa3d7f526cc17b94633de69e580ae5977c42935ef200b6f902","target":"graph","created_at":"2026-05-18T00:07:29Z","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":"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","authors_text":"Shin-ichi Tanigawa, Tatsuya Matsuoka","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-22T12:28:45Z","title":"On Reachability Mixed Arborescence Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07332","kind":"arxiv","version":1},"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:24a11af04a2cf24fb5a969749153b51f51f99edae684ffc7fa81bf48ef042ff0","target":"record","created_at":"2026-05-18T00:07:29Z","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":"51df99747a4014c6021c8aecc0b51e4d83d1405fd1760afd48ea6cee6adc4218","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-22T12:28:45Z","title_canon_sha256":"aebe37b55bf990dd0445ce652785244244e6cf5d3edc5642eb073faf858428c5"},"schema_version":"1.0","source":{"id":"1808.07332","kind":"arxiv","version":1}},"canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","first_computed_at":"2026-05-18T00:07:29.156205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:29.156205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ngCKWedfcfVt4vz9SUicsCK/xN1wJB/EnO+iCafd+1ifqVDkQXSCBzvql0qVy6BmEf6pzGdAZ1Tb42lfWVlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:29.156895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24a11af04a2cf24fb5a969749153b51f51f99edae684ffc7fa81bf48ef042ff0","sha256:189516922a9a77fa3d7f526cc17b94633de69e580ae5977c42935ef200b6f902"],"state_sha256":"480ddc105e01f7c0f25d88ed82e61535b4e8378e423a6b24658de19435265e33"}