{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2TL5FDGGBWUDVCCMVVASOOQZGC","short_pith_number":"pith:2TL5FDGG","schema_version":"1.0","canonical_sha256":"d4d7d28cc60da83a884cad41273a1930ae17b803c64f6cd243dc5592b37de2d8","source":{"kind":"arxiv","id":"2503.17114","version":2},"attestation_state":"computed","paper":{"title":"Range Avoidance in Boolean Circuits via Turan-type Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Neha Kuntewar","submitted_at":"2025-03-21T12:58:38Z","abstract_excerpt":"Given a circuit $C : \\{0,1\\}^n \\to \\{0,1\\}^m$ from a circuit class $F$, with $m > n$, finding a $y \\in \\{0,1\\}^m$ such that $\\forall x \\in \\{0,1\\}^n$, $C(x) \\ne y$, is the range avoidance problem (denoted by $F$-$avoid$). Deterministic polynomial time algorithms (even with access to $NP$ oracles) solving this problem is known to imply explicit constructions of various pseudorandom objects like hard Boolean functions, linear codes, PRGs etc. Deterministic polynomial time algorithms are known for $NC^0_2$-$avoid$ when $m > n$, and for $NC^0_3$-$avoid$ when $m \\ge \\frac{n^2}{\\log n}$, where $NC^0"},"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":"2503.17114","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-03-21T12:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"c3aeb6f05ed3ddd4dad466d9c0bc008abc0c01a9633992b1734cc575267cc9a0","abstract_canon_sha256":"8d246b5a6b9250f13da23f781cf4d53afd339f8de4c6dcbf91b7b3531f4e59ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:29.771959Z","signature_b64":"RiAMn149FtlsC1h807xzsjPGlaJHVAz9jSvyCmJfYzI4ER5A+7U22df51zYO7Kfz0XbetJ5Qxtnabd6Wz8nyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d7d28cc60da83a884cad41273a1930ae17b803c64f6cd243dc5592b37de2d8","last_reissued_at":"2026-07-05T11:36:29.771507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:29.771507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Range Avoidance in Boolean Circuits via Turan-type Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Neha Kuntewar","submitted_at":"2025-03-21T12:58:38Z","abstract_excerpt":"Given a circuit $C : \\{0,1\\}^n \\to \\{0,1\\}^m$ from a circuit class $F$, with $m > n$, finding a $y \\in \\{0,1\\}^m$ such that $\\forall x \\in \\{0,1\\}^n$, $C(x) \\ne y$, is the range avoidance problem (denoted by $F$-$avoid$). Deterministic polynomial time algorithms (even with access to $NP$ oracles) solving this problem is known to imply explicit constructions of various pseudorandom objects like hard Boolean functions, linear codes, PRGs etc. Deterministic polynomial time algorithms are known for $NC^0_2$-$avoid$ when $m > n$, and for $NC^0_3$-$avoid$ when $m \\ge \\frac{n^2}{\\log n}$, where $NC^0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17114","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/2503.17114/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":"2503.17114","created_at":"2026-07-05T11:36:29.771564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.17114v2","created_at":"2026-07-05T11:36:29.771564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17114","created_at":"2026-07-05T11:36:29.771564+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TL5FDGGBWUD","created_at":"2026-07-05T11:36:29.771564+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TL5FDGGBWUDVCCM","created_at":"2026-07-05T11:36:29.771564+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TL5FDGG","created_at":"2026-07-05T11:36:29.771564+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/2TL5FDGGBWUDVCCMVVASOOQZGC","json":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC.json","graph_json":"https://pith.science/api/pith-number/2TL5FDGGBWUDVCCMVVASOOQZGC/graph.json","events_json":"https://pith.science/api/pith-number/2TL5FDGGBWUDVCCMVVASOOQZGC/events.json","paper":"https://pith.science/paper/2TL5FDGG"},"agent_actions":{"view_html":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC","download_json":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC.json","view_paper":"https://pith.science/paper/2TL5FDGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.17114&json=true","fetch_graph":"https://pith.science/api/pith-number/2TL5FDGGBWUDVCCMVVASOOQZGC/graph.json","fetch_events":"https://pith.science/api/pith-number/2TL5FDGGBWUDVCCMVVASOOQZGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC/action/storage_attestation","attest_author":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC/action/author_attestation","sign_citation":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC/action/citation_signature","submit_replication":"https://pith.science/pith/2TL5FDGGBWUDVCCMVVASOOQZGC/action/replication_record"}},"created_at":"2026-07-05T11:36:29.771564+00:00","updated_at":"2026-07-05T11:36:29.771564+00:00"}