{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4JEY5CHHPGABYQVX2F5GLJGMDD","short_pith_number":"pith:4JEY5CHH","canonical_record":{"source":{"id":"1506.05677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-18T13:51:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"25278567b5bf7bea11fde05103558ba7f00ee4f553d2b87ebbd0a31ea72855bb","abstract_canon_sha256":"4ab68429e23b2b3df4d4cfd50879d252a9275b227eeb23a854749136c6c4ed7f"},"schema_version":"1.0"},"canonical_sha256":"e2498e88e779801c42b7d17a65a4cc18f7c73ba3954309939825e7ad8ef34070","source":{"kind":"arxiv","id":"1506.05677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05677","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05677v1","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05677","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"4JEY5CHHPGAB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JEY5CHHPGABYQVX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JEY5CHH","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4JEY5CHHPGABYQVX2F5GLJGMDD","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-18T13:51:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"25278567b5bf7bea11fde05103558ba7f00ee4f553d2b87ebbd0a31ea72855bb","abstract_canon_sha256":"4ab68429e23b2b3df4d4cfd50879d252a9275b227eeb23a854749136c6c4ed7f"},"schema_version":"1.0"},"canonical_sha256":"e2498e88e779801c42b7d17a65a4cc18f7c73ba3954309939825e7ad8ef34070","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:10.037242Z","signature_b64":"0ibY7KizAcLO+mNrwy7JNNvFrBBgtRp916G1RBY6yqcVUJ8Yl5VVjWrJS+yU+ozXS+uH7cXfoJy2ZELziEmBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2498e88e779801c42b7d17a65a4cc18f7c73ba3954309939825e7ad8ef34070","last_reissued_at":"2026-05-18T01:44:10.036603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:10.036603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05677","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ul6LRj4KTRxAtcIvAAtV1wHMOdPoBkhSVZWJ8q+CnsRU6zcLBn6h9ZzKRZtRqQ4IUfCL/uV/teBdtbsGdWjpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:00:13.640632Z"},"content_sha256":"ec2493ff30dbfd5ad0b118f9108acfea8a890374f1cc2a8ff61e069165c1d409","schema_version":"1.0","event_id":"sha256:ec2493ff30dbfd5ad0b118f9108acfea8a890374f1cc2a8ff61e069165c1d409"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4JEY5CHHPGABYQVX2F5GLJGMDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blocking optimal arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Attila Bern\\'ath, Gyula Pap","submitted_at":"2015-06-18T13:51:29Z","abstract_excerpt":"The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time: given a digraph $D=(V,A)$ with a designated root node $r\\in V$ and arc-costs $c:A\\to \\mathbb{R}$, find a minimum cardinality subset $H$ of the arc set $A$ such that $H$ intersects every minimum $c$-cost $r$-arborescence. By an $r$-arborescence we mean a spanning arborescence of root $r$. The algorithm we give solves a weighted version as well, in which a nonneg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05677","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:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uL1twrI1clIA6laB8vPEonc6tWW9DbWfwzhOJkhJjMnmGUDO6ilvu7fZYj4l9F4XuVOg7XMTc7M+AlBKbCwdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:00:13.640978Z"},"content_sha256":"d6d032d84f3c269f39bef3c687ab8d4c101b31c50fbcc4df96d0002c923800c2","schema_version":"1.0","event_id":"sha256:d6d032d84f3c269f39bef3c687ab8d4c101b31c50fbcc4df96d0002c923800c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/bundle.json","state_url":"https://pith.science/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/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-02T18:00:13Z","links":{"resolver":"https://pith.science/pith/4JEY5CHHPGABYQVX2F5GLJGMDD","bundle":"https://pith.science/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/bundle.json","state":"https://pith.science/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JEY5CHHPGABYQVX2F5GLJGMDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4JEY5CHHPGABYQVX2F5GLJGMDD","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":"4ab68429e23b2b3df4d4cfd50879d252a9275b227eeb23a854749136c6c4ed7f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-18T13:51:29Z","title_canon_sha256":"25278567b5bf7bea11fde05103558ba7f00ee4f553d2b87ebbd0a31ea72855bb"},"schema_version":"1.0","source":{"id":"1506.05677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05677","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05677v1","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05677","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"4JEY5CHHPGAB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JEY5CHHPGABYQVX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JEY5CHH","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:d6d032d84f3c269f39bef3c687ab8d4c101b31c50fbcc4df96d0002c923800c2","target":"graph","created_at":"2026-05-18T01:44:10Z","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":"The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time: given a digraph $D=(V,A)$ with a designated root node $r\\in V$ and arc-costs $c:A\\to \\mathbb{R}$, find a minimum cardinality subset $H$ of the arc set $A$ such that $H$ intersects every minimum $c$-cost $r$-arborescence. By an $r$-arborescence we mean a spanning arborescence of root $r$. The algorithm we give solves a weighted version as well, in which a nonneg","authors_text":"Attila Bern\\'ath, Gyula Pap","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-18T13:51:29Z","title":"Blocking optimal arborescences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05677","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:ec2493ff30dbfd5ad0b118f9108acfea8a890374f1cc2a8ff61e069165c1d409","target":"record","created_at":"2026-05-18T01:44:10Z","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":"4ab68429e23b2b3df4d4cfd50879d252a9275b227eeb23a854749136c6c4ed7f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-18T13:51:29Z","title_canon_sha256":"25278567b5bf7bea11fde05103558ba7f00ee4f553d2b87ebbd0a31ea72855bb"},"schema_version":"1.0","source":{"id":"1506.05677","kind":"arxiv","version":1}},"canonical_sha256":"e2498e88e779801c42b7d17a65a4cc18f7c73ba3954309939825e7ad8ef34070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2498e88e779801c42b7d17a65a4cc18f7c73ba3954309939825e7ad8ef34070","first_computed_at":"2026-05-18T01:44:10.036603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:10.036603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ibY7KizAcLO+mNrwy7JNNvFrBBgtRp916G1RBY6yqcVUJ8Yl5VVjWrJS+yU+ozXS+uH7cXfoJy2ZELziEmBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:10.037242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec2493ff30dbfd5ad0b118f9108acfea8a890374f1cc2a8ff61e069165c1d409","sha256:d6d032d84f3c269f39bef3c687ab8d4c101b31c50fbcc4df96d0002c923800c2"],"state_sha256":"02724a37991dba4190ac83838e57421145fc5cf4515d1cc22e3340abd56b7873"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5qil/QHLM64Ezp5sKK2rNGk0aM38PgWVqmAYl1g7DEmbnrM+lvANKaDOVrzlvNEAAa/atNh0PZhw6+Ssy0cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:00:13.642925Z","bundle_sha256":"6c39aa744ba3153e2fdc8eb7535a1f204ca0231bc1d32c4ef253042afbf262c3"}}