{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SSNRIROX7RVTNS5K6TRKBRCXUJ","short_pith_number":"pith:SSNRIROX","schema_version":"1.0","canonical_sha256":"949b1445d7fc6b36cbaaf4e2a0c457a2659bcb85df544d9b6bff2267be1e80d3","source":{"kind":"arxiv","id":"2507.05972","version":2},"attestation_state":"computed","paper":{"title":"Generalized and Unified Equivalences between Hardness and Pseudoentropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CC","authors_text":"Lunjia Hu, Salil Vadhan","submitted_at":"2025-07-08T13:27:03Z","abstract_excerpt":"Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and strengthens previous results for both uniform and non-uniform models of computation. Our characterization holds for a general family of entropy notions that encompasses the common notions of Shannon entropy and min entropy as special cases. Moreover, we show that the characterizations for different entropy notions can be simultaneously achieved by a single, uni"},"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":"2507.05972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T13:27:03Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"6bc76f889a650eb5e1c55e9f84eb36dfa62468169e9e62094013f999c4c1e42e","abstract_canon_sha256":"f687e4587b57a3a296ffdba3be081664d5a238140619ac26e8a6b631cb4e842f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:37.399814Z","signature_b64":"AS2UZ0BJPsCHYtcYqidBqZHaXsrdQd2FUcy8S7vDWtgPhWZ73DYgRcClZ7xmeC88PC7iz9W8c3Z6v505TNjdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949b1445d7fc6b36cbaaf4e2a0c457a2659bcb85df544d9b6bff2267be1e80d3","last_reissued_at":"2026-07-05T12:04:37.399324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:37.399324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized and Unified Equivalences between Hardness and Pseudoentropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CC","authors_text":"Lunjia Hu, Salil Vadhan","submitted_at":"2025-07-08T13:27:03Z","abstract_excerpt":"Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and strengthens previous results for both uniform and non-uniform models of computation. Our characterization holds for a general family of entropy notions that encompasses the common notions of Shannon entropy and min entropy as special cases. Moreover, we show that the characterizations for different entropy notions can be simultaneously achieved by a single, uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05972","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.05972/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":"2507.05972","created_at":"2026-07-05T12:04:37.399383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05972v2","created_at":"2026-07-05T12:04:37.399383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05972","created_at":"2026-07-05T12:04:37.399383+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSNRIROX7RVT","created_at":"2026-07-05T12:04:37.399383+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSNRIROX7RVTNS5K","created_at":"2026-07-05T12:04:37.399383+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSNRIROX","created_at":"2026-07-05T12:04:37.399383+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/SSNRIROX7RVTNS5K6TRKBRCXUJ","json":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ.json","graph_json":"https://pith.science/api/pith-number/SSNRIROX7RVTNS5K6TRKBRCXUJ/graph.json","events_json":"https://pith.science/api/pith-number/SSNRIROX7RVTNS5K6TRKBRCXUJ/events.json","paper":"https://pith.science/paper/SSNRIROX"},"agent_actions":{"view_html":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ","download_json":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ.json","view_paper":"https://pith.science/paper/SSNRIROX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05972&json=true","fetch_graph":"https://pith.science/api/pith-number/SSNRIROX7RVTNS5K6TRKBRCXUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SSNRIROX7RVTNS5K6TRKBRCXUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ/action/storage_attestation","attest_author":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ/action/author_attestation","sign_citation":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ/action/citation_signature","submit_replication":"https://pith.science/pith/SSNRIROX7RVTNS5K6TRKBRCXUJ/action/replication_record"}},"created_at":"2026-07-05T12:04:37.399383+00:00","updated_at":"2026-07-05T12:04:37.399383+00:00"}