{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H2T7R2GZS4U4HH25UJ4EN4PL5W","short_pith_number":"pith:H2T7R2GZ","schema_version":"1.0","canonical_sha256":"3ea7f8e8d99729c39f5da27846f1ebed9e9b534f72c5b250aef8720994799bf3","source":{"kind":"arxiv","id":"1107.4553","version":1},"attestation_state":"computed","paper":{"title":"Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mnacho Echenim, Thierry Boy de la Tour","submitted_at":"2011-07-22T15:52:26Z","abstract_excerpt":"Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of symmetries that can be huge, and the problem of their very existence is NP-hard. We formulate such an existence problem as a constraint problem on one variable (the symmetry to be used) ranging over a group, and try to find restrictions that may be solved in polynomial time. By considering a simple form of constraints (restricted by a cardinality k) and the class of "},"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":"1107.4553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-22T15:52:26Z","cross_cats_sorted":[],"title_canon_sha256":"bc59cb7784d957f3f8e691b3fc50b3bfe2ef0611f3fca3ebb9bd05c568c47854","abstract_canon_sha256":"9995cb580388fa662289bc707d0d9c876dcb89d956401a6eaf5b728f60d0d18a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:03.805508Z","signature_b64":"WwuY0W4tMsxUHBXPpI0h5fHKgWgy0DCktCr4tLRvyEchECulZ79ddTaz1B3lI5jSmAD65ZmOeIxsvGC74h5NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea7f8e8d99729c39f5da27846f1ebed9e9b534f72c5b250aef8720994799bf3","last_reissued_at":"2026-05-18T04:17:03.804946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:03.804946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mnacho Echenim, Thierry Boy de la Tour","submitted_at":"2011-07-22T15:52:26Z","abstract_excerpt":"Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of symmetries that can be huge, and the problem of their very existence is NP-hard. We formulate such an existence problem as a constraint problem on one variable (the symmetry to be used) ranging over a group, and try to find restrictions that may be solved in polynomial time. By considering a simple form of constraints (restricted by a cardinality k) and the class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4553","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":"1107.4553","created_at":"2026-05-18T04:17:03.805011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4553v1","created_at":"2026-05-18T04:17:03.805011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4553","created_at":"2026-05-18T04:17:03.805011+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2T7R2GZS4U4","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2T7R2GZS4U4HH25","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2T7R2GZ","created_at":"2026-05-18T12:26:30.835961+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/H2T7R2GZS4U4HH25UJ4EN4PL5W","json":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W.json","graph_json":"https://pith.science/api/pith-number/H2T7R2GZS4U4HH25UJ4EN4PL5W/graph.json","events_json":"https://pith.science/api/pith-number/H2T7R2GZS4U4HH25UJ4EN4PL5W/events.json","paper":"https://pith.science/paper/H2T7R2GZ"},"agent_actions":{"view_html":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W","download_json":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W.json","view_paper":"https://pith.science/paper/H2T7R2GZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4553&json=true","fetch_graph":"https://pith.science/api/pith-number/H2T7R2GZS4U4HH25UJ4EN4PL5W/graph.json","fetch_events":"https://pith.science/api/pith-number/H2T7R2GZS4U4HH25UJ4EN4PL5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W/action/storage_attestation","attest_author":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W/action/author_attestation","sign_citation":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W/action/citation_signature","submit_replication":"https://pith.science/pith/H2T7R2GZS4U4HH25UJ4EN4PL5W/action/replication_record"}},"created_at":"2026-05-18T04:17:03.805011+00:00","updated_at":"2026-05-18T04:17:03.805011+00:00"}