{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RC4KKAMYWG3RSHQBYI6RM6PE3L","short_pith_number":"pith:RC4KKAMY","schema_version":"1.0","canonical_sha256":"88b8a50198b1b7191e01c23d1679e4daf8b6e398ca405fb12ad6573369f34aea","source":{"kind":"arxiv","id":"1612.03456","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.03456","created_at":"2026-05-18T00:55:19.170773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03456v1","created_at":"2026-05-18T00:55:19.170773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03456","created_at":"2026-05-18T00:55:19.170773+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC4KKAMYWG3R","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC4KKAMYWG3RSHQB","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC4KKAMY","created_at":"2026-05-18T12:30:41.710351+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/RC4KKAMYWG3RSHQBYI6RM6PE3L","json":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L.json","graph_json":"https://pith.science/api/pith-number/RC4KKAMYWG3RSHQBYI6RM6PE3L/graph.json","events_json":"https://pith.science/api/pith-number/RC4KKAMYWG3RSHQBYI6RM6PE3L/events.json","paper":"https://pith.science/paper/RC4KKAMY"},"agent_actions":{"view_html":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L","download_json":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L.json","view_paper":"https://pith.science/paper/RC4KKAMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03456&json=true","fetch_graph":"https://pith.science/api/pith-number/RC4KKAMYWG3RSHQBYI6RM6PE3L/graph.json","fetch_events":"https://pith.science/api/pith-number/RC4KKAMYWG3RSHQBYI6RM6PE3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/action/storage_attestation","attest_author":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/action/author_attestation","sign_citation":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/action/citation_signature","submit_replication":"https://pith.science/pith/RC4KKAMYWG3RSHQBYI6RM6PE3L/action/replication_record"}},"created_at":"2026-05-18T00:55:19.170773+00:00","updated_at":"2026-05-18T00:55:19.170773+00:00"}