{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OGLXKJ3CZTPQMAK76XPGX23Z2F","short_pith_number":"pith:OGLXKJ3C","schema_version":"1.0","canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","source":{"kind":"arxiv","id":"1810.01542","version":1},"attestation_state":"computed","paper":{"title":"Contracting to a Longest Path in H-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Walter Kern","submitted_at":"2018-10-02T23:45:12Z","abstract_excerpt":"We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph. The NP-hard problem Longest Path Contractibility is to determine the longest path to which a graph can be contracted to. By combining known results with new results we completely classify the computational complexity of both problems for $H$-free graphs. Our main focus is on the second problem, for which we design a general contractibility technique that enables us to reduce the problem to a matching problem."},"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":"1810.01542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T23:45:12Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"7df90fb359af29c5102fc2cda68618815a8b6195996612b8ab8da99478c4c260","abstract_canon_sha256":"da1ea88c2872e816d58f22b73d69a730976d012bc3d14849eddc2eff564638df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:11.808539Z","signature_b64":"YA2afHp0gk3AXHlXd/cK0mO7RUqkp9zo/1I5kyf3fPqjezftd5nBI9HgxmGvOAr3FR4M7vcAQNc7InIsMZFTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","last_reissued_at":"2026-05-18T00:04:11.807848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:11.807848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting to a Longest Path in H-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Walter Kern","submitted_at":"2018-10-02T23:45:12Z","abstract_excerpt":"We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph. The NP-hard problem Longest Path Contractibility is to determine the longest path to which a graph can be contracted to. By combining known results with new results we completely classify the computational complexity of both problems for $H$-free graphs. Our main focus is on the second problem, for which we design a general contractibility technique that enables us to reduce the problem to a matching problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01542","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":"1810.01542","created_at":"2026-05-18T00:04:11.807947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01542v1","created_at":"2026-05-18T00:04:11.807947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01542","created_at":"2026-05-18T00:04:11.807947+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGLXKJ3CZTPQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGLXKJ3CZTPQMAK7","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGLXKJ3C","created_at":"2026-05-18T12:32:43.782077+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/OGLXKJ3CZTPQMAK76XPGX23Z2F","json":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F.json","graph_json":"https://pith.science/api/pith-number/OGLXKJ3CZTPQMAK76XPGX23Z2F/graph.json","events_json":"https://pith.science/api/pith-number/OGLXKJ3CZTPQMAK76XPGX23Z2F/events.json","paper":"https://pith.science/paper/OGLXKJ3C"},"agent_actions":{"view_html":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F","download_json":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F.json","view_paper":"https://pith.science/paper/OGLXKJ3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01542&json=true","fetch_graph":"https://pith.science/api/pith-number/OGLXKJ3CZTPQMAK76XPGX23Z2F/graph.json","fetch_events":"https://pith.science/api/pith-number/OGLXKJ3CZTPQMAK76XPGX23Z2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/action/storage_attestation","attest_author":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/action/author_attestation","sign_citation":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/action/citation_signature","submit_replication":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/action/replication_record"}},"created_at":"2026-05-18T00:04:11.807947+00:00","updated_at":"2026-05-18T00:04:11.807947+00:00"}