{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AVKRT7K4GH3JMLMIBNZK3X64ZZ","short_pith_number":"pith:AVKRT7K4","canonical_record":{"source":{"id":"1504.00572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T14:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"3032845a08e544551dcba21d7cf2249767ff4b757907f66e75714b7927119a42","abstract_canon_sha256":"50d3291f1fa38cb8976bc00c05785a21ee4000e2f22940c250d877bb8f1a070b"},"schema_version":"1.0"},"canonical_sha256":"055519fd5c31f6962d880b72addfdcce4d87a529a43799408f3c39868ecea117","source":{"kind":"arxiv","id":"1504.00572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00572","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00572v1","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00572","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"AVKRT7K4GH3J","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVKRT7K4GH3JMLMI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVKRT7K4","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AVKRT7K4GH3JMLMIBNZK3X64ZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T14:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"3032845a08e544551dcba21d7cf2249767ff4b757907f66e75714b7927119a42","abstract_canon_sha256":"50d3291f1fa38cb8976bc00c05785a21ee4000e2f22940c250d877bb8f1a070b"},"schema_version":"1.0"},"canonical_sha256":"055519fd5c31f6962d880b72addfdcce4d87a529a43799408f3c39868ecea117","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.078409Z","signature_b64":"wFwvwx/zeXxl3A/BJh+iGgc02VucWzLBoi/M7E7WSyu8V9x+hdWC4g3+818dJSiB1dRp5swqqdKEUG4+kBFGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"055519fd5c31f6962d880b72addfdcce4d87a529a43799408f3c39868ecea117","last_reissued_at":"2026-05-18T02:19:43.077993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.077993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00572","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-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cb1SfivZUuaGn52AdKpJnnuRe5Cv8mCxEtpxsCYuLh7oYquI7VuKpMJZ3TpNvu0ssc+1XegpsXNYahLqM6vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:52:17.594155Z"},"content_sha256":"676d3d3bf18d7fe5ee777401e33227fefb9bf4996f47169dc8a776870e4d6375","schema_version":"1.0","event_id":"sha256:676d3d3bf18d7fe5ee777401e33227fefb9bf4996f47169dc8a776870e4d6375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AVKRT7K4GH3JMLMIBNZK3X64ZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient indexing of necklaces and irreducible polynomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Michael Saks, Mrinal Kumar, Swastik Kopparty","submitted_at":"2015-04-02T14:40:36Z","abstract_excerpt":"We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1, ... , |S|} and the set S of all irreducible, monic, univariate polynomials of degree n over a finite field F_q. This has applications in pseudorandomness, and answers an open question of Alon, Goldreich, H{\\aa}stad and Peralta[AGHP].\n  Our approach uses a connection between irreducible polynomials and necklaces ( equivalence classes of strings under cyclic ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00572","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-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aa/TUrqQBYCcTTczeuG0KFfjcPNNve1H2dBmXSYmUaTs+0R+8q/SYT32yFORiSYGaomVV7xu+/Zu9qZDC2L0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:52:17.594826Z"},"content_sha256":"b1963dd918d53cdffb3c289dfb668274c6d1fc693fbaba877d1e63e371c16c7f","schema_version":"1.0","event_id":"sha256:b1963dd918d53cdffb3c289dfb668274c6d1fc693fbaba877d1e63e371c16c7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/bundle.json","state_url":"https://pith.science/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/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-05-29T16:52:17Z","links":{"resolver":"https://pith.science/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ","bundle":"https://pith.science/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/bundle.json","state":"https://pith.science/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVKRT7K4GH3JMLMIBNZK3X64ZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AVKRT7K4GH3JMLMIBNZK3X64ZZ","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":"50d3291f1fa38cb8976bc00c05785a21ee4000e2f22940c250d877bb8f1a070b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T14:40:36Z","title_canon_sha256":"3032845a08e544551dcba21d7cf2249767ff4b757907f66e75714b7927119a42"},"schema_version":"1.0","source":{"id":"1504.00572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00572","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00572v1","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00572","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"AVKRT7K4GH3J","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVKRT7K4GH3JMLMI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVKRT7K4","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b1963dd918d53cdffb3c289dfb668274c6d1fc693fbaba877d1e63e371c16c7f","target":"graph","created_at":"2026-05-18T02:19:43Z","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 the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1, ... , |S|} and the set S of all irreducible, monic, univariate polynomials of degree n over a finite field F_q. This has applications in pseudorandomness, and answers an open question of Alon, Goldreich, H{\\aa}stad and Peralta[AGHP].\n  Our approach uses a connection between irreducible polynomials and necklaces ( equivalence classes of strings under cyclic ro","authors_text":"Michael Saks, Mrinal Kumar, Swastik Kopparty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T14:40:36Z","title":"Efficient indexing of necklaces and irreducible polynomials over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00572","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:676d3d3bf18d7fe5ee777401e33227fefb9bf4996f47169dc8a776870e4d6375","target":"record","created_at":"2026-05-18T02:19:43Z","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":"50d3291f1fa38cb8976bc00c05785a21ee4000e2f22940c250d877bb8f1a070b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T14:40:36Z","title_canon_sha256":"3032845a08e544551dcba21d7cf2249767ff4b757907f66e75714b7927119a42"},"schema_version":"1.0","source":{"id":"1504.00572","kind":"arxiv","version":1}},"canonical_sha256":"055519fd5c31f6962d880b72addfdcce4d87a529a43799408f3c39868ecea117","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"055519fd5c31f6962d880b72addfdcce4d87a529a43799408f3c39868ecea117","first_computed_at":"2026-05-18T02:19:43.077993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.077993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFwvwx/zeXxl3A/BJh+iGgc02VucWzLBoi/M7E7WSyu8V9x+hdWC4g3+818dJSiB1dRp5swqqdKEUG4+kBFGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.078409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:676d3d3bf18d7fe5ee777401e33227fefb9bf4996f47169dc8a776870e4d6375","sha256:b1963dd918d53cdffb3c289dfb668274c6d1fc693fbaba877d1e63e371c16c7f"],"state_sha256":"fb9c1035bcb8b3f499eb9d654248dcc57e14584859baf476b2c27da8a1525f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUE8VGZ+oonUJHjFVU0+2SV0hoDnzE9cC+vR6ZGQxnR/j1zPuJ/6To4tNSLmkRkm/xTRJUmAmJLmBLaHCPsmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:52:17.598025Z","bundle_sha256":"dac81eb67e28a47e8913e0362ddf820d823e48c1cc9fedf3735a22207304c194"}}