{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTXSRAAQUYG6AFHUCLMZDAK7XV","short_pith_number":"pith:MTXSRAAQ","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"},"canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","source":{"kind":"arxiv","id":"1808.07332","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTXSRAAQUYG6AFHUCLMZDAK7XV","target":"record","payload":{"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"},"canonical_sha256":"64ef288010a60de014f412d991815fbd45bc6ca7425a31b8c7687a9c72fdfeef","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"},"source_kind":"arxiv","source_id":"1808.07332","source_version":1,"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:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6Vd/5u+DNXnsDdHcgE4/K9J6Xs7HaUIxwqiiIQOqjSh/2fPUyDtZ9L76HIaeAn3HopQJ+ZtDMKGquLLM/L8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:28:44.616625Z"},"content_sha256":"24a11af04a2cf24fb5a969749153b51f51f99edae684ffc7fa81bf48ef042ff0","schema_version":"1.0","event_id":"sha256:24a11af04a2cf24fb5a969749153b51f51f99edae684ffc7fa81bf48ef042ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTXSRAAQUYG6AFHUCLMZDAK7XV","target":"graph","payload":{"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"},"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:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFHs3CJiMWqtL3/rZ/sERXsGoM8S+HIo6lTt5YJfQ5guxXYCVVq2Q9DnYbXeD5G0mCzzEVE2J8yEov/wFC8NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:28:44.616968Z"},"content_sha256":"189516922a9a77fa3d7f526cc17b94633de69e580ae5977c42935ef200b6f902","schema_version":"1.0","event_id":"sha256:189516922a9a77fa3d7f526cc17b94633de69e580ae5977c42935ef200b6f902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/bundle.json","state_url":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/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-09T00:28:44Z","links":{"resolver":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV","bundle":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/bundle.json","state":"https://pith.science/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTXSRAAQUYG6AFHUCLMZDAK7XV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iVX1Ei8IEsNBUjFzXpbdanJ4d0ZR4j/8sAV5XzQnP3ElBdiETGSyRc5kja9CR8ReU3/y6I25iVeOToYuqxIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:28:44.619033Z","bundle_sha256":"734b480ca947cdc501c9c2a34cdc01d6e987dc228ac64dc6b152236dacedb498"}}