{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DSQ7AVJYQNGTIUACO3TBJVOPSS","short_pith_number":"pith:DSQ7AVJY","canonical_record":{"source":{"id":"1412.3955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T11:43:40Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"d92a9b87ec7a8b1795d11689e227ae0c94bfb2445662cbaab35849927fd85b1e","abstract_canon_sha256":"6c41a540d27f158100ad19762a256acaffe2bd24118153110daf13929ac56316"},"schema_version":"1.0"},"canonical_sha256":"1ca1f05538834d34500276e614d5cf94ac505e94e0315f7e05f399db7589766e","source":{"kind":"arxiv","id":"1412.3955","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3955","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3955v2","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3955","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"pith_short_12","alias_value":"DSQ7AVJYQNGT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DSQ7AVJYQNGTIUAC","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DSQ7AVJY","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DSQ7AVJYQNGTIUACO3TBJVOPSS","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T11:43:40Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"d92a9b87ec7a8b1795d11689e227ae0c94bfb2445662cbaab35849927fd85b1e","abstract_canon_sha256":"6c41a540d27f158100ad19762a256acaffe2bd24118153110daf13929ac56316"},"schema_version":"1.0"},"canonical_sha256":"1ca1f05538834d34500276e614d5cf94ac505e94e0315f7e05f399db7589766e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:08.307473Z","signature_b64":"cN6q0xp7xemmhsun5CskOJGMZm63CCwsgGlIBm3y41BpY9CG+kdBpsfV59cSjmaTk0gIFn9IKofGG43QYCsNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ca1f05538834d34500276e614d5cf94ac505e94e0315f7e05f399db7589766e","last_reissued_at":"2026-05-18T01:22:08.306786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:08.306786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3955","source_version":2,"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-18T01:22:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZxV1Z8tRbuF6NZUSrgUw9MVglfE/u5NiSE0wjThiWyYmcYAtQ+ZeseHtVmRy8Y3e9R1InLiCaAEpsIYVEScDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:16.777907Z"},"content_sha256":"8e6224e4f20360a3dfad633cb1e0c7373a72e3eeaae7df339350078b150b99d2","schema_version":"1.0","event_id":"sha256:8e6224e4f20360a3dfad633cb1e0c7373a72e3eeaae7df339350078b150b99d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DSQ7AVJYQNGTIUACO3TBJVOPSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Graph Cyclability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Marcin Kami\\'nski, Petr A. Golovach, Spyridon Maniatis","submitted_at":"2014-12-12T11:43:40Z","abstract_excerpt":"The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\\sf NP}-hard. We study the parametrized complexity of this problem. We prove that this problem, parameterized by $k,$ is ${\\sf co\\mbox{-}W[1]}$-hard and that its does not admit a polynomial kernel on planar graphs, unless ${\\sf NP}\\subseteq{\\sf co}\\mbox{-}{\\sf NP}/{\\sf poly}$. On the positive side, we give an {\\sf FPT} algorithm for planar graphs tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3955","kind":"arxiv","version":2},"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-18T01:22:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+M80c8Vu5Ti6gqGurPqGtYUGHHua8u+feKAkyNSQwqsfU++DbTIqREB0uudpnkeln7fe/IbM+0Z4oVt8w8hRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:16.778301Z"},"content_sha256":"d0b11c0170c9c7d9992c724ec84202ba4c8e798c77570edd4b998a3e9353b84b","schema_version":"1.0","event_id":"sha256:d0b11c0170c9c7d9992c724ec84202ba4c8e798c77570edd4b998a3e9353b84b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/bundle.json","state_url":"https://pith.science/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/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-25T17:01:16Z","links":{"resolver":"https://pith.science/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS","bundle":"https://pith.science/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/bundle.json","state":"https://pith.science/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSQ7AVJYQNGTIUACO3TBJVOPSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DSQ7AVJYQNGTIUACO3TBJVOPSS","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":"6c41a540d27f158100ad19762a256acaffe2bd24118153110daf13929ac56316","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T11:43:40Z","title_canon_sha256":"d92a9b87ec7a8b1795d11689e227ae0c94bfb2445662cbaab35849927fd85b1e"},"schema_version":"1.0","source":{"id":"1412.3955","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3955","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3955v2","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3955","created_at":"2026-05-18T01:22:08Z"},{"alias_kind":"pith_short_12","alias_value":"DSQ7AVJYQNGT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DSQ7AVJYQNGTIUAC","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DSQ7AVJY","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:d0b11c0170c9c7d9992c724ec84202ba4c8e798c77570edd4b998a3e9353b84b","target":"graph","created_at":"2026-05-18T01:22:08Z","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":"The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\\sf NP}-hard. We study the parametrized complexity of this problem. We prove that this problem, parameterized by $k,$ is ${\\sf co\\mbox{-}W[1]}$-hard and that its does not admit a polynomial kernel on planar graphs, unless ${\\sf NP}\\subseteq{\\sf co}\\mbox{-}{\\sf NP}/{\\sf poly}$. On the positive side, we give an {\\sf FPT} algorithm for planar graphs tha","authors_text":"Dimitrios M. Thilikos, Marcin Kami\\'nski, Petr A. Golovach, Spyridon Maniatis","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T11:43:40Z","title":"The Parameterized Complexity of Graph Cyclability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3955","kind":"arxiv","version":2},"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:8e6224e4f20360a3dfad633cb1e0c7373a72e3eeaae7df339350078b150b99d2","target":"record","created_at":"2026-05-18T01:22:08Z","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":"6c41a540d27f158100ad19762a256acaffe2bd24118153110daf13929ac56316","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-12T11:43:40Z","title_canon_sha256":"d92a9b87ec7a8b1795d11689e227ae0c94bfb2445662cbaab35849927fd85b1e"},"schema_version":"1.0","source":{"id":"1412.3955","kind":"arxiv","version":2}},"canonical_sha256":"1ca1f05538834d34500276e614d5cf94ac505e94e0315f7e05f399db7589766e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ca1f05538834d34500276e614d5cf94ac505e94e0315f7e05f399db7589766e","first_computed_at":"2026-05-18T01:22:08.306786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:08.306786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cN6q0xp7xemmhsun5CskOJGMZm63CCwsgGlIBm3y41BpY9CG+kdBpsfV59cSjmaTk0gIFn9IKofGG43QYCsNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:08.307473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3955","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e6224e4f20360a3dfad633cb1e0c7373a72e3eeaae7df339350078b150b99d2","sha256:d0b11c0170c9c7d9992c724ec84202ba4c8e798c77570edd4b998a3e9353b84b"],"state_sha256":"fe9d1da3f9b21187246854fa57137c88eea692818b6e98dcb42eb6532874e018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1/YDv4ioLw00PYmq+A1E8r2FkrFVV59MOW6rcVOOaXaMRswz+3lT1ovHZCszZwTPuJcZZijSQREL73b+6GSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:01:16.781695Z","bundle_sha256":"1c5231f6824c3f82c22807c01c4a894b957649962623865af33916b624391e80"}}