{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A6N4POTYLWSTWTAYKWXUVUEKZP","short_pith_number":"pith:A6N4POTY","schema_version":"1.0","canonical_sha256":"079bc7ba785da53b4c1855af4ad08acbf8c6ec4240d1734813b7238a109f6c98","source":{"kind":"arxiv","id":"1706.03750","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03750","created_at":"2026-05-18T00:42:33.844053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03750v1","created_at":"2026-05-18T00:42:33.844053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03750","created_at":"2026-05-18T00:42:33.844053+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6N4POTYLWST","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6N4POTYLWSTWTAY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6N4POTY","created_at":"2026-05-18T12:31:05.417338+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/A6N4POTYLWSTWTAYKWXUVUEKZP","json":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP.json","graph_json":"https://pith.science/api/pith-number/A6N4POTYLWSTWTAYKWXUVUEKZP/graph.json","events_json":"https://pith.science/api/pith-number/A6N4POTYLWSTWTAYKWXUVUEKZP/events.json","paper":"https://pith.science/paper/A6N4POTY"},"agent_actions":{"view_html":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP","download_json":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP.json","view_paper":"https://pith.science/paper/A6N4POTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03750&json=true","fetch_graph":"https://pith.science/api/pith-number/A6N4POTYLWSTWTAYKWXUVUEKZP/graph.json","fetch_events":"https://pith.science/api/pith-number/A6N4POTYLWSTWTAYKWXUVUEKZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/action/storage_attestation","attest_author":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/action/author_attestation","sign_citation":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/action/citation_signature","submit_replication":"https://pith.science/pith/A6N4POTYLWSTWTAYKWXUVUEKZP/action/replication_record"}},"created_at":"2026-05-18T00:42:33.844053+00:00","updated_at":"2026-05-18T00:42:33.844053+00:00"}