{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3LFCM6XOOS3C5P5VOTLA6USL2W","short_pith_number":"pith:3LFCM6XO","schema_version":"1.0","canonical_sha256":"daca267aee74b62ebfb574d60f524bd592cc51b1ea3ae2ba6e58102108b77b9b","source":{"kind":"arxiv","id":"1507.04207","version":1},"attestation_state":"computed","paper":{"title":"Blocking optimal $k$-arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Attila Bern\\'ath, Tam\\'as Kir\\'aly","submitted_at":"2015-07-15T13:28:40Z","abstract_excerpt":"Given a digraph $D=(V,A)$ and a positive integer $k$, an arc set $F\\subseteq A$ is called a \\textbf{$k$-arborescence} if it is the disjoint union of $k$ spanning arborescences. The problem of finding a minimum cost $k$-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from every minimum cost $k$-arborescence. For $k=1$, the problem was solved in [A. Bern\\'ath, G. Pap , Blocking optimal arborescences, IPCO 2013]. In this paper we give an algorithm"},"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.04207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-15T13:28:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"729b09035504c6d8e164ba41f57cd5908be6a2905ade3ad513f4de1ad94d841a","abstract_canon_sha256":"16b9fa501134dfefbf4d738545cf3ad81b2c97946e25be01f85c2fe01c12c4cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:48.874838Z","signature_b64":"Mz22n9NzbsjvcicEzh7K87CnRkOp+L6dI885kTkFvuGShkyLPebe2Le2Ix9BDxIRlX7Hf+NVMMP0aJVs6KAHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daca267aee74b62ebfb574d60f524bd592cc51b1ea3ae2ba6e58102108b77b9b","last_reissued_at":"2026-05-18T01:36:48.874101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:48.874101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blocking optimal $k$-arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Attila Bern\\'ath, Tam\\'as Kir\\'aly","submitted_at":"2015-07-15T13:28:40Z","abstract_excerpt":"Given a digraph $D=(V,A)$ and a positive integer $k$, an arc set $F\\subseteq A$ is called a \\textbf{$k$-arborescence} if it is the disjoint union of $k$ spanning arborescences. The problem of finding a minimum cost $k$-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from every minimum cost $k$-arborescence. For $k=1$, the problem was solved in [A. Bern\\'ath, G. Pap , Blocking optimal arborescences, IPCO 2013]. In this paper we give an algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04207","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.04207","created_at":"2026-05-18T01:36:48.874227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04207v1","created_at":"2026-05-18T01:36:48.874227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04207","created_at":"2026-05-18T01:36:48.874227+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LFCM6XOOS3C","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LFCM6XOOS3C5P5V","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LFCM6XO","created_at":"2026-05-18T12:29:02.477457+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/3LFCM6XOOS3C5P5VOTLA6USL2W","json":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W.json","graph_json":"https://pith.science/api/pith-number/3LFCM6XOOS3C5P5VOTLA6USL2W/graph.json","events_json":"https://pith.science/api/pith-number/3LFCM6XOOS3C5P5VOTLA6USL2W/events.json","paper":"https://pith.science/paper/3LFCM6XO"},"agent_actions":{"view_html":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W","download_json":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W.json","view_paper":"https://pith.science/paper/3LFCM6XO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04207&json=true","fetch_graph":"https://pith.science/api/pith-number/3LFCM6XOOS3C5P5VOTLA6USL2W/graph.json","fetch_events":"https://pith.science/api/pith-number/3LFCM6XOOS3C5P5VOTLA6USL2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W/action/storage_attestation","attest_author":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W/action/author_attestation","sign_citation":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W/action/citation_signature","submit_replication":"https://pith.science/pith/3LFCM6XOOS3C5P5VOTLA6USL2W/action/replication_record"}},"created_at":"2026-05-18T01:36:48.874227+00:00","updated_at":"2026-05-18T01:36:48.874227+00:00"}