{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TLZ46I5J6XK32UKDUAFAZ3RTVQ","short_pith_number":"pith:TLZ46I5J","canonical_record":{"source":{"id":"1710.07601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T16:48:35Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"bf1ef8f70c3cd6eaf191b18b7ce525eb308e934b1db93ac059e89aa26dee8640","abstract_canon_sha256":"be56be8e266a66bc0357ca31675b70427c26cb688de000d24908b77df8a97c1b"},"schema_version":"1.0"},"canonical_sha256":"9af3cf23a9f5d5bd5143a00a0cee33ac0fc4fb7916fd1cb4356b524d9a79cb08","source":{"kind":"arxiv","id":"1710.07601","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07601","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07601v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07601","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLZ46I5J6XK3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLZ46I5J6XK32UKD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLZ46I5J","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TLZ46I5J6XK32UKDUAFAZ3RTVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T16:48:35Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"bf1ef8f70c3cd6eaf191b18b7ce525eb308e934b1db93ac059e89aa26dee8640","abstract_canon_sha256":"be56be8e266a66bc0357ca31675b70427c26cb688de000d24908b77df8a97c1b"},"schema_version":"1.0"},"canonical_sha256":"9af3cf23a9f5d5bd5143a00a0cee33ac0fc4fb7916fd1cb4356b524d9a79cb08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.537114Z","signature_b64":"VkdM+3QaAiBorzyDeUDv5ecmB+o0Olg9mgDTCapMJ8+H+18T87UFmsatAU3LxrRUUPAxSKuOyph5kO03NF2VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af3cf23a9f5d5bd5143a00a0cee33ac0fc4fb7916fd1cb4356b524d9a79cb08","last_reissued_at":"2026-05-18T00:02:45.536491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.536491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07601","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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR+g6sG1Q5BWhIIEwMVH6JdHvDNXH+h4nAJIdGHCgqVNtFi28EwfRlcCOwBABf+I4Hhc/JMNRnpJbcFZuvK5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:16:05.584738Z"},"content_sha256":"a47ec27e9497351de0ec4bf7da43bcfc59b664a0a4baa61e5320b61049a71336","schema_version":"1.0","event_id":"sha256:a47ec27e9497351de0ec4bf7da43bcfc59b664a0a4baa61e5320b61049a71336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TLZ46I5J6XK32UKDUAFAZ3RTVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kernelization Lower Bounds for Finding Constant-Size Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Till Fluschnik","submitted_at":"2017-10-20T16:48:35Z","abstract_excerpt":"Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced instance only depends on the parameter and not on the size of the original instance. In this paper, we provide a first conceptual study on limits of kernelization for several polynomial-time solvable problems. For instance, we consider the problem of finding a triangle with negative sum of edge weights parameterized by the maximum degree of the input graph. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07601","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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt92mi4gBvBWgh93cDQ6eNnKSDBVaaFE5PAxAGG9f4OsH+2cEoCWKD2Twpvv5ixPesFkNOwNTT4Psx+M3TUOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:16:05.585345Z"},"content_sha256":"dba233faf6b9c70c4ad68de4c8b4ca275f9bcd3b4d8c08d44538ee1c97d255d2","schema_version":"1.0","event_id":"sha256:dba233faf6b9c70c4ad68de4c8b4ca275f9bcd3b4d8c08d44538ee1c97d255d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/bundle.json","state_url":"https://pith.science/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/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-05T18:16:05Z","links":{"resolver":"https://pith.science/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ","bundle":"https://pith.science/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/bundle.json","state":"https://pith.science/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLZ46I5J6XK32UKDUAFAZ3RTVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TLZ46I5J6XK32UKDUAFAZ3RTVQ","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":"be56be8e266a66bc0357ca31675b70427c26cb688de000d24908b77df8a97c1b","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T16:48:35Z","title_canon_sha256":"bf1ef8f70c3cd6eaf191b18b7ce525eb308e934b1db93ac059e89aa26dee8640"},"schema_version":"1.0","source":{"id":"1710.07601","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07601","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07601v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07601","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLZ46I5J6XK3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLZ46I5J6XK32UKD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLZ46I5J","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:dba233faf6b9c70c4ad68de4c8b4ca275f9bcd3b4d8c08d44538ee1c97d255d2","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced instance only depends on the parameter and not on the size of the original instance. In this paper, we provide a first conceptual study on limits of kernelization for several polynomial-time solvable problems. For instance, we consider the problem of finding a triangle with negative sum of edge weights parameterized by the maximum degree of the input graph. We ","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Till Fluschnik","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T16:48:35Z","title":"Kernelization Lower Bounds for Finding Constant-Size Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07601","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:a47ec27e9497351de0ec4bf7da43bcfc59b664a0a4baa61e5320b61049a71336","target":"record","created_at":"2026-05-18T00:02:45Z","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":"be56be8e266a66bc0357ca31675b70427c26cb688de000d24908b77df8a97c1b","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T16:48:35Z","title_canon_sha256":"bf1ef8f70c3cd6eaf191b18b7ce525eb308e934b1db93ac059e89aa26dee8640"},"schema_version":"1.0","source":{"id":"1710.07601","kind":"arxiv","version":2}},"canonical_sha256":"9af3cf23a9f5d5bd5143a00a0cee33ac0fc4fb7916fd1cb4356b524d9a79cb08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9af3cf23a9f5d5bd5143a00a0cee33ac0fc4fb7916fd1cb4356b524d9a79cb08","first_computed_at":"2026-05-18T00:02:45.536491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.536491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VkdM+3QaAiBorzyDeUDv5ecmB+o0Olg9mgDTCapMJ8+H+18T87UFmsatAU3LxrRUUPAxSKuOyph5kO03NF2VBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.537114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07601","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a47ec27e9497351de0ec4bf7da43bcfc59b664a0a4baa61e5320b61049a71336","sha256:dba233faf6b9c70c4ad68de4c8b4ca275f9bcd3b4d8c08d44538ee1c97d255d2"],"state_sha256":"50b2b5b1fde61efe71ac3cc1fc146cb75c407b9b9678650e67e7e450b20966d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MU2xTXzVGxE1/xrN6iW/H1KV+3wyYwPsKCUQ9VNFxqnLP0pm0Vcx/lLimnhCEmS88D6iw61152Lm6/E/jIM+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:16:05.588507Z","bundle_sha256":"befeb8633fcf932e261864468adf8cbb457abb065ed805ab1edddcd270fed0fe"}}