{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L6MW5HKP2ECEDD47IDO2K7MDOA","short_pith_number":"pith:L6MW5HKP","schema_version":"1.0","canonical_sha256":"5f996e9d4fd104418f9f40dda57d8370122c2e2c60993e6da270c2d741ed23df","source":{"kind":"arxiv","id":"1509.07437","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07437","created_at":"2026-05-18T01:32:08.964832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07437v1","created_at":"2026-05-18T01:32:08.964832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07437","created_at":"2026-05-18T01:32:08.964832+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6MW5HKP2ECE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6MW5HKP2ECEDD47","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6MW5HKP","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA","json":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA.json","graph_json":"https://pith.science/api/pith-number/L6MW5HKP2ECEDD47IDO2K7MDOA/graph.json","events_json":"https://pith.science/api/pith-number/L6MW5HKP2ECEDD47IDO2K7MDOA/events.json","paper":"https://pith.science/paper/L6MW5HKP"},"agent_actions":{"view_html":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA","download_json":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA.json","view_paper":"https://pith.science/paper/L6MW5HKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07437&json=true","fetch_graph":"https://pith.science/api/pith-number/L6MW5HKP2ECEDD47IDO2K7MDOA/graph.json","fetch_events":"https://pith.science/api/pith-number/L6MW5HKP2ECEDD47IDO2K7MDOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/action/storage_attestation","attest_author":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/action/author_attestation","sign_citation":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/action/citation_signature","submit_replication":"https://pith.science/pith/L6MW5HKP2ECEDD47IDO2K7MDOA/action/replication_record"}},"created_at":"2026-05-18T01:32:08.964832+00:00","updated_at":"2026-05-18T01:32:08.964832+00:00"}