{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JPNBY2BGCPGUZWS2ZFAZDUY2SF","short_pith_number":"pith:JPNBY2BG","schema_version":"1.0","canonical_sha256":"4bda1c682613cd4cda5ac94191d31a914cc9578865384071c0f23a6950e0cc57","source":{"kind":"arxiv","id":"2311.00847","version":6},"attestation_state":"computed","paper":{"title":"Signatures From Pseudorandom States via $\\bot$-PRFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amit Behera, Lior Ozer, Louis Salvail, Mohammed Barhoush, Or Sattath","submitted_at":"2023-11-01T20:54:50Z","abstract_excerpt":"Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen (2023) have shown that logarithmic pseudorandom states can be used to construct a pseudo-deterministic PRG: informally, for a fixed seed, the output is the same with $1-1/poly$ probability.\n  In this work, we introduce new definitions for $\\bot$-PRG and $\\bot$-PRF. The correctness guarantees are that, for a fixed seed, except with negligible probability, the ou"},"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":"2311.00847","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-11-01T20:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"e983340cead52baea2ae140810cbc3745f30a719fdf557d81033f7c03d8a83aa","abstract_canon_sha256":"711036bef3e7fa41fa6ce15a7feed797a35a0ed719d7eb85d9635d3eed4147f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:09.883772Z","signature_b64":"OfQfwMKrToGtHTXBOKZlEsiRcftwPhhYzDSKEVXppf9vx4Ds6V7zqVxBBl4zU3LaLhQUVvUnIGPfYwxSm4IqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bda1c682613cd4cda5ac94191d31a914cc9578865384071c0f23a6950e0cc57","last_reissued_at":"2026-07-05T09:16:09.883363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:09.883363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signatures From Pseudorandom States via $\\bot$-PRFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amit Behera, Lior Ozer, Louis Salvail, Mohammed Barhoush, Or Sattath","submitted_at":"2023-11-01T20:54:50Z","abstract_excerpt":"Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen (2023) have shown that logarithmic pseudorandom states can be used to construct a pseudo-deterministic PRG: informally, for a fixed seed, the output is the same with $1-1/poly$ probability.\n  In this work, we introduce new definitions for $\\bot$-PRG and $\\bot$-PRF. The correctness guarantees are that, for a fixed seed, except with negligible probability, the ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00847","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.00847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.00847","created_at":"2026-07-05T09:16:09.883423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00847v6","created_at":"2026-07-05T09:16:09.883423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00847","created_at":"2026-07-05T09:16:09.883423+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPNBY2BGCPGU","created_at":"2026-07-05T09:16:09.883423+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPNBY2BGCPGUZWS2","created_at":"2026-07-05T09:16:09.883423+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPNBY2BG","created_at":"2026-07-05T09:16:09.883423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14461","citing_title":"MicroCrypt Assumptions with Quantum Input Sampling and Pseudodeterminism: Constructions and Separations","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF","json":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF.json","graph_json":"https://pith.science/api/pith-number/JPNBY2BGCPGUZWS2ZFAZDUY2SF/graph.json","events_json":"https://pith.science/api/pith-number/JPNBY2BGCPGUZWS2ZFAZDUY2SF/events.json","paper":"https://pith.science/paper/JPNBY2BG"},"agent_actions":{"view_html":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF","download_json":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF.json","view_paper":"https://pith.science/paper/JPNBY2BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00847&json=true","fetch_graph":"https://pith.science/api/pith-number/JPNBY2BGCPGUZWS2ZFAZDUY2SF/graph.json","fetch_events":"https://pith.science/api/pith-number/JPNBY2BGCPGUZWS2ZFAZDUY2SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF/action/storage_attestation","attest_author":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF/action/author_attestation","sign_citation":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF/action/citation_signature","submit_replication":"https://pith.science/pith/JPNBY2BGCPGUZWS2ZFAZDUY2SF/action/replication_record"}},"created_at":"2026-07-05T09:16:09.883423+00:00","updated_at":"2026-07-05T09:16:09.883423+00:00"}