{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UKKPFAHCEE3I6AGDMQENSTGISL","short_pith_number":"pith:UKKPFAHC","schema_version":"1.0","canonical_sha256":"a294f280e221368f00c36408d94cc892ecb8667d8d98de3d0a49e72974f4d69a","source":{"kind":"arxiv","id":"1809.02843","version":2},"attestation_state":"computed","paper":{"title":"Resolution and the binary encoding of combinatorial principles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Nicola Galesi, Stefan Dantchev","submitted_at":"2018-09-08T17:41:16Z","abstract_excerpt":"We investigate the size complexity of proofs in $Res(s)$ -- an extension of Resolution working on $s$-DNFs instead of clauses -- for families of contradictions given in the {\\em unusual binary} encoding. A motivation of our work is size lower bounds of refutations in Resolution for families of contradictions in the usual unary encoding. Our main interest is the $k$-Clique Principle, whose Resolution complexity is still unknown.\n  Our main result is a $n^{\\Omega(k)}$ lower bound for the size of refutations of the binary $k$-Clique Principle in $Res(\\lfloor \\frac{1}{2}\\log \\log n\\rfloor)$. This "},"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":"1809.02843","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-08T17:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"0ffab7ab5d9e16b7edbf25f890778119c616ed64a9b2d568673b8c1956494577","abstract_canon_sha256":"065b58739b4ec01f4a506f4431e50f1a19d757b478c04e2298110aab8bd9a7f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.304383Z","signature_b64":"+sa/SiRXRBVy7b+ivjnDKPGR+RgDX8ETq6dW6dtyUnYKglZia1RnQsdR3Qh9RrGa2a6naO/sId+Ds8D0ZuxQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a294f280e221368f00c36408d94cc892ecb8667d8d98de3d0a49e72974f4d69a","last_reissued_at":"2026-05-18T00:05:21.303866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.303866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolution and the binary encoding of combinatorial principles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Nicola Galesi, Stefan Dantchev","submitted_at":"2018-09-08T17:41:16Z","abstract_excerpt":"We investigate the size complexity of proofs in $Res(s)$ -- an extension of Resolution working on $s$-DNFs instead of clauses -- for families of contradictions given in the {\\em unusual binary} encoding. A motivation of our work is size lower bounds of refutations in Resolution for families of contradictions in the usual unary encoding. Our main interest is the $k$-Clique Principle, whose Resolution complexity is still unknown.\n  Our main result is a $n^{\\Omega(k)}$ lower bound for the size of refutations of the binary $k$-Clique Principle in $Res(\\lfloor \\frac{1}{2}\\log \\log n\\rfloor)$. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.02843","created_at":"2026-05-18T00:05:21.303960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02843v2","created_at":"2026-05-18T00:05:21.303960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02843","created_at":"2026-05-18T00:05:21.303960+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKKPFAHCEE3I","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKKPFAHCEE3I6AGD","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKKPFAHC","created_at":"2026-05-18T12:32:56.356000+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/UKKPFAHCEE3I6AGDMQENSTGISL","json":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL.json","graph_json":"https://pith.science/api/pith-number/UKKPFAHCEE3I6AGDMQENSTGISL/graph.json","events_json":"https://pith.science/api/pith-number/UKKPFAHCEE3I6AGDMQENSTGISL/events.json","paper":"https://pith.science/paper/UKKPFAHC"},"agent_actions":{"view_html":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL","download_json":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL.json","view_paper":"https://pith.science/paper/UKKPFAHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02843&json=true","fetch_graph":"https://pith.science/api/pith-number/UKKPFAHCEE3I6AGDMQENSTGISL/graph.json","fetch_events":"https://pith.science/api/pith-number/UKKPFAHCEE3I6AGDMQENSTGISL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL/action/storage_attestation","attest_author":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL/action/author_attestation","sign_citation":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL/action/citation_signature","submit_replication":"https://pith.science/pith/UKKPFAHCEE3I6AGDMQENSTGISL/action/replication_record"}},"created_at":"2026-05-18T00:05:21.303960+00:00","updated_at":"2026-05-18T00:05:21.303960+00:00"}