{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AZQC4HSHPKJ3OYC67DNKKQA5UJ","short_pith_number":"pith:AZQC4HSH","schema_version":"1.0","canonical_sha256":"06602e1e477a93b7605ef8daa5401da25fe414ed8773157be55092bd820eb22c","source":{"kind":"arxiv","id":"1507.00868","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.00868","created_at":"2026-05-18T01:37:22.403114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00868v1","created_at":"2026-05-18T01:37:22.403114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00868","created_at":"2026-05-18T01:37:22.403114+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZQC4HSHPKJ3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZQC4HSHPKJ3OYC6","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZQC4HSH","created_at":"2026-05-18T12:29:14.074870+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/AZQC4HSHPKJ3OYC67DNKKQA5UJ","json":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ.json","graph_json":"https://pith.science/api/pith-number/AZQC4HSHPKJ3OYC67DNKKQA5UJ/graph.json","events_json":"https://pith.science/api/pith-number/AZQC4HSHPKJ3OYC67DNKKQA5UJ/events.json","paper":"https://pith.science/paper/AZQC4HSH"},"agent_actions":{"view_html":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ","download_json":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ.json","view_paper":"https://pith.science/paper/AZQC4HSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00868&json=true","fetch_graph":"https://pith.science/api/pith-number/AZQC4HSHPKJ3OYC67DNKKQA5UJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AZQC4HSHPKJ3OYC67DNKKQA5UJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/action/storage_attestation","attest_author":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/action/author_attestation","sign_citation":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/action/citation_signature","submit_replication":"https://pith.science/pith/AZQC4HSHPKJ3OYC67DNKKQA5UJ/action/replication_record"}},"created_at":"2026-05-18T01:37:22.403114+00:00","updated_at":"2026-05-18T01:37:22.403114+00:00"}