{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1995:26BMCBWBGNPA67GJJ3BGCOA4CG","short_pith_number":"pith:26BMCBWB","canonical_record":{"source":{"id":"math/9502226","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1995-02-14T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"60eff30c7c5c8aac5e44cb35791070d064e0f945fc021ae3b798f851a035aa2e","abstract_canon_sha256":"f3329f11dbf09bf1e97cb08ffaee900314559801d196c347777235e79e532a8f"},"schema_version":"1.0"},"canonical_sha256":"d782c106c1335e0f7cc94ec261381c11b52719baf37bed83a1ce8ff41af78203","source":{"kind":"arxiv","id":"math/9502226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9502226","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9502226v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9502226","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"26BMCBWBGNPA","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"26BMCBWBGNPA67GJ","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"26BMCBWB","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1995:26BMCBWBGNPA67GJJ3BGCOA4CG","target":"record","payload":{"canonical_record":{"source":{"id":"math/9502226","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1995-02-14T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"60eff30c7c5c8aac5e44cb35791070d064e0f945fc021ae3b798f851a035aa2e","abstract_canon_sha256":"f3329f11dbf09bf1e97cb08ffaee900314559801d196c347777235e79e532a8f"},"schema_version":"1.0"},"canonical_sha256":"d782c106c1335e0f7cc94ec261381c11b52719baf37bed83a1ce8ff41af78203","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.465052Z","signature_b64":"K8xMAWi9EFKy/B3fdZnW9g2+JVtFDavGt4cpsJeVLzQxfAm7/ncHWykwTDgeYSsrFxec6avwjdWCUW0unYbnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d782c106c1335e0f7cc94ec261381c11b52719baf37bed83a1ce8ff41af78203","last_reissued_at":"2026-05-18T01:05:50.464594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.464594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/9502226","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHA+Y6Yc7OqdWNieBJZr21MJxlJEi7ZuJjdA7IUAi4uCTNGNSlSjCvaUbRnUDfbnAvOW/QxLRBilf2beX416Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:23:33.395362Z"},"content_sha256":"7be48a33e11233f93cbecbc23502dd6654763648a074830c51b3cc98856d342d","schema_version":"1.0","event_id":"sha256:7be48a33e11233f93cbecbc23502dd6654763648a074830c51b3cc98856d342d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1995:26BMCBWBGNPA67GJJ3BGCOA4CG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstructions to within a few vertices or edges of acyclic","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kevin Cattell, Michael J. Dinneen, Michael R. Fellows","submitted_at":"1995-02-14T00:00:00Z","abstract_excerpt":"Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for finding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approach by characterizing certain families of cycle-cover graphs based on the two well-known problems: $k$-{\\sc Feedback Vertex Set} and $k$-{\\sc Feedback Edge Set}. Our search is based on a number of algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9502226","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvDZQ9mbTq5aGNSgf1z+AnR0IqCJor3n5wprLjn79/8XBN9RDDnrXWVmugi2++Mfkg0KTWr3XwTo93zjbs2EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:23:33.395998Z"},"content_sha256":"cc9a3d1e230fe6cd30ba634c24187fc3e93fd61d920544cb0a51a93a8e7e041f","schema_version":"1.0","event_id":"sha256:cc9a3d1e230fe6cd30ba634c24187fc3e93fd61d920544cb0a51a93a8e7e041f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/bundle.json","state_url":"https://pith.science/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/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-09T01:23:33Z","links":{"resolver":"https://pith.science/pith/26BMCBWBGNPA67GJJ3BGCOA4CG","bundle":"https://pith.science/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/bundle.json","state":"https://pith.science/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26BMCBWBGNPA67GJJ3BGCOA4CG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:26BMCBWBGNPA67GJJ3BGCOA4CG","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":"f3329f11dbf09bf1e97cb08ffaee900314559801d196c347777235e79e532a8f","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1995-02-14T00:00:00Z","title_canon_sha256":"60eff30c7c5c8aac5e44cb35791070d064e0f945fc021ae3b798f851a035aa2e"},"schema_version":"1.0","source":{"id":"math/9502226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9502226","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9502226v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9502226","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"26BMCBWBGNPA","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"26BMCBWBGNPA67GJ","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"26BMCBWB","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:cc9a3d1e230fe6cd30ba634c24187fc3e93fd61d920544cb0a51a93a8e7e041f","target":"graph","created_at":"2026-05-18T01:05:50Z","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":"Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for finding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approach by characterizing certain families of cycle-cover graphs based on the two well-known problems: $k$-{\\sc Feedback Vertex Set} and $k$-{\\sc Feedback Edge Set}. Our search is based on a number of algor","authors_text":"Kevin Cattell, Michael J. Dinneen, Michael R. Fellows","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1995-02-14T00:00:00Z","title":"Obstructions to within a few vertices or edges of acyclic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9502226","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:7be48a33e11233f93cbecbc23502dd6654763648a074830c51b3cc98856d342d","target":"record","created_at":"2026-05-18T01:05:50Z","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":"f3329f11dbf09bf1e97cb08ffaee900314559801d196c347777235e79e532a8f","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1995-02-14T00:00:00Z","title_canon_sha256":"60eff30c7c5c8aac5e44cb35791070d064e0f945fc021ae3b798f851a035aa2e"},"schema_version":"1.0","source":{"id":"math/9502226","kind":"arxiv","version":1}},"canonical_sha256":"d782c106c1335e0f7cc94ec261381c11b52719baf37bed83a1ce8ff41af78203","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d782c106c1335e0f7cc94ec261381c11b52719baf37bed83a1ce8ff41af78203","first_computed_at":"2026-05-18T01:05:50.464594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:50.464594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8xMAWi9EFKy/B3fdZnW9g2+JVtFDavGt4cpsJeVLzQxfAm7/ncHWykwTDgeYSsrFxec6avwjdWCUW0unYbnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:50.465052Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9502226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7be48a33e11233f93cbecbc23502dd6654763648a074830c51b3cc98856d342d","sha256:cc9a3d1e230fe6cd30ba634c24187fc3e93fd61d920544cb0a51a93a8e7e041f"],"state_sha256":"445400dc6b773cb53810578e8c8fea3c6826d0040ac911d4fdfa7e7b006421c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZAVChiaMEO2lrLN6QzFwgAu0KlQc4lyBbOVD9JDQHqo1ebuq1sXIudBsTLj85OgzCWkvsUwhkyAgkTorgwKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:23:33.399632Z","bundle_sha256":"d4e218c3a96a608e77259f1cde5dd38a6092463e85911150f8b9b15f3be8042b"}}