{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R7WNXHMM57N4QECW226LHVM7QR","short_pith_number":"pith:R7WNXHMM","canonical_record":{"source":{"id":"1411.5849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"b33369f55d5dccaa032e6bb6dcf3bc5d2f05e77e493bd4af72ca5b97f55a9916","abstract_canon_sha256":"3ed4e1119df5ef2b462fb075f29a77abbf743ee2c7a083002b6427901153d325"},"schema_version":"1.0"},"canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","source":{"kind":"arxiv","id":"1411.5849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5849","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5849v1","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5849","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"R7WNXHMM57N4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7WNXHMM57N4QECW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7WNXHMM","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R7WNXHMM57N4QECW226LHVM7QR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.5849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"b33369f55d5dccaa032e6bb6dcf3bc5d2f05e77e493bd4af72ca5b97f55a9916","abstract_canon_sha256":"3ed4e1119df5ef2b462fb075f29a77abbf743ee2c7a083002b6427901153d325"},"schema_version":"1.0"},"canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:02.092353Z","signature_b64":"Gy4u+DghPld9E6e3jXVfC/rz4bC0tnPO+Nw/5lPe+Fo7srUZpEf5zj6EUbONal1H2J1wc+8jYtOMtSQORlAhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","last_reissued_at":"2026-05-18T02:33:02.091788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:02.091788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.5849","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-18T02:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTB4/zwCgihe7kLflYjwkKq2rtZxIK1rY+N9nmIa0s2P060liVaT+mJM6H2RmBgEs8gTiYZudKeJSOk6EbsHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:38:56.999991Z"},"content_sha256":"3c991f1287fee19229801812beaf7eb0c5a78361dec80c46b44157e093fafdd9","schema_version":"1.0","event_id":"sha256:3c991f1287fee19229801812beaf7eb0c5a78361dec80c46b44157e093fafdd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R7WNXHMM57N4QECW226LHVM7QR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sigve Hortemo S{\\ae}ther","submitted_at":"2014-11-21T12:50:23Z","abstract_excerpt":"Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. S{\\ae}ther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which lies between treewidth and clique-width in terms of generality. They show that even though graphs of restricted split-matching-width might be dense, solving problems such as Hamiltonian Cycle can be d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5849","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-18T02:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mdmsj8+U7Ot9CABf6zZIa4n3AdLf5WdmQohrLHrtd9Y/HDTLSHByXlO2II2Er95d8lYL7WVlU+J/vktKScxyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:38:57.000691Z"},"content_sha256":"0eae63dc13bde9f47065832420eb331b5a3540e3c33539e1a640a2cd8f33e65e","schema_version":"1.0","event_id":"sha256:0eae63dc13bde9f47065832420eb331b5a3540e3c33539e1a640a2cd8f33e65e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/bundle.json","state_url":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7WNXHMM57N4QECW226LHVM7QR/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-09T08:38:57Z","links":{"resolver":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR","bundle":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/bundle.json","state":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7WNXHMM57N4QECW226LHVM7QR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R7WNXHMM57N4QECW226LHVM7QR","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":"3ed4e1119df5ef2b462fb075f29a77abbf743ee2c7a083002b6427901153d325","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","title_canon_sha256":"b33369f55d5dccaa032e6bb6dcf3bc5d2f05e77e493bd4af72ca5b97f55a9916"},"schema_version":"1.0","source":{"id":"1411.5849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5849","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5849v1","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5849","created_at":"2026-05-18T02:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"R7WNXHMM57N4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7WNXHMM57N4QECW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7WNXHMM","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:0eae63dc13bde9f47065832420eb331b5a3540e3c33539e1a640a2cd8f33e65e","target":"graph","created_at":"2026-05-18T02:33:02Z","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":"Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. S{\\ae}ther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which lies between treewidth and clique-width in terms of generality. They show that even though graphs of restricted split-matching-width might be dense, solving problems such as Hamiltonian Cycle can be d","authors_text":"Sigve Hortemo S{\\ae}ther","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","title":"Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5849","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:3c991f1287fee19229801812beaf7eb0c5a78361dec80c46b44157e093fafdd9","target":"record","created_at":"2026-05-18T02:33:02Z","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":"3ed4e1119df5ef2b462fb075f29a77abbf743ee2c7a083002b6427901153d325","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","title_canon_sha256":"b33369f55d5dccaa032e6bb6dcf3bc5d2f05e77e493bd4af72ca5b97f55a9916"},"schema_version":"1.0","source":{"id":"1411.5849","kind":"arxiv","version":1}},"canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","first_computed_at":"2026-05-18T02:33:02.091788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:02.091788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gy4u+DghPld9E6e3jXVfC/rz4bC0tnPO+Nw/5lPe+Fo7srUZpEf5zj6EUbONal1H2J1wc+8jYtOMtSQORlAhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:02.092353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c991f1287fee19229801812beaf7eb0c5a78361dec80c46b44157e093fafdd9","sha256:0eae63dc13bde9f47065832420eb331b5a3540e3c33539e1a640a2cd8f33e65e"],"state_sha256":"4c72c94e1f484f24e2fdb863fb239e87fb91425f8c2baa68f97cd8165d7097e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIlyHD28SUVpHVMMQA3hpvUFcUn9eadQ6X4YFHhMhoK0p9nt6UGtLRVeD5qhXgfSCXjYBsuy+c8yqEJl1fmIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:38:57.006735Z","bundle_sha256":"35a4af5a5240eba739fe18e447844ee804f19331d81a2eb6a53264176571ff68"}}