{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y743JOCOWVMUGLSJZVGCAQH3E4","short_pith_number":"pith:Y743JOCO","schema_version":"1.0","canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","source":{"kind":"arxiv","id":"1706.08325","version":2},"attestation_state":"computed","paper":{"title":"An adaptive prefix-assignment technique for symmetry reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LO","authors_text":"Department of Computer Science), Jukka Kohonen (1) ((1) Aalto University, Matti Karppa (1), Petteri Kaski (1), Tommi Junttila (1)","submitted_at":"2017-06-26T11:18:27Z","abstract_excerpt":"This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under the action of the symmetry group of the system. The technique is based on McKay's canonical extension framework [J.~Algorithms 26 (1998), no.~2, 306--324]. Among key features of the technique are (i) adaptability---the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries; (ii) parallelizability---prefix-assignments can be processed in parallel indep"},"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":"1706.08325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T11:18:27Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"92a56dabc0d9c2f263c4ca20c20072fba88a0f6600f742e075c6d98289412c2e","abstract_canon_sha256":"4eb26e118ca2cf1e23716db44b7320f403beb8fe18bad610ac6269935a14cbc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:16.385666Z","signature_b64":"56d9Sf2mkPVMdgxSYf+m4ipdyMA8oda1f7wH1JMRgo6YkGTLPqHcW/9YGkWmXVbuJGOAvGnfaHekGe3aSbd5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","last_reissued_at":"2026-05-18T00:06:16.385241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:16.385241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An adaptive prefix-assignment technique for symmetry reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LO","authors_text":"Department of Computer Science), Jukka Kohonen (1) ((1) Aalto University, Matti Karppa (1), Petteri Kaski (1), Tommi Junttila (1)","submitted_at":"2017-06-26T11:18:27Z","abstract_excerpt":"This paper presents a technique for symmetry reduction that adaptively assigns a prefix of variables in a system of constraints so that the generated prefix-assignments are pairwise nonisomorphic under the action of the symmetry group of the system. The technique is based on McKay's canonical extension framework [J.~Algorithms 26 (1998), no.~2, 306--324]. Among key features of the technique are (i) adaptability---the prefix sequence can be user-prescribed and truncated for compatibility with the group of symmetries; (ii) parallelizability---prefix-assignments can be processed in parallel indep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08325","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":"1706.08325","created_at":"2026-05-18T00:06:16.385303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08325v2","created_at":"2026-05-18T00:06:16.385303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08325","created_at":"2026-05-18T00:06:16.385303+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y743JOCOWVMU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y743JOCOWVMUGLSJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y743JOCO","created_at":"2026-05-18T12:31:56.362134+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/Y743JOCOWVMUGLSJZVGCAQH3E4","json":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4.json","graph_json":"https://pith.science/api/pith-number/Y743JOCOWVMUGLSJZVGCAQH3E4/graph.json","events_json":"https://pith.science/api/pith-number/Y743JOCOWVMUGLSJZVGCAQH3E4/events.json","paper":"https://pith.science/paper/Y743JOCO"},"agent_actions":{"view_html":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4","download_json":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4.json","view_paper":"https://pith.science/paper/Y743JOCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08325&json=true","fetch_graph":"https://pith.science/api/pith-number/Y743JOCOWVMUGLSJZVGCAQH3E4/graph.json","fetch_events":"https://pith.science/api/pith-number/Y743JOCOWVMUGLSJZVGCAQH3E4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/action/storage_attestation","attest_author":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/action/author_attestation","sign_citation":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/action/citation_signature","submit_replication":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/action/replication_record"}},"created_at":"2026-05-18T00:06:16.385303+00:00","updated_at":"2026-05-18T00:06:16.385303+00:00"}