{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y4DB4F5ETN2RPCSTZ7QH5XCQXS","short_pith_number":"pith:Y4DB4F5E","canonical_record":{"source":{"id":"1104.3677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T08:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"14b6ce4f7ecb74a8d2c0a38290bd0b626edcaef06b11709417841b7e9b1c7e01","abstract_canon_sha256":"1a2a4d13e6db108fef2035d90f2719b001ba60705af8f2bc10d01ba5f245139b"},"schema_version":"1.0"},"canonical_sha256":"c7061e17a49b75178a53cfe07edc50bca66cd4b550b0b2fbd27ec659d3abc536","source":{"kind":"arxiv","id":"1104.3677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3677","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3677v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3677","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"Y4DB4F5ETN2R","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y4DB4F5ETN2RPCST","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y4DB4F5E","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y4DB4F5ETN2RPCSTZ7QH5XCQXS","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T08:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"14b6ce4f7ecb74a8d2c0a38290bd0b626edcaef06b11709417841b7e9b1c7e01","abstract_canon_sha256":"1a2a4d13e6db108fef2035d90f2719b001ba60705af8f2bc10d01ba5f245139b"},"schema_version":"1.0"},"canonical_sha256":"c7061e17a49b75178a53cfe07edc50bca66cd4b550b0b2fbd27ec659d3abc536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.834534Z","signature_b64":"hCL/fFxLXoKDFppDQ2MGCFxy/Q0/XbgAIAOB9eL3JXLxu+maRBYe2wPdbOlpSaDNdZOfbae6XMRcGkChkjHQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7061e17a49b75178a53cfe07edc50bca66cd4b550b0b2fbd27ec659d3abc536","last_reissued_at":"2026-05-18T04:23:55.834001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.834001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3677","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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eW670PSydLPJ3j8vDKDLA/lr4pY89IaaX8+kpDhxAdJTv56xlt02/52n9nPUOLYjxzQs47X1y7hqh6uUFTEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:26:42.541618Z"},"content_sha256":"79583e34780c291156fb8b1087a952c6ab0a607a0d11347842f12062e903f85a","schema_version":"1.0","event_id":"sha256:79583e34780c291156fb8b1087a952c6ab0a607a0d11347842f12062e903f85a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y4DB4F5ETN2RPCSTZ7QH5XCQXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contracting Graphs to Paths and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin L\\'ev\\^eque, Christophe Paul, Daniel Lokshtanov, Pim van 't Hof, Pinar Heggernes","submitted_at":"2011-04-19T08:49:35Z","abstract_excerpt":"Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and Chordal Deletion. Interestingly, the study of edge contraction problems of this type from a parameterized perspective has so far been left largely unexplored. We consider two basic edge contraction problems, which we call Path-Contractibility and Tree-Contractibility. Both problems take an undirected graph $G$ and an integer $k$ as input, and the task is to determine whether we can obtain a path or an acyclic graph,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3677","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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PEnkDxzaSePa6I+qq0FWW0WGHV68pkQU3IQDVEqgaIodv64INhA4YEy7brqMvaeH7WU7JDCFYbiFpa1FZkrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:26:42.542243Z"},"content_sha256":"d89144977a5810090515fc637c7af05a12e8eb21d14d1b6b46093a07f38bb375","schema_version":"1.0","event_id":"sha256:d89144977a5810090515fc637c7af05a12e8eb21d14d1b6b46093a07f38bb375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/bundle.json","state_url":"https://pith.science/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/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-29T22:26:42Z","links":{"resolver":"https://pith.science/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS","bundle":"https://pith.science/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/bundle.json","state":"https://pith.science/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4DB4F5ETN2RPCSTZ7QH5XCQXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y4DB4F5ETN2RPCSTZ7QH5XCQXS","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":"1a2a4d13e6db108fef2035d90f2719b001ba60705af8f2bc10d01ba5f245139b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T08:49:35Z","title_canon_sha256":"14b6ce4f7ecb74a8d2c0a38290bd0b626edcaef06b11709417841b7e9b1c7e01"},"schema_version":"1.0","source":{"id":"1104.3677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3677","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3677v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3677","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"Y4DB4F5ETN2R","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y4DB4F5ETN2RPCST","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y4DB4F5E","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:d89144977a5810090515fc637c7af05a12e8eb21d14d1b6b46093a07f38bb375","target":"graph","created_at":"2026-05-18T04:23:55Z","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":"Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and Chordal Deletion. Interestingly, the study of edge contraction problems of this type from a parameterized perspective has so far been left largely unexplored. We consider two basic edge contraction problems, which we call Path-Contractibility and Tree-Contractibility. Both problems take an undirected graph $G$ and an integer $k$ as input, and the task is to determine whether we can obtain a path or an acyclic graph,","authors_text":"Benjamin L\\'ev\\^eque, Christophe Paul, Daniel Lokshtanov, Pim van 't Hof, Pinar Heggernes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T08:49:35Z","title":"Contracting Graphs to Paths and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3677","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:79583e34780c291156fb8b1087a952c6ab0a607a0d11347842f12062e903f85a","target":"record","created_at":"2026-05-18T04:23:55Z","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":"1a2a4d13e6db108fef2035d90f2719b001ba60705af8f2bc10d01ba5f245139b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T08:49:35Z","title_canon_sha256":"14b6ce4f7ecb74a8d2c0a38290bd0b626edcaef06b11709417841b7e9b1c7e01"},"schema_version":"1.0","source":{"id":"1104.3677","kind":"arxiv","version":1}},"canonical_sha256":"c7061e17a49b75178a53cfe07edc50bca66cd4b550b0b2fbd27ec659d3abc536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7061e17a49b75178a53cfe07edc50bca66cd4b550b0b2fbd27ec659d3abc536","first_computed_at":"2026-05-18T04:23:55.834001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:55.834001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCL/fFxLXoKDFppDQ2MGCFxy/Q0/XbgAIAOB9eL3JXLxu+maRBYe2wPdbOlpSaDNdZOfbae6XMRcGkChkjHQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:55.834534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79583e34780c291156fb8b1087a952c6ab0a607a0d11347842f12062e903f85a","sha256:d89144977a5810090515fc637c7af05a12e8eb21d14d1b6b46093a07f38bb375"],"state_sha256":"981818a2bb86148ed62d20d0ce5704308c9413ad5d8f8efabd7807ca76cb1dae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dp0Av/v5MoQeFU3bHbnGEYVSBevBXEDUF1XNGBd2pHIID6kx/YBv8YYtMUVlyUsoBp2bU/CxttIKfGVXf+aDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:26:42.545652Z","bundle_sha256":"d829101bf6eb7b243c8de263d7b1aa89a99d5a4db7b4c14ff9dec8863e7596b9"}}