{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RC4KKAMYWG3RSHQBYI6RM6PE3L","short_pith_number":"pith:RC4KKAMY","canonical_record":{"source":{"id":"1612.03456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-11T19:15:48Z","cross_cats_sorted":["cs.DS","math.GR"],"title_canon_sha256":"3df9f500f8f8bfeb2502e82c36f965519bb7979cd1ec27265d80bb6609a83191","abstract_canon_sha256":"597f0e87ce0c35bbaf0450c87e4f6b7bf377875393b7b4525a7254de80775499"},"schema_version":"1.0"},"canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","source":{"kind":"arxiv","id":"1612.03456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03456","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03456v1","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03456","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"RC4KKAMYWG3R","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RC4KKAMYWG3RSHQB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RC4KKAMY","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RC4KKAMYWG3RSHQBYI6RM6PE3L","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-11T19:15:48Z","cross_cats_sorted":["cs.DS","math.GR"],"title_canon_sha256":"3df9f500f8f8bfeb2502e82c36f965519bb7979cd1ec27265d80bb6609a83191","abstract_canon_sha256":"597f0e87ce0c35bbaf0450c87e4f6b7bf377875393b7b4525a7254de80775499"},"schema_version":"1.0"},"canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:19.171379Z","signature_b64":"D2JAqPetaIcpXgY4XLm75h6oJVMDDvU3oHI1elJo7X7CvumQClTNFCQz5We9o6t1ZGQM2HzlMHqOu16Dt7KSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","last_reissued_at":"2026-05-18T00:55:19.170652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:19.170652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03456","source_version":1,"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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHyf6VbeKRftUgCVrGJ/2BPZOGph3tGnHdjxLGuAmaQ5SX/sBb3SgCvVfghMFQpdjLAyV8hb1woTmwtd4h5nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:40:19.530644Z"},"content_sha256":"0ddb56a375dcdc5e83e648470ab974d454be54c2901338738dc39f7d3ec155ff","schema_version":"1.0","event_id":"sha256:0ddb56a375dcdc5e83e648470ab974d454be54c2901338738dc39f7d3ec155ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RC4KKAMYWG3RSHQBYI6RM6PE3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Baby-Step Giant-Step Algorithms for the Symmetric Group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.GR"],"primary_cat":"cs.SC","authors_text":"Bryce Sandlund, Eric Bach","submitted_at":"2016-12-11T19:15:48Z","abstract_excerpt":"We study discrete logarithms in the setting of group actions. Suppose that $G$ is a group that acts on a set $S$. When $r,s \\in S$, a solution $g \\in G$ to $r^g = s$ can be thought of as a kind of logarithm. In this paper, we study the case where $G = S_n$, and develop analogs to the Shanks baby-step / giant-step procedure for ordinary discrete logarithms. Specifically, we compute two sets $A, B \\subseteq S_n$ such that every permutation of $S_n$ can be written as a product $ab$ of elements $a \\in A$ and $b \\in B$. Our deterministic procedure is optimal up to constant factors, in the sense tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03456","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"},"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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ke9Vq8E8qmuWD671ovoBhnGyW22QvnvpQqNhMCsf0yMHUzqIP0GlNDt2TUYR9ef5KDdR6gVsWFAYBCIHzOavAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:40:19.530998Z"},"content_sha256":"2d30f1840ab673af7556f110a4054589add3f4f2700fd74d7c0a504a785a40ff","schema_version":"1.0","event_id":"sha256:2d30f1840ab673af7556f110a4054589add3f4f2700fd74d7c0a504a785a40ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/bundle.json","state_url":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/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-03T20:40:19Z","links":{"resolver":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L","bundle":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/bundle.json","state":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RC4KKAMYWG3RSHQBYI6RM6PE3L","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":"597f0e87ce0c35bbaf0450c87e4f6b7bf377875393b7b4525a7254de80775499","cross_cats_sorted":["cs.DS","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-11T19:15:48Z","title_canon_sha256":"3df9f500f8f8bfeb2502e82c36f965519bb7979cd1ec27265d80bb6609a83191"},"schema_version":"1.0","source":{"id":"1612.03456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03456","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03456v1","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03456","created_at":"2026-05-18T00:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"RC4KKAMYWG3R","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RC4KKAMYWG3RSHQB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RC4KKAMY","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:2d30f1840ab673af7556f110a4054589add3f4f2700fd74d7c0a504a785a40ff","target":"graph","created_at":"2026-05-18T00:55:19Z","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":"We study discrete logarithms in the setting of group actions. Suppose that $G$ is a group that acts on a set $S$. When $r,s \\in S$, a solution $g \\in G$ to $r^g = s$ can be thought of as a kind of logarithm. In this paper, we study the case where $G = S_n$, and develop analogs to the Shanks baby-step / giant-step procedure for ordinary discrete logarithms. Specifically, we compute two sets $A, B \\subseteq S_n$ such that every permutation of $S_n$ can be written as a product $ab$ of elements $a \\in A$ and $b \\in B$. Our deterministic procedure is optimal up to constant factors, in the sense tha","authors_text":"Bryce Sandlund, Eric Bach","cross_cats":["cs.DS","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-11T19:15:48Z","title":"Baby-Step Giant-Step Algorithms for the Symmetric Group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03456","kind":"arxiv","version":1},"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:0ddb56a375dcdc5e83e648470ab974d454be54c2901338738dc39f7d3ec155ff","target":"record","created_at":"2026-05-18T00:55:19Z","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":"597f0e87ce0c35bbaf0450c87e4f6b7bf377875393b7b4525a7254de80775499","cross_cats_sorted":["cs.DS","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-11T19:15:48Z","title_canon_sha256":"3df9f500f8f8bfeb2502e82c36f965519bb7979cd1ec27265d80bb6609a83191"},"schema_version":"1.0","source":{"id":"1612.03456","kind":"arxiv","version":1}},"canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","first_computed_at":"2026-05-18T00:55:19.170652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:19.170652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D2JAqPetaIcpXgY4XLm75h6oJVMDDvU3oHI1elJo7X7CvumQClTNFCQz5We9o6t1ZGQM2HzlMHqOu16Dt7KSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:19.171379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ddb56a375dcdc5e83e648470ab974d454be54c2901338738dc39f7d3ec155ff","sha256:2d30f1840ab673af7556f110a4054589add3f4f2700fd74d7c0a504a785a40ff"],"state_sha256":"531c17b9d61e2a983df583bcacdb445922baacbdbeb7cc2fb60dcd344edb79c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3248YtTVRsXEW5lQ+56hhGxvPO9hVCPimzzirY0SxYtOxSLCpQpT6CutTNjNqyTM/BTw/+eP2LcEBJGC537AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:40:19.532972Z","bundle_sha256":"a99e2e03f867cecc33a05aa09752cc551045554941bf5137ea0c946f15275629"}}