{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FOCVTEB3A7JLRMT7WNKGYZF6UH","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":"1b223c2ad08f9b28d960fbfe8fdae1710a6128091f544c8600d83aef9f45b6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T14:58:51Z","title_canon_sha256":"15b8d821f22291a88ea187f127c10c7c74217a61e1368a4eb802269fe5402574"},"schema_version":"1.0","source":{"id":"1805.04731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04731","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04731v2","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04731","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"FOCVTEB3A7JL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FOCVTEB3A7JLRMT7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FOCVTEB3","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:630ee548bcbe0a309ee663cb13328a25675a00d8922348dac16473c3679bbf24","target":"graph","created_at":"2026-05-18T00:00:08Z","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":"An \\emph{indexing} of a finite set $S$ is a bijection $D : \\{1,...,|S|\\} \\rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of $N$. One consequence of this result is a procedure for sampling quadratic residues modulo $N$, when the factorization of $N$ is known, that runs in strict polynomial time and requires the theoretical minimum amount of random bits (i.e., $\\log{(\\phi(N)/2^r)}$ bits, where $\\phi(N)$ is Euler's totient function and $r$ is the number of distinct prime factors of","authors_text":"Andr\\'e L. Vignatti, Murilo V. G. da Silva, Nicollas M. Sdroievski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T14:58:51Z","title":"An Indexing for Quadratic Residues Modulo $N$ and a Non-uniform Efficient Decoding Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04731","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:170278fcac3e40053479d76c4856699301e11a5bcf5fecb8c088b4d4ccf12f13","target":"record","created_at":"2026-05-18T00:00:08Z","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":"1b223c2ad08f9b28d960fbfe8fdae1710a6128091f544c8600d83aef9f45b6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T14:58:51Z","title_canon_sha256":"15b8d821f22291a88ea187f127c10c7c74217a61e1368a4eb802269fe5402574"},"schema_version":"1.0","source":{"id":"1805.04731","kind":"arxiv","version":2}},"canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","first_computed_at":"2026-05-18T00:00:08.577470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:08.577470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WioNP3MP1olCt/fLG0tXc3cbBXHuF5SoDtIHn9VBAbYhV2U0wRUt3DWZ3OiExi/q+83Ipz2tFjJF+Uqs7NmIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:08.577915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:170278fcac3e40053479d76c4856699301e11a5bcf5fecb8c088b4d4ccf12f13","sha256:630ee548bcbe0a309ee663cb13328a25675a00d8922348dac16473c3679bbf24"],"state_sha256":"fd5901b6d93089165820057a20bf348bcf51e53890f9d778ffffd991f632920e"}