{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AZQC4HSHPKJ3OYC67DNKKQA5UJ","short_pith_number":"pith:AZQC4HSH","canonical_record":{"source":{"id":"1507.00868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-03T10:51:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b22a2e0ca0336f3380ca1467370d89c0dba792d90f222e8d8f5754904a336932","abstract_canon_sha256":"c8517e3decefa394207543c6bf4e3b27677ee5ba40eaccbb765ca43aacd452f7"},"schema_version":"1.0"},"canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","source":{"kind":"arxiv","id":"1507.00868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00868","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00868v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00868","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"AZQC4HSHPKJ3","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZQC4HSHPKJ3OYC6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZQC4HSH","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AZQC4HSHPKJ3OYC67DNKKQA5UJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-03T10:51:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b22a2e0ca0336f3380ca1467370d89c0dba792d90f222e8d8f5754904a336932","abstract_canon_sha256":"c8517e3decefa394207543c6bf4e3b27677ee5ba40eaccbb765ca43aacd452f7"},"schema_version":"1.0"},"canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.403605Z","signature_b64":"jUhhVrSM3htGE1rCPQxeImZgdEWuuOWrCWlsu7dDlewkePwYQmFGnQKzdQNAmOrgdqqkWU1trkUakYu83oFOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","last_reissued_at":"2026-05-18T01:37:22.402975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.402975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00868","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-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zd5EJVQjqbg0UyPSuZS+FHnAvvTkk3hEV3q8nnl35UjSjHRftjONtTNhzMYsnl+DGvAbL2NDFtqJagRPYns9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:22.884442Z"},"content_sha256":"8c32ba19208f870d7f934d65d94a3f71307d6a0273bc92e6cf71294f85873006","schema_version":"1.0","event_id":"sha256:8c32ba19208f870d7f934d65d94a3f71307d6a0273bc92e6cf71294f85873006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AZQC4HSHPKJ3OYC67DNKKQA5UJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blocking unions of arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Attila Bern\\'ath, Gyula Pap","submitted_at":"2015-07-03T10:51:22Z","abstract_excerpt":"Given a digraph $D=(V,A)$ and a positive integer $k$, a subset $B\\subseteq A$ is called a \\textbf{$k$-union-arborescence}, if it is the disjoint union of $k$ spanning arborescences. When also arc-costs $c:A\\to \\mathbb{R}$ are given, minimizing the cost of a $k$-union-arborescence is well-known to be tractable. In this paper we take on the following problem: what is the minimum cardinality of a set of arcs the removal of which destroys every minimum $c$-cost $k$-union-arborescence. Actually, the more general weighted problem is also considered, that is, arc weights $w:A\\to \\mathbb{R}_+$ (unrela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00868","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-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVvIAFerDYMlWJUCsU0lCvcqd/G3Q2YJNH/wj+G6V8GIQ7GxEjf/gkKfEuQUZJG7HBfoEL48KvhZBHTfnGGkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:22.884793Z"},"content_sha256":"1a68f15b4d7731c02ff3a12a2c19016982c1046c3fbb6a078ad2d3b614da0e0c","schema_version":"1.0","event_id":"sha256:1a68f15b4d7731c02ff3a12a2c19016982c1046c3fbb6a078ad2d3b614da0e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/bundle.json","state_url":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/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-02T04:42:22Z","links":{"resolver":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ","bundle":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/bundle.json","state":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AZQC4HSHPKJ3OYC67DNKKQA5UJ","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":"c8517e3decefa394207543c6bf4e3b27677ee5ba40eaccbb765ca43aacd452f7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-03T10:51:22Z","title_canon_sha256":"b22a2e0ca0336f3380ca1467370d89c0dba792d90f222e8d8f5754904a336932"},"schema_version":"1.0","source":{"id":"1507.00868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00868","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00868v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00868","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"AZQC4HSHPKJ3","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZQC4HSHPKJ3OYC6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZQC4HSH","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:1a68f15b4d7731c02ff3a12a2c19016982c1046c3fbb6a078ad2d3b614da0e0c","target":"graph","created_at":"2026-05-18T01:37:22Z","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":"Given a digraph $D=(V,A)$ and a positive integer $k$, a subset $B\\subseteq A$ is called a \\textbf{$k$-union-arborescence}, if it is the disjoint union of $k$ spanning arborescences. When also arc-costs $c:A\\to \\mathbb{R}$ are given, minimizing the cost of a $k$-union-arborescence is well-known to be tractable. In this paper we take on the following problem: what is the minimum cardinality of a set of arcs the removal of which destroys every minimum $c$-cost $k$-union-arborescence. Actually, the more general weighted problem is also considered, that is, arc weights $w:A\\to \\mathbb{R}_+$ (unrela","authors_text":"Attila Bern\\'ath, Gyula Pap","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-03T10:51:22Z","title":"Blocking unions of arborescences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00868","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:8c32ba19208f870d7f934d65d94a3f71307d6a0273bc92e6cf71294f85873006","target":"record","created_at":"2026-05-18T01:37:22Z","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":"c8517e3decefa394207543c6bf4e3b27677ee5ba40eaccbb765ca43aacd452f7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-03T10:51:22Z","title_canon_sha256":"b22a2e0ca0336f3380ca1467370d89c0dba792d90f222e8d8f5754904a336932"},"schema_version":"1.0","source":{"id":"1507.00868","kind":"arxiv","version":1}},"canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","first_computed_at":"2026-05-18T01:37:22.402975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:22.402975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jUhhVrSM3htGE1rCPQxeImZgdEWuuOWrCWlsu7dDlewkePwYQmFGnQKzdQNAmOrgdqqkWU1trkUakYu83oFOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:22.403605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c32ba19208f870d7f934d65d94a3f71307d6a0273bc92e6cf71294f85873006","sha256:1a68f15b4d7731c02ff3a12a2c19016982c1046c3fbb6a078ad2d3b614da0e0c"],"state_sha256":"fb7ca441d8c7031366aa169060f7537468343f910025dcf05c168612761f9177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdkFV02FKvv6pXmABOJrakkRFt7gFliNDlSrt96qMZAYBzAlKr0fiDR+h/FUcjme6lNHtp/zh5rzdpvw9DhQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:42:22.886978Z","bundle_sha256":"8f48688b960aaf4c86cf9ad6ab2e1e478ccee7c48980caeeb444789f250f1fa7"}}