{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UAWKS7JOTXJ46VRRJ5ALKS7NXN","short_pith_number":"pith:UAWKS7JO","schema_version":"1.0","canonical_sha256":"a02ca97d2e9dd3cf56314f40b54bedbb6f1cdebe7ecf046cacef751ea44dd36f","source":{"kind":"arxiv","id":"1102.0230","version":1},"attestation_state":"computed","paper":{"title":"Speeding up SAT solver by exploring CNF symmetries : Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.CO","authors_text":"Arup Kumar Ghosh (School of EECS, University of Central Florida)","submitted_at":"2011-02-01T17:37:17Z","abstract_excerpt":"Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry breaking predicates (SBPs) it is possible to break symmetries in Conjunctive Normal Form (CNF). The SBPs cut down the search space to the nonsymmetric regions of the space without affecting the satisfiability of the CNF formula. The symmetry breaking predicates are created by representing the formula as a graph, finding the graph symmetries and using some symmetry "},"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":"1102.0230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-01T17:37:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2e469ccdd6b77da78afcdccf0d6946f2402bde91e69e3e99ce6cf87bda666ada","abstract_canon_sha256":"20c50b2b14e9e36950f0647f44fe98ac0b65a51ad78d8511a0599b39e8434272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:12.904064Z","signature_b64":"vX//VXcGiN75PVmYITGj5HE0hZfbKmJlaSzH0l4GzNIulZ/ZfL/Aq6xwyJNJsWyv3qaRCG4ajTY1wzqdMcEVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a02ca97d2e9dd3cf56314f40b54bedbb6f1cdebe7ecf046cacef751ea44dd36f","last_reissued_at":"2026-05-18T04:30:12.903590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:12.903590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding up SAT solver by exploring CNF symmetries : Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.CO","authors_text":"Arup Kumar Ghosh (School of EECS, University of Central Florida)","submitted_at":"2011-02-01T17:37:17Z","abstract_excerpt":"Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry breaking predicates (SBPs) it is possible to break symmetries in Conjunctive Normal Form (CNF). The SBPs cut down the search space to the nonsymmetric regions of the space without affecting the satisfiability of the CNF formula. The symmetry breaking predicates are created by representing the formula as a graph, finding the graph symmetries and using some symmetry "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0230","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":"1102.0230","created_at":"2026-05-18T04:30:12.903664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0230v1","created_at":"2026-05-18T04:30:12.903664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0230","created_at":"2026-05-18T04:30:12.903664+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAWKS7JOTXJ4","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAWKS7JOTXJ46VRR","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAWKS7JO","created_at":"2026-05-18T12:26:42.757692+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/UAWKS7JOTXJ46VRRJ5ALKS7NXN","json":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN.json","graph_json":"https://pith.science/api/pith-number/UAWKS7JOTXJ46VRRJ5ALKS7NXN/graph.json","events_json":"https://pith.science/api/pith-number/UAWKS7JOTXJ46VRRJ5ALKS7NXN/events.json","paper":"https://pith.science/paper/UAWKS7JO"},"agent_actions":{"view_html":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN","download_json":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN.json","view_paper":"https://pith.science/paper/UAWKS7JO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0230&json=true","fetch_graph":"https://pith.science/api/pith-number/UAWKS7JOTXJ46VRRJ5ALKS7NXN/graph.json","fetch_events":"https://pith.science/api/pith-number/UAWKS7JOTXJ46VRRJ5ALKS7NXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN/action/storage_attestation","attest_author":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN/action/author_attestation","sign_citation":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN/action/citation_signature","submit_replication":"https://pith.science/pith/UAWKS7JOTXJ46VRRJ5ALKS7NXN/action/replication_record"}},"created_at":"2026-05-18T04:30:12.903664+00:00","updated_at":"2026-05-18T04:30:12.903664+00:00"}