{"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"}