{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3WBPQNNQ2QKQRHQXKBKXN6YKTL","short_pith_number":"pith:3WBPQNNQ","schema_version":"1.0","canonical_sha256":"dd82f835b0d415089e17505576fb0a9ae91782d8be9c5f5dab21aa29591a9326","source":{"kind":"arxiv","id":"1608.08447","version":1},"attestation_state":"computed","paper":{"title":"BreakID: Static Symmetry Breaking for ASP (System Description)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Bogaerts, Jo Devriendt","submitted_at":"2016-08-30T13:47:41Z","abstract_excerpt":"Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the current state-of-the-art symmetry breaker for ASP."},"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":"1608.08447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-30T13:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"15553bb1d39b2cf02e08d16b558ef049110a4beecd05082d129d03bbc6d5a0a1","abstract_canon_sha256":"0790f89a6e81d4da608247e6e348c0b5459d15f197cc3aaf3d2ccd6196990fc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:18.077975Z","signature_b64":"TCMIWmkqFXuQLObKFUJ29S/7yGoYJvEbTyI90PlZc3+i9xGAyAla4BQBV2zRge1MjbW+EHqgAK4jzesEs/m8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd82f835b0d415089e17505576fb0a9ae91782d8be9c5f5dab21aa29591a9326","last_reissued_at":"2026-05-18T01:07:18.077348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:18.077348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BreakID: Static Symmetry Breaking for ASP (System Description)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bart Bogaerts, Jo Devriendt","submitted_at":"2016-08-30T13:47:41Z","abstract_excerpt":"Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the current state-of-the-art symmetry breaker for ASP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08447","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":"1608.08447","created_at":"2026-05-18T01:07:18.077471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08447v1","created_at":"2026-05-18T01:07:18.077471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08447","created_at":"2026-05-18T01:07:18.077471+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WBPQNNQ2QKQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WBPQNNQ2QKQRHQX","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WBPQNNQ","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.19251","citing_title":"Streamliners for Answer Set Programming","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL","json":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL.json","graph_json":"https://pith.science/api/pith-number/3WBPQNNQ2QKQRHQXKBKXN6YKTL/graph.json","events_json":"https://pith.science/api/pith-number/3WBPQNNQ2QKQRHQXKBKXN6YKTL/events.json","paper":"https://pith.science/paper/3WBPQNNQ"},"agent_actions":{"view_html":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL","download_json":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL.json","view_paper":"https://pith.science/paper/3WBPQNNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08447&json=true","fetch_graph":"https://pith.science/api/pith-number/3WBPQNNQ2QKQRHQXKBKXN6YKTL/graph.json","fetch_events":"https://pith.science/api/pith-number/3WBPQNNQ2QKQRHQXKBKXN6YKTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL/action/storage_attestation","attest_author":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL/action/author_attestation","sign_citation":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL/action/citation_signature","submit_replication":"https://pith.science/pith/3WBPQNNQ2QKQRHQXKBKXN6YKTL/action/replication_record"}},"created_at":"2026-05-18T01:07:18.077471+00:00","updated_at":"2026-05-18T01:07:18.077471+00:00"}