{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L6MW5HKP2ECEDD47IDO2K7MDOA","short_pith_number":"pith:L6MW5HKP","canonical_record":{"source":{"id":"1509.07437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T17:02:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5b49b58ea8a6584c9b6d8fb72719311efa62fbb46acdd6206da41711b49aed5b","abstract_canon_sha256":"44052be5071072c02aaf494a9b3869412f7eca7a8b2b1f0f7c073931bd0e8f56"},"schema_version":"1.0"},"canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","source":{"kind":"arxiv","id":"1509.07437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07437","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07437v1","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07437","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"L6MW5HKP2ECE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6MW5HKP2ECEDD47","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6MW5HKP","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L6MW5HKP2ECEDD47IDO2K7MDOA","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T17:02:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5b49b58ea8a6584c9b6d8fb72719311efa62fbb46acdd6206da41711b49aed5b","abstract_canon_sha256":"44052be5071072c02aaf494a9b3869412f7eca7a8b2b1f0f7c073931bd0e8f56"},"schema_version":"1.0"},"canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.965483Z","signature_b64":"OhFb8JrkDiJHubvbMOqlquyeZCRXvIIBqXA8UXZ766wh3brquZSeOwVQBdkuLwLaJ/qw9QWg7Hlp346eeFhnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","last_reissued_at":"2026-05-18T01:32:08.964716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.964716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07437","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuGTjHwNNeJQlJm6SiW2LonXa4GA1ta+VJ+pB3jAdt/wQL7fMPJy7W/Jyx6k/z8/7ubdKoiz5uOy0SOmZSLkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:45:35.186394Z"},"content_sha256":"ac4a093ad6d95e346049cf91be62d21a865438589346677703812a78f885033b","schema_version":"1.0","event_id":"sha256:ac4a093ad6d95e346049cf91be62d21a865438589346677703812a78f885033b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L6MW5HKP2ECEDD47IDO2K7MDOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M.P. Jansen","submitted_at":"2015-09-24T17:02:31Z","abstract_excerpt":"We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time algorithm that reduces any n-vertex input to an equivalent instance, of an arbitrary problem, with bitsize O(n^{2-e}) for e > 0, unless NP is in coNP/poly and the polynomial-time hierarchy collapses. These results imply that existing linear-vertex kernels for k-Nonblocker and k-Max Leaf Spanning Tree (the parametric duals of (Connected) Dominating Set) cannot "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07437","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+4aolep5X178CAUu+cRaNlqWj/r4k6kAPaIK2HefShv/1Br3D7694Bgq6Vjd/TVP799zY3LJpyVIlG5aNy3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:45:35.186746Z"},"content_sha256":"e7585b67707d862ff5adb740ab0c4caeffc534afa254f8e28f0f7a7a537bd814","schema_version":"1.0","event_id":"sha256:e7585b67707d862ff5adb740ab0c4caeffc534afa254f8e28f0f7a7a537bd814"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/bundle.json","state_url":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/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-20T02:45:35Z","links":{"resolver":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA","bundle":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/bundle.json","state":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L6MW5HKP2ECEDD47IDO2K7MDOA","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":"44052be5071072c02aaf494a9b3869412f7eca7a8b2b1f0f7c073931bd0e8f56","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T17:02:31Z","title_canon_sha256":"5b49b58ea8a6584c9b6d8fb72719311efa62fbb46acdd6206da41711b49aed5b"},"schema_version":"1.0","source":{"id":"1509.07437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07437","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07437v1","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07437","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"L6MW5HKP2ECE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6MW5HKP2ECEDD47","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6MW5HKP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:e7585b67707d862ff5adb740ab0c4caeffc534afa254f8e28f0f7a7a537bd814","target":"graph","created_at":"2026-05-18T01:32: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":"We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time algorithm that reduces any n-vertex input to an equivalent instance, of an arbitrary problem, with bitsize O(n^{2-e}) for e > 0, unless NP is in coNP/poly and the polynomial-time hierarchy collapses. These results imply that existing linear-vertex kernels for k-Nonblocker and k-Max Leaf Spanning Tree (the parametric duals of (Connected) Dominating Set) cannot ","authors_text":"Astrid Pieterse, Bart M.P. Jansen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T17:02:31Z","title":"Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07437","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:ac4a093ad6d95e346049cf91be62d21a865438589346677703812a78f885033b","target":"record","created_at":"2026-05-18T01:32: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":"44052be5071072c02aaf494a9b3869412f7eca7a8b2b1f0f7c073931bd0e8f56","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-24T17:02:31Z","title_canon_sha256":"5b49b58ea8a6584c9b6d8fb72719311efa62fbb46acdd6206da41711b49aed5b"},"schema_version":"1.0","source":{"id":"1509.07437","kind":"arxiv","version":1}},"canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","first_computed_at":"2026-05-18T01:32:08.964716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:08.964716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OhFb8JrkDiJHubvbMOqlquyeZCRXvIIBqXA8UXZ766wh3brquZSeOwVQBdkuLwLaJ/qw9QWg7Hlp346eeFhnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:08.965483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac4a093ad6d95e346049cf91be62d21a865438589346677703812a78f885033b","sha256:e7585b67707d862ff5adb740ab0c4caeffc534afa254f8e28f0f7a7a537bd814"],"state_sha256":"6498e123903ad2ddef3eeebc28c000f02ddcc4c168e543bfd53b33fb7364893a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkfdBRhqlxLqsICaNWmSx8iu3YzizHTnhczFHwP8rCSV5qAnjCwT8zRgCq/gqyU8moDlEEQP4PMR3N4csRCzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:45:35.188708Z","bundle_sha256":"6fbfd8e85d9c0b9cd4c85c07f3173f7c54a687a0fbd549751c3d818053dd0e81"}}