{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VDH4FKQODID7NSKKVQ6TGJT2FE","short_pith_number":"pith:VDH4FKQO","schema_version":"1.0","canonical_sha256":"a8cfc2aa0e1a07f6c94aac3d33267a292f86b234edf0452b4766f325dd76e58f","source":{"kind":"arxiv","id":"2606.07009","version":1},"attestation_state":"computed","paper":{"title":"Fast Bounded-Independence Functions and Their Duals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Martijn Brehm, Nicolas Resch, Yuval Ishai","submitted_at":"2026-06-05T07:53:04Z","abstract_excerpt":"We continue the study of {\\em fast} functions, computable by linear-size circuits, that share useful properties of random functions. Motivated by cryptographic applications, we generalize and improve on previous results in this area, obtaining the following results:\n  - For any constant $t$, we construct a fast $t$-wise independent hash function with algebraic degree $\\log_2 t$ (over $\\mathbb F_2$), simultaneously optimizing both asymptotic circuit size and degree.\n  - We simplify and improve a recent construction (ITCS 2026) of a family of fast codes with fast duals, both meeting the Gilbert-"},"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":"2606.07009","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-06-05T07:53:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2bd010cf3cd6f6f7850f5c75214e657f927acb15adcad1aa0e89f1a582e28941","abstract_canon_sha256":"4b2334ada88e4c053a0f39fdae6cdfd356f2d837f5d8aff49e8a4c94c9682af2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:40.988957Z","signature_b64":"xu7rt71M5tN6YMwRU/Wdg5uw/6IHBngSZegUkTJBPDAuMqD5goLvNMoDutCWvpcwjHWS2qOnhh88hEcVPvWJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8cfc2aa0e1a07f6c94aac3d33267a292f86b234edf0452b4766f325dd76e58f","last_reissued_at":"2026-06-08T01:04:40.988084Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:40.988084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Bounded-Independence Functions and Their Duals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Martijn Brehm, Nicolas Resch, Yuval Ishai","submitted_at":"2026-06-05T07:53:04Z","abstract_excerpt":"We continue the study of {\\em fast} functions, computable by linear-size circuits, that share useful properties of random functions. Motivated by cryptographic applications, we generalize and improve on previous results in this area, obtaining the following results:\n  - For any constant $t$, we construct a fast $t$-wise independent hash function with algebraic degree $\\log_2 t$ (over $\\mathbb F_2$), simultaneously optimizing both asymptotic circuit size and degree.\n  - We simplify and improve a recent construction (ITCS 2026) of a family of fast codes with fast duals, both meeting the Gilbert-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07009","kind":"arxiv","version":1},"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/2606.07009/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":"2606.07009","created_at":"2026-06-08T01:04:40.988222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07009v1","created_at":"2026-06-08T01:04:40.988222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07009","created_at":"2026-06-08T01:04:40.988222+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDH4FKQODID7","created_at":"2026-06-08T01:04:40.988222+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDH4FKQODID7NSKK","created_at":"2026-06-08T01:04:40.988222+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDH4FKQO","created_at":"2026-06-08T01:04:40.988222+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/VDH4FKQODID7NSKKVQ6TGJT2FE","json":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE.json","graph_json":"https://pith.science/api/pith-number/VDH4FKQODID7NSKKVQ6TGJT2FE/graph.json","events_json":"https://pith.science/api/pith-number/VDH4FKQODID7NSKKVQ6TGJT2FE/events.json","paper":"https://pith.science/paper/VDH4FKQO"},"agent_actions":{"view_html":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE","download_json":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE.json","view_paper":"https://pith.science/paper/VDH4FKQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07009&json=true","fetch_graph":"https://pith.science/api/pith-number/VDH4FKQODID7NSKKVQ6TGJT2FE/graph.json","fetch_events":"https://pith.science/api/pith-number/VDH4FKQODID7NSKKVQ6TGJT2FE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE/action/storage_attestation","attest_author":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE/action/author_attestation","sign_citation":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE/action/citation_signature","submit_replication":"https://pith.science/pith/VDH4FKQODID7NSKKVQ6TGJT2FE/action/replication_record"}},"created_at":"2026-06-08T01:04:40.988222+00:00","updated_at":"2026-06-08T01:04:40.988222+00:00"}