{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A6N4POTYLWSTWTAYKWXUVUEKZP","short_pith_number":"pith:A6N4POTY","canonical_record":{"source":{"id":"1706.03750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-12T17:36:36Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"921e932bade48d6ce2c3c4ee164fa87f661b393cc9bff453120642ec29d0906d","abstract_canon_sha256":"e9da5e2bda1dd1db43880e582ec495ab5453625ced87294d50458d80dad3062a"},"schema_version":"1.0"},"canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","source":{"kind":"arxiv","id":"1706.03750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03750","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03750v1","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03750","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"A6N4POTYLWST","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6N4POTYLWSTWTAY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6N4POTY","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A6N4POTYLWSTWTAYKWXUVUEKZP","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-12T17:36:36Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"921e932bade48d6ce2c3c4ee164fa87f661b393cc9bff453120642ec29d0906d","abstract_canon_sha256":"e9da5e2bda1dd1db43880e582ec495ab5453625ced87294d50458d80dad3062a"},"schema_version":"1.0"},"canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.844566Z","signature_b64":"LLwOTMUNk4Bm96XkTfkMmnRx5oeU7ZU1+IWv7IzL+0HOH1rwUjDY1X0L3s5YTb54UuZsp/+XXeQORpTb5hVVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","last_reissued_at":"2026-05-18T00:42:33.843967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.843967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03750","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-18T00:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JohNF+32ZNQtYRIPPF3bW+Y5Z6j1kEcSGASeDrL46Yaw7XS97NeiVyv9vC8yV+lusIfOR1PMSahyDSVOPoP9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:56:02.190373Z"},"content_sha256":"aebc5852eacb0cc4ef8b8bed1b3721e6a9b8f95e6575ce0a6067606a79a105d0","schema_version":"1.0","event_id":"sha256:aebc5852eacb0cc4ef8b8bed1b3721e6a9b8f95e6575ce0a6067606a79a105d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A6N4POTYLWSTWTAYKWXUVUEKZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contracting Bipartite Graphs to Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski","submitted_at":"2017-06-12T17:36:36Z","abstract_excerpt":"Testing if a given graph $G$ contains the $k$-vertex path $P_k$ as a minor or as an induced minor is trivial for every fixed integer $k\\geq 1$. However, the situation changes for the problem of checking if a graph can be modified into $P_k$ by using only edge contractions. In this case the problem is known to be NP-complete even if $k=4$. This led to an intensive investigation for testing contractibility on restricted graph classes. We focus on bipartite graphs. Heggernes, van 't Hof, L\\'{e}v\\^{e}que and Paul proved that the problem stays NP-complete for bipartite graphs if $k=6$. We strengthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03750","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-18T00:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXIBvNqb/URMMp9/VQlNtnD746CDTe+jIvAgypRHrbwSkFdXrx6zKN4OmjWDxmFN9yWv6BGrQblEdW59KHXkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:56:02.190719Z"},"content_sha256":"debd8af3588e58bd30777c9e5dfdfbb42794504d9e2c5adfd15532b787be5c07","schema_version":"1.0","event_id":"sha256:debd8af3588e58bd30777c9e5dfdfbb42794504d9e2c5adfd15532b787be5c07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/bundle.json","state_url":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/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-29T21:56:02Z","links":{"resolver":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP","bundle":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/bundle.json","state":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A6N4POTYLWSTWTAYKWXUVUEKZP","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":"e9da5e2bda1dd1db43880e582ec495ab5453625ced87294d50458d80dad3062a","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-12T17:36:36Z","title_canon_sha256":"921e932bade48d6ce2c3c4ee164fa87f661b393cc9bff453120642ec29d0906d"},"schema_version":"1.0","source":{"id":"1706.03750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03750","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03750v1","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03750","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"A6N4POTYLWST","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6N4POTYLWSTWTAY","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6N4POTY","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:debd8af3588e58bd30777c9e5dfdfbb42794504d9e2c5adfd15532b787be5c07","target":"graph","created_at":"2026-05-18T00:42:33Z","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":"Testing if a given graph $G$ contains the $k$-vertex path $P_k$ as a minor or as an induced minor is trivial for every fixed integer $k\\geq 1$. However, the situation changes for the problem of checking if a graph can be modified into $P_k$ by using only edge contractions. In this case the problem is known to be NP-complete even if $k=4$. This led to an intensive investigation for testing contractibility on restricted graph classes. We focus on bipartite graphs. Heggernes, van 't Hof, L\\'{e}v\\^{e}que and Paul proved that the problem stays NP-complete for bipartite graphs if $k=6$. We strengthe","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-12T17:36:36Z","title":"Contracting Bipartite Graphs to Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03750","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:aebc5852eacb0cc4ef8b8bed1b3721e6a9b8f95e6575ce0a6067606a79a105d0","target":"record","created_at":"2026-05-18T00:42:33Z","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":"e9da5e2bda1dd1db43880e582ec495ab5453625ced87294d50458d80dad3062a","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-12T17:36:36Z","title_canon_sha256":"921e932bade48d6ce2c3c4ee164fa87f661b393cc9bff453120642ec29d0906d"},"schema_version":"1.0","source":{"id":"1706.03750","kind":"arxiv","version":1}},"canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","first_computed_at":"2026-05-18T00:42:33.843967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:33.843967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LLwOTMUNk4Bm96XkTfkMmnRx5oeU7ZU1+IWv7IzL+0HOH1rwUjDY1X0L3s5YTb54UuZsp/+XXeQORpTb5hVVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:33.844566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aebc5852eacb0cc4ef8b8bed1b3721e6a9b8f95e6575ce0a6067606a79a105d0","sha256:debd8af3588e58bd30777c9e5dfdfbb42794504d9e2c5adfd15532b787be5c07"],"state_sha256":"7daf71ba51c0142c878fa0f7ce4d3c84ee0d4115260923a1d156e410e6c136ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tt+BU8Y9dZQeEITZJMhvdqFBZ6+8OHxh7rQLw9lYWyE8BUGv0jxrvg70wdCtiPZwrU7n1QQhm2yshvKlvwx+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:56:02.192579Z","bundle_sha256":"06ff534b394c8d585e61a98afdb07df5e63ec8552b0d21ba2a306e82f4490593"}}