{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VDRQJQQO6I24HR5JJPDDCGBQFB","short_pith_number":"pith:VDRQJQQO","schema_version":"1.0","canonical_sha256":"a8e304c20ef235c3c7a94bc63118302851ed66ee8c4347bb7904de0ab4bb937a","source":{"kind":"arxiv","id":"1008.1809","version":1},"attestation_state":"computed","paper":{"title":"Symmetry-breaking Answer Set Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christian Drescher, Oana Tifrea, Toby Walsh","submitted_at":"2010-08-10T21:29:13Z","abstract_excerpt":"In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact."},"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":"1008.1809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-10T21:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"7c813b67f6a0364f2850da4bc379805482fb88a62b49e4e04c3568772ee75dcc","abstract_canon_sha256":"cba6ff49129421f99a57f017a7834caf3470cd13b199159847549ef1cf1d9376"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:22.924387Z","signature_b64":"fZyVJVqQr5Nb+N8JBwmNSjc1Z23cTdCx2UZAFUAydFD5ASH5Y9R6OhsJovzkG/fpf7UmZ4LPC2Dzs3/hdGvNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e304c20ef235c3c7a94bc63118302851ed66ee8c4347bb7904de0ab4bb937a","last_reissued_at":"2026-05-18T04:42:22.923860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:22.923860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetry-breaking Answer Set Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christian Drescher, Oana Tifrea, Toby Walsh","submitted_at":"2010-08-10T21:29:13Z","abstract_excerpt":"In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1809","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":"1008.1809","created_at":"2026-05-18T04:42:22.923941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1809v1","created_at":"2026-05-18T04:42:22.923941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1809","created_at":"2026-05-18T04:42:22.923941+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDRQJQQO6I24","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDRQJQQO6I24HR5J","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDRQJQQO","created_at":"2026-05-18T12:26:15.391820+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/VDRQJQQO6I24HR5JJPDDCGBQFB","json":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB.json","graph_json":"https://pith.science/api/pith-number/VDRQJQQO6I24HR5JJPDDCGBQFB/graph.json","events_json":"https://pith.science/api/pith-number/VDRQJQQO6I24HR5JJPDDCGBQFB/events.json","paper":"https://pith.science/paper/VDRQJQQO"},"agent_actions":{"view_html":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB","download_json":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB.json","view_paper":"https://pith.science/paper/VDRQJQQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1809&json=true","fetch_graph":"https://pith.science/api/pith-number/VDRQJQQO6I24HR5JJPDDCGBQFB/graph.json","fetch_events":"https://pith.science/api/pith-number/VDRQJQQO6I24HR5JJPDDCGBQFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB/action/storage_attestation","attest_author":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB/action/author_attestation","sign_citation":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB/action/citation_signature","submit_replication":"https://pith.science/pith/VDRQJQQO6I24HR5JJPDDCGBQFB/action/replication_record"}},"created_at":"2026-05-18T04:42:22.923941+00:00","updated_at":"2026-05-18T04:42:22.923941+00:00"}