{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SYE53VAYGLTVZIW33MTRTQITYP","short_pith_number":"pith:SYE53VAY","schema_version":"1.0","canonical_sha256":"9609ddd41832e75ca2dbdb2719c113c3d134eef158e36c02d1a00ce9e227c3f7","source":{"kind":"arxiv","id":"1611.01291","version":1},"attestation_state":"computed","paper":{"title":"Tighter Hard Instances for PPSZ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dominik Scheder, Navid Talebanfard, Pavel Pudl\\'ak","submitted_at":"2016-11-04T09:27:34Z","abstract_excerpt":"We construct uniquely satisfiable $k$-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which \"weak PPSZ\" has savings of at most $(2 + \\epsilon) / k$; the saving of an algorithm on an input formula with $n$ variables is the largest $\\gamma$ such that the algorithm succeeds (i.e. finds a satisfying assignment) with probability at least $2^{ - (1 - \\gamma) n}$. Since PPSZ (both weak and strong) is known to have savings of at least $\\frac{\\pi^2 + o(1)}{6k}$, this is optimal up to the constant factor. In particular, for $k=3$, our upper bound is $2^{0.333\\"},"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":"1611.01291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-04T09:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"4f51e29f96ba1c0a2257e8b97a5ca65c74b8054d72d1bc7379c9ea4aa1a630e8","abstract_canon_sha256":"9afa201a5cf8a9177df2ac1e22f92d5616652facdd33882bb238f8ed32228522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:03.740782Z","signature_b64":"WKATAcehWrI1xJHuUbliDgUX0oKfZeyI0BMZ7p7qsEqXpppUWcvrwpxFws6nAJLDqeUuwWYWGNESM6D/7Kh3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9609ddd41832e75ca2dbdb2719c113c3d134eef158e36c02d1a00ce9e227c3f7","last_reissued_at":"2026-05-18T00:36:03.740136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:03.740136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Hard Instances for PPSZ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dominik Scheder, Navid Talebanfard, Pavel Pudl\\'ak","submitted_at":"2016-11-04T09:27:34Z","abstract_excerpt":"We construct uniquely satisfiable $k$-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which \"weak PPSZ\" has savings of at most $(2 + \\epsilon) / k$; the saving of an algorithm on an input formula with $n$ variables is the largest $\\gamma$ such that the algorithm succeeds (i.e. finds a satisfying assignment) with probability at least $2^{ - (1 - \\gamma) n}$. Since PPSZ (both weak and strong) is known to have savings of at least $\\frac{\\pi^2 + o(1)}{6k}$, this is optimal up to the constant factor. In particular, for $k=3$, our upper bound is $2^{0.333\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01291","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":"1611.01291","created_at":"2026-05-18T00:36:03.740231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01291v1","created_at":"2026-05-18T00:36:03.740231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01291","created_at":"2026-05-18T00:36:03.740231+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYE53VAYGLTV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYE53VAYGLTVZIW3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYE53VAY","created_at":"2026-05-18T12:30:44.179134+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/SYE53VAYGLTVZIW33MTRTQITYP","json":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP.json","graph_json":"https://pith.science/api/pith-number/SYE53VAYGLTVZIW33MTRTQITYP/graph.json","events_json":"https://pith.science/api/pith-number/SYE53VAYGLTVZIW33MTRTQITYP/events.json","paper":"https://pith.science/paper/SYE53VAY"},"agent_actions":{"view_html":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP","download_json":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP.json","view_paper":"https://pith.science/paper/SYE53VAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01291&json=true","fetch_graph":"https://pith.science/api/pith-number/SYE53VAYGLTVZIW33MTRTQITYP/graph.json","fetch_events":"https://pith.science/api/pith-number/SYE53VAYGLTVZIW33MTRTQITYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP/action/storage_attestation","attest_author":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP/action/author_attestation","sign_citation":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP/action/citation_signature","submit_replication":"https://pith.science/pith/SYE53VAYGLTVZIW33MTRTQITYP/action/replication_record"}},"created_at":"2026-05-18T00:36:03.740231+00:00","updated_at":"2026-05-18T00:36:03.740231+00:00"}