{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FOCVTEB3A7JLRMT7WNKGYZF6UH","short_pith_number":"pith:FOCVTEB3","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"},"canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","source":{"kind":"arxiv","id":"1805.04731","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FOCVTEB3A7JLRMT7WNKGYZF6UH","target":"record","payload":{"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"},"canonical_sha256":"2b8559903b07d2b8b27fb3546c64bea1e579d28dca304e284c4f17d0031dbdfb","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"},"source_kind":"arxiv","source_id":"1805.04731","source_version":2,"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:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBBUMNScbyiJD2/pT3L2euD4kUTTT4aNYaxYe9TME9h3M/KorKeLFiKl0q/FK3Gc3bccJ5p9BYiYw1QIjbwIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:48:35.744741Z"},"content_sha256":"170278fcac3e40053479d76c4856699301e11a5bcf5fecb8c088b4d4ccf12f13","schema_version":"1.0","event_id":"sha256:170278fcac3e40053479d76c4856699301e11a5bcf5fecb8c088b4d4ccf12f13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FOCVTEB3A7JLRMT7WNKGYZF6UH","target":"graph","payload":{"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"},"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:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/emgaJFRZ9IVIFSEPgspwZuNkzF5cvwmMoBMgIv7xTd3GAfIBRb2809ZmIuo7mx7lnIOMQoVG2vXijmMs+7ECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:48:35.745082Z"},"content_sha256":"630ee548bcbe0a309ee663cb13328a25675a00d8922348dac16473c3679bbf24","schema_version":"1.0","event_id":"sha256:630ee548bcbe0a309ee663cb13328a25675a00d8922348dac16473c3679bbf24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/bundle.json","state_url":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/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-07-07T03:48:35Z","links":{"resolver":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH","bundle":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/bundle.json","state":"https://pith.science/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOCVTEB3A7JLRMT7WNKGYZF6UH/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ec/OvFOHqpP5NBA32gR8muE0CTZMYS5xaLqwgRN7J1ktq0fxo7Qt8D+hPH0FwffFwTOEF36dPF1QoOYHorXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:48:35.747012Z","bundle_sha256":"3003bf4cea01f5ae520adcef25ca8c2f9bcbd80fa589fb3459a10cd5001cbf62"}}