{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S6AGA3P5AK6AECFCGP2XOAGYIC","short_pith_number":"pith:S6AGA3P5","schema_version":"1.0","canonical_sha256":"9780606dfd02bc0208a233f57700d8409ac8bc32e545aa5b0f3c2d322e1ff309","source":{"kind":"arxiv","id":"1703.00197","version":2},"attestation_state":"computed","paper":{"title":"Minimal and Canonical Images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.GR","authors_text":"Christopher Jefferson, Eliza Jonauskyte, Markus Pfeiffer, Rebecca Waldecker","submitted_at":"2017-03-01T09:48:29Z","abstract_excerpt":"We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the group, to efficiently reduce the amount of search which must be performed to find a canonical image.\n  We present both a formal proof of correctness of our algorithms and experiments on different permutation groups, which compare our algorithms with the previous state of the art."},"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":"1703.00197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-03-01T09:48:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8b1af79afc897c44c2e6e24e26e203e9b96b6371f0967611f34b72adc9bea77f","abstract_canon_sha256":"cd6a34842e4f46bf49b1da641595eeba4e51ff2b9611d8b6bdb66d1d0e9b6704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.620299Z","signature_b64":"ozLiUmhhkhPMoshHMy4k01hNN5ovUmaamxN0VrESkCSaemdXK3jR2kM9TN3NiLfDYH4IMt3ETbfzOCEm87pjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9780606dfd02bc0208a233f57700d8409ac8bc32e545aa5b0f3c2d322e1ff309","last_reissued_at":"2026-05-18T00:29:01.619724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.619724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal and Canonical Images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.GR","authors_text":"Christopher Jefferson, Eliza Jonauskyte, Markus Pfeiffer, Rebecca Waldecker","submitted_at":"2017-03-01T09:48:29Z","abstract_excerpt":"We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the group, to efficiently reduce the amount of search which must be performed to find a canonical image.\n  We present both a formal proof of correctness of our algorithms and experiments on different permutation groups, which compare our algorithms with the previous state of the art."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00197","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":"1703.00197","created_at":"2026-05-18T00:29:01.619820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00197v2","created_at":"2026-05-18T00:29:01.619820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00197","created_at":"2026-05-18T00:29:01.619820+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6AGA3P5AK6A","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6AGA3P5AK6AECFC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6AGA3P5","created_at":"2026-05-18T12:31:43.269735+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/S6AGA3P5AK6AECFCGP2XOAGYIC","json":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC.json","graph_json":"https://pith.science/api/pith-number/S6AGA3P5AK6AECFCGP2XOAGYIC/graph.json","events_json":"https://pith.science/api/pith-number/S6AGA3P5AK6AECFCGP2XOAGYIC/events.json","paper":"https://pith.science/paper/S6AGA3P5"},"agent_actions":{"view_html":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC","download_json":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC.json","view_paper":"https://pith.science/paper/S6AGA3P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00197&json=true","fetch_graph":"https://pith.science/api/pith-number/S6AGA3P5AK6AECFCGP2XOAGYIC/graph.json","fetch_events":"https://pith.science/api/pith-number/S6AGA3P5AK6AECFCGP2XOAGYIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC/action/storage_attestation","attest_author":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC/action/author_attestation","sign_citation":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC/action/citation_signature","submit_replication":"https://pith.science/pith/S6AGA3P5AK6AECFCGP2XOAGYIC/action/replication_record"}},"created_at":"2026-05-18T00:29:01.619820+00:00","updated_at":"2026-05-18T00:29:01.619820+00:00"}