{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HTSARFYKCBN4Q455YTRV5TVTMH","short_pith_number":"pith:HTSARFYK","schema_version":"1.0","canonical_sha256":"3ce408970a105bc873bdc4e35eceb361d4d63b07e2a81843d778475fb2901bec","source":{"kind":"arxiv","id":"1310.7627","version":2},"attestation_state":"computed","paper":{"title":"Hardness measures and resolution lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Olaf Beyersdorff, Oliver Kullmann","submitted_at":"2013-10-28T21:17:10Z","abstract_excerpt":"Various \"hardness\" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this report we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. We also extend these measures to all clause-sets (possibly satisfiable)."},"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":"1310.7627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-28T21:17:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6a27ccbed0bc508a745516760beb602bba2951bb66e4a6f3c4c58f165f027cdf","abstract_canon_sha256":"67516b66c0b7ec8813c410573bbd5b804c2fc4a376d81a5771ff3c7a1ee9e732"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.638106Z","signature_b64":"95HVW/XfWEoKuV7Kk1G2PvHjmRM1duhG//PSsRAggaq0aJ7sDoFow9g+67z85/J7tJ77tB/RrVLgjC5EFllYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce408970a105bc873bdc4e35eceb361d4d63b07e2a81843d778475fb2901bec","last_reissued_at":"2026-05-18T02:58:56.637605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.637605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness measures and resolution lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Olaf Beyersdorff, Oliver Kullmann","submitted_at":"2013-10-28T21:17:10Z","abstract_excerpt":"Various \"hardness\" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this report we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. We also extend these measures to all clause-sets (possibly satisfiable)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7627","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":"1310.7627","created_at":"2026-05-18T02:58:56.637685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7627v2","created_at":"2026-05-18T02:58:56.637685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7627","created_at":"2026-05-18T02:58:56.637685+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTSARFYKCBN4","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTSARFYKCBN4Q455","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTSARFYK","created_at":"2026-05-18T12:27:46.883200+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/HTSARFYKCBN4Q455YTRV5TVTMH","json":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH.json","graph_json":"https://pith.science/api/pith-number/HTSARFYKCBN4Q455YTRV5TVTMH/graph.json","events_json":"https://pith.science/api/pith-number/HTSARFYKCBN4Q455YTRV5TVTMH/events.json","paper":"https://pith.science/paper/HTSARFYK"},"agent_actions":{"view_html":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH","download_json":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH.json","view_paper":"https://pith.science/paper/HTSARFYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7627&json=true","fetch_graph":"https://pith.science/api/pith-number/HTSARFYKCBN4Q455YTRV5TVTMH/graph.json","fetch_events":"https://pith.science/api/pith-number/HTSARFYKCBN4Q455YTRV5TVTMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH/action/storage_attestation","attest_author":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH/action/author_attestation","sign_citation":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH/action/citation_signature","submit_replication":"https://pith.science/pith/HTSARFYKCBN4Q455YTRV5TVTMH/action/replication_record"}},"created_at":"2026-05-18T02:58:56.637685+00:00","updated_at":"2026-05-18T02:58:56.637685+00:00"}