{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FOCVTEB3A7JLRMT7WNKGYZF6UH","short_pith_number":"pith:FOCVTEB3","schema_version":"1.0","canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","source":{"kind":"arxiv","id":"1805.04731","version":2},"attestation_state":"computed","paper":{"title":"An Indexing for Quadratic Residues Modulo $N$ and a Non-uniform Efficient Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e L. Vignatti, Murilo V. G. da Silva, Nicollas M. Sdroievski","submitted_at":"2018-05-12T14:58:51Z","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"},"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":"1805.04731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-12T14:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"15b8d821f22291a88ea187f127c10c7c74217a61e1368a4eb802269fe5402574","abstract_canon_sha256":"1b223c2ad08f9b28d960fbfe8fdae1710a6128091f544c8600d83aef9f45b6f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.577915Z","signature_b64":"WioNP3MP1olCt/fLG0tXc3cbBXHuF5SoDtIHn9VBAbYhV2U0wRUt3DWZ3OiExi/q+83Ipz2tFjJF+Uqs7NmIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","last_reissued_at":"2026-05-18T00:00:08.577470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.577470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Indexing for Quadratic Residues Modulo $N$ and a Non-uniform Efficient Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e L. Vignatti, Murilo V. G. da Silva, Nicollas M. Sdroievski","submitted_at":"2018-05-12T14:58:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04731","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":"1805.04731","created_at":"2026-05-18T00:00:08.577536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04731v2","created_at":"2026-05-18T00:00:08.577536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04731","created_at":"2026-05-18T00:00:08.577536+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOCVTEB3A7JL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOCVTEB3A7JLRMT7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOCVTEB3","created_at":"2026-05-18T12:32:25.280505+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/FOCVTEB3A7JLRMT7WNKGYZF6UH","json":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH.json","graph_json":"https://pith.science/api/pith-number/FOCVTEB3A7JLRMT7WNKGYZF6UH/graph.json","events_json":"https://pith.science/api/pith-number/FOCVTEB3A7JLRMT7WNKGYZF6UH/events.json","paper":"https://pith.science/paper/FOCVTEB3"},"agent_actions":{"view_html":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH","download_json":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH.json","view_paper":"https://pith.science/paper/FOCVTEB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04731&json=true","fetch_graph":"https://pith.science/api/pith-number/FOCVTEB3A7JLRMT7WNKGYZF6UH/graph.json","fetch_events":"https://pith.science/api/pith-number/FOCVTEB3A7JLRMT7WNKGYZF6UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/action/storage_attestation","attest_author":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/action/author_attestation","sign_citation":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/action/citation_signature","submit_replication":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/action/replication_record"}},"created_at":"2026-05-18T00:00:08.577536+00:00","updated_at":"2026-05-18T00:00:08.577536+00:00"}