{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OGLXKJ3CZTPQMAK76XPGX23Z2F","short_pith_number":"pith:OGLXKJ3C","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"},"canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","source":{"kind":"arxiv","id":"1810.01542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01542","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01542v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01542","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"OGLXKJ3CZTPQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGLXKJ3CZTPQMAK7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGLXKJ3C","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OGLXKJ3CZTPQMAK76XPGX23Z2F","target":"record","payload":{"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"},"canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","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"},"source_kind":"arxiv","source_id":"1810.01542","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:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoEdDKWXWP+tJsiU/1W7CJghZbxgMYOU+6KxHILPjWWIuCToMKL4elFo1OUUTbEzTz2ybdRqfNlA2jQ8TyN1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:59.595658Z"},"content_sha256":"169c54de5c0463fb15df11958228cac1f0ddf705cef05c42c758e5ea9a6954a5","schema_version":"1.0","event_id":"sha256:169c54de5c0463fb15df11958228cac1f0ddf705cef05c42c758e5ea9a6954a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OGLXKJ3CZTPQMAK76XPGX23Z2F","target":"graph","payload":{"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"},"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:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D40NNmphCdQLnUcOK6jXX8WKupoB8u3CupRxDAbE9u6nKfDIHgjOl8vH0HsL/VspxDw8uVAZa36Br8VRCenYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:23:59.596031Z"},"content_sha256":"99edf10ddf113087282652513dc2ac0e386909141a9f4fcf5823109e995315e4","schema_version":"1.0","event_id":"sha256:99edf10ddf113087282652513dc2ac0e386909141a9f4fcf5823109e995315e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/bundle.json","state_url":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/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-05-25T13:23:59Z","links":{"resolver":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F","bundle":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/bundle.json","state":"https://pith.science/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGLXKJ3CZTPQMAK76XPGX23Z2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OGLXKJ3CZTPQMAK76XPGX23Z2F","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":"da1ea88c2872e816d58f22b73d69a730976d012bc3d14849eddc2eff564638df","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T23:45:12Z","title_canon_sha256":"7df90fb359af29c5102fc2cda68618815a8b6195996612b8ab8da99478c4c260"},"schema_version":"1.0","source":{"id":"1810.01542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01542","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01542v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01542","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"OGLXKJ3CZTPQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGLXKJ3CZTPQMAK7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGLXKJ3C","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:99edf10ddf113087282652513dc2ac0e386909141a9f4fcf5823109e995315e4","target":"graph","created_at":"2026-05-18T00:04:11Z","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":"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.","authors_text":"Daniel Paulusma, Walter Kern","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T23:45:12Z","title":"Contracting to a Longest Path in H-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01542","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:169c54de5c0463fb15df11958228cac1f0ddf705cef05c42c758e5ea9a6954a5","target":"record","created_at":"2026-05-18T00:04:11Z","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":"da1ea88c2872e816d58f22b73d69a730976d012bc3d14849eddc2eff564638df","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T23:45:12Z","title_canon_sha256":"7df90fb359af29c5102fc2cda68618815a8b6195996612b8ab8da99478c4c260"},"schema_version":"1.0","source":{"id":"1810.01542","kind":"arxiv","version":1}},"canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7197752762ccdf06015ff5de6beb79d14fedd3e4cc567bc7dadbb494c751e0e1","first_computed_at":"2026-05-18T00:04:11.807848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:11.807848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YA2afHp0gk3AXHlXd/cK0mO7RUqkp9zo/1I5kyf3fPqjezftd5nBI9HgxmGvOAr3FR4M7vcAQNc7InIsMZFTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:11.808539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:169c54de5c0463fb15df11958228cac1f0ddf705cef05c42c758e5ea9a6954a5","sha256:99edf10ddf113087282652513dc2ac0e386909141a9f4fcf5823109e995315e4"],"state_sha256":"dbc4b7f4e5a889d2f9eb2f5c31817764717d3d65add0504b293a13c94304c32d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kp9AJPV8Nqm1hhSJ0gwPSyklusC6lMoT8d0EQVUjMqppLeMcsb5sIQGLP4NeGJ7MNsCJaZmQ30AcVklyAsSaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:23:59.598532Z","bundle_sha256":"8e999a8933ce53530db56700ea13c33ded9048d6c08fb38af1d2461bea7f9555"}}