{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZDQLFB2FUD2XDZD3K5JQQ2WINB","short_pith_number":"pith:ZDQLFB2F","schema_version":"1.0","canonical_sha256":"c8e0b28745a0f571e47b5753086ac8686a58e8e98c798f2efbae20e12da53374","source":{"kind":"arxiv","id":"2010.05586","version":2},"attestation_state":"computed","paper":{"title":"Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hoeteck Wee, Iftach Haitner, Omer Reingold, Salil Vadhan","submitted_at":"2020-10-12T10:23:05Z","abstract_excerpt":"We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at most k if the following holds: when conditioning on its prior coin tosses, no polynomial-time strategy $\\widetilde{G}$ can generate valid output for G's i'th output block with entropy greater than k. A generator has inaccessible entropy if the total accessible entropy (summed over the blocks) is noticeably smaller than the real entropy of G's output.\n  As an a"},"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":"2010.05586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-10-12T10:23:05Z","cross_cats_sorted":[],"title_canon_sha256":"450446129b40b82ab0cddc41199722f8cb9816bbfcb8a2825a792324944e43b2","abstract_canon_sha256":"3d28a0905fa81b8275da6b681436e1fa5b77c21c28c1ca300e9995def98fe2a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:44.525407Z","signature_b64":"kkoRZZ+GvmCDDWfT+DvxzQEwpQn0kWBLjWgQqWUlVe+0PFQooJji+7AdU9+9V/R/q4RK/aGZ43mRlVOgaKCeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8e0b28745a0f571e47b5753086ac8686a58e8e98c798f2efbae20e12da53374","last_reissued_at":"2026-07-05T03:07:44.524971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:44.524971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hoeteck Wee, Iftach Haitner, Omer Reingold, Salil Vadhan","submitted_at":"2020-10-12T10:23:05Z","abstract_excerpt":"We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at most k if the following holds: when conditioning on its prior coin tosses, no polynomial-time strategy $\\widetilde{G}$ can generate valid output for G's i'th output block with entropy greater than k. A generator has inaccessible entropy if the total accessible entropy (summed over the blocks) is noticeably smaller than the real entropy of G's output.\n  As an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05586","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/2010.05586/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":"2010.05586","created_at":"2026-07-05T03:07:44.525020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.05586v2","created_at":"2026-07-05T03:07:44.525020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05586","created_at":"2026-07-05T03:07:44.525020+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDQLFB2FUD2X","created_at":"2026-07-05T03:07:44.525020+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDQLFB2FUD2XDZD3","created_at":"2026-07-05T03:07:44.525020+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDQLFB2F","created_at":"2026-07-05T03:07:44.525020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.20472","citing_title":"Computational relative entropy","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB","json":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB.json","graph_json":"https://pith.science/api/pith-number/ZDQLFB2FUD2XDZD3K5JQQ2WINB/graph.json","events_json":"https://pith.science/api/pith-number/ZDQLFB2FUD2XDZD3K5JQQ2WINB/events.json","paper":"https://pith.science/paper/ZDQLFB2F"},"agent_actions":{"view_html":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB","download_json":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB.json","view_paper":"https://pith.science/paper/ZDQLFB2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.05586&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDQLFB2FUD2XDZD3K5JQQ2WINB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDQLFB2FUD2XDZD3K5JQQ2WINB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB/action/storage_attestation","attest_author":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB/action/author_attestation","sign_citation":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB/action/citation_signature","submit_replication":"https://pith.science/pith/ZDQLFB2FUD2XDZD3K5JQQ2WINB/action/replication_record"}},"created_at":"2026-07-05T03:07:44.525020+00:00","updated_at":"2026-07-05T03:07:44.525020+00:00"}