{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y743JOCOWVMUGLSJZVGCAQH3E4","short_pith_number":"pith:Y743JOCO","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"},"canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","source":{"kind":"arxiv","id":"1706.08325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08325","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08325v2","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08325","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"Y743JOCOWVMU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y743JOCOWVMUGLSJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y743JOCO","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y743JOCOWVMUGLSJZVGCAQH3E4","target":"record","payload":{"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"},"canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","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"},"source_kind":"arxiv","source_id":"1706.08325","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+bkhQPzVNAkHhmumQvA1uHMEreiJXvOk8ZR2Q52mG3b7IWyhp7gS4NoQ+SU1Wlf9PonlDG1I2jXR5eQ2qT8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:59:12.439039Z"},"content_sha256":"dcf51b85f1d9031ab271edf425e5a49dd6bec321b053c3ae7d33d2a535dbc38b","schema_version":"1.0","event_id":"sha256:dcf51b85f1d9031ab271edf425e5a49dd6bec321b053c3ae7d33d2a535dbc38b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y743JOCOWVMUGLSJZVGCAQH3E4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coI6REPgy6ENJxuOazBYxNoTr32Z7R/WG+6QZDYLDbj1ksCnyK4/PQvw/dkq09Ry1gaZ8pUyJOYXO+eH7F+wCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:59:12.439737Z"},"content_sha256":"f1bc4b1f8a239f4a8692032e0ec8e966519efd3b4a22af4c87c2f213a6d2d50e","schema_version":"1.0","event_id":"sha256:f1bc4b1f8a239f4a8692032e0ec8e966519efd3b4a22af4c87c2f213a6d2d50e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/bundle.json","state_url":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T00:59:12Z","links":{"resolver":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4","bundle":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/bundle.json","state":"https://pith.science/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y743JOCOWVMUGLSJZVGCAQH3E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y743JOCOWVMUGLSJZVGCAQH3E4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4eb26e118ca2cf1e23716db44b7320f403beb8fe18bad610ac6269935a14cbc9","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T11:18:27Z","title_canon_sha256":"92a56dabc0d9c2f263c4ca20c20072fba88a0f6600f742e075c6d98289412c2e"},"schema_version":"1.0","source":{"id":"1706.08325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08325","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08325v2","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08325","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"Y743JOCOWVMU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y743JOCOWVMUGLSJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y743JOCO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:f1bc4b1f8a239f4a8692032e0ec8e966519efd3b4a22af4c87c2f213a6d2d50e","target":"graph","created_at":"2026-05-18T00:06:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Department of Computer Science), Jukka Kohonen (1) ((1) Aalto University, Matti Karppa (1), Petteri Kaski (1), Tommi Junttila (1)","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T11:18:27Z","title":"An adaptive prefix-assignment technique for symmetry reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08325","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcf51b85f1d9031ab271edf425e5a49dd6bec321b053c3ae7d33d2a535dbc38b","target":"record","created_at":"2026-05-18T00:06:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4eb26e118ca2cf1e23716db44b7320f403beb8fe18bad610ac6269935a14cbc9","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T11:18:27Z","title_canon_sha256":"92a56dabc0d9c2f263c4ca20c20072fba88a0f6600f742e075c6d98289412c2e"},"schema_version":"1.0","source":{"id":"1706.08325","kind":"arxiv","version":2}},"canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7f9b4b84eb559432e49cd4c2040fb2704798a241e2c24dc7fec15ce3b6bfb4e","first_computed_at":"2026-05-18T00:06:16.385241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:16.385241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"56d9Sf2mkPVMdgxSYf+m4ipdyMA8oda1f7wH1JMRgo6YkGTLPqHcW/9YGkWmXVbuJGOAvGnfaHekGe3aSbd5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:16.385666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcf51b85f1d9031ab271edf425e5a49dd6bec321b053c3ae7d33d2a535dbc38b","sha256:f1bc4b1f8a239f4a8692032e0ec8e966519efd3b4a22af4c87c2f213a6d2d50e"],"state_sha256":"e4d585618b9fcf825e66585f86bc7248a972546e360168d224acf03053255570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sW6hrrwtaMP0K7hEGXlj45hmarWKpKuZMFEbm9wmsae61F7Eo67f3p7vMIpUKly6ePy2T84CYUp8+SYtlv2uBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:59:12.443705Z","bundle_sha256":"cc342c1845201f480934d749c499ba37300863981a2a22dd34bd6ea3355971c0"}}