{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:F3M4UO52TMEOYINDO25GJQJ4FK","short_pith_number":"pith:F3M4UO52","canonical_record":{"source":{"id":"2303.05044","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2023-03-09T05:46:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3f985bb482cb2b52213105d179f01f94d54b5b0eb67c7dafaec4cc99128841f","abstract_canon_sha256":"a8e0908ce09383ebef3c7fea4676548215bfb42383becc06aa86395867a1ebe6"},"schema_version":"1.0"},"canonical_sha256":"2ed9ca3bba9b08ec21a376ba64c13c2a88c07f4a7f6ff2f406c090919f7db0d0","source":{"kind":"arxiv","id":"2303.05044","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.05044","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"2303.05044v2","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05044","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"F3M4UO52TMEO","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"F3M4UO52TMEOYIND","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"F3M4UO52","created_at":"2026-07-05T06:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:F3M4UO52TMEOYINDO25GJQJ4FK","target":"record","payload":{"canonical_record":{"source":{"id":"2303.05044","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2023-03-09T05:46:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3f985bb482cb2b52213105d179f01f94d54b5b0eb67c7dafaec4cc99128841f","abstract_canon_sha256":"a8e0908ce09383ebef3c7fea4676548215bfb42383becc06aa86395867a1ebe6"},"schema_version":"1.0"},"canonical_sha256":"2ed9ca3bba9b08ec21a376ba64c13c2a88c07f4a7f6ff2f406c090919f7db0d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:35.206438Z","signature_b64":"uihbd/+3JYpnawGaXzd4nvQrSIqqxIVzclwPD91kEqsspFkAVD7uGpk2O2C0DgIe7qmgz7am4+9ceYLo3K6OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed9ca3bba9b08ec21a376ba64c13c2a88c07f4a7f6ff2f406c090919f7db0d0","last_reissued_at":"2026-07-05T06:28:35.205941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:35.205941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.05044","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAIIdSfVszYPcVWQUsF9JUJYbYhUy96ilvykNr5Q6TSzZ3DiROnnBUhrwzMTA8r0Obj7TLDKcYL26tv/I8moBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:24:43.718218Z"},"content_sha256":"b59fc34ad4a20ec49f96b3b2a55555efa643c100e05e533ebcabdac5ac12e294","schema_version":"1.0","event_id":"sha256:b59fc34ad4a20ec49f96b3b2a55555efa643c100e05e533ebcabdac5ac12e294"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:F3M4UO52TMEOYINDO25GJQJ4FK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexander Golovnev, Karthik Gajulapalli, Satyajeet Nagargoje, Sidhant Saraogi","submitted_at":"2023-03-09T05:46:53Z","abstract_excerpt":"Range Avoidance (AVOID) is a total search problem where, given a Boolean circuit $C\\colon\\{0,1\\}^n\\to\\{0,1\\}^m$, $m>n$, the task is to find a $y\\in\\{0,1\\}^m$ outside the range of $C$. For an integer $k\\geq 2$, $\\mathrm{NC}^0_k$-AVOID is a special case of AVOID where each output bit of $C$ depends on at most $k$ input bits. While there is a very natural randomized algorithm for AVOID, a deterministic algorithm for the problem would have many interesting consequences. Ren, Santhanam, and Wang (FOCS 2022) and Guruswami, Lyu, and Wang (RANDOM 2022) proved that explicit constructions of functions o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05044","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/2303.05044/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/veImm75VUQKH6sRoCbq22LgrodWIJaK/DXipPlsQqFduGTePBL7TUYeNCw5rGJCt/+UuaP/Peq7hf6UfhzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:24:43.718865Z"},"content_sha256":"988d9058f0ed4a797749c62efd19802c73464bb878179a6c3b72e136f2d129a0","schema_version":"1.0","event_id":"sha256:988d9058f0ed4a797749c62efd19802c73464bb878179a6c3b72e136f2d129a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3M4UO52TMEOYINDO25GJQJ4FK/bundle.json","state_url":"https://pith.science/pith/F3M4UO52TMEOYINDO25GJQJ4FK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3M4UO52TMEOYINDO25GJQJ4FK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T17:24:43Z","links":{"resolver":"https://pith.science/pith/F3M4UO52TMEOYINDO25GJQJ4FK","bundle":"https://pith.science/pith/F3M4UO52TMEOYINDO25GJQJ4FK/bundle.json","state":"https://pith.science/pith/F3M4UO52TMEOYINDO25GJQJ4FK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3M4UO52TMEOYINDO25GJQJ4FK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:F3M4UO52TMEOYINDO25GJQJ4FK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a8e0908ce09383ebef3c7fea4676548215bfb42383becc06aa86395867a1ebe6","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2023-03-09T05:46:53Z","title_canon_sha256":"d3f985bb482cb2b52213105d179f01f94d54b5b0eb67c7dafaec4cc99128841f"},"schema_version":"1.0","source":{"id":"2303.05044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.05044","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"2303.05044v2","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05044","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"F3M4UO52TMEO","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"F3M4UO52TMEOYIND","created_at":"2026-07-05T06:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"F3M4UO52","created_at":"2026-07-05T06:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:988d9058f0ed4a797749c62efd19802c73464bb878179a6c3b72e136f2d129a0","target":"graph","created_at":"2026-07-05T06:28:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.05044/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Range Avoidance (AVOID) is a total search problem where, given a Boolean circuit $C\\colon\\{0,1\\}^n\\to\\{0,1\\}^m$, $m>n$, the task is to find a $y\\in\\{0,1\\}^m$ outside the range of $C$. For an integer $k\\geq 2$, $\\mathrm{NC}^0_k$-AVOID is a special case of AVOID where each output bit of $C$ depends on at most $k$ input bits. While there is a very natural randomized algorithm for AVOID, a deterministic algorithm for the problem would have many interesting consequences. Ren, Santhanam, and Wang (FOCS 2022) and Guruswami, Lyu, and Wang (RANDOM 2022) proved that explicit constructions of functions o","authors_text":"Alexander Golovnev, Karthik Gajulapalli, Satyajeet Nagargoje, Sidhant Saraogi","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2023-03-09T05:46:53Z","title":"Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05044","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b59fc34ad4a20ec49f96b3b2a55555efa643c100e05e533ebcabdac5ac12e294","target":"record","created_at":"2026-07-05T06:28:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a8e0908ce09383ebef3c7fea4676548215bfb42383becc06aa86395867a1ebe6","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2023-03-09T05:46:53Z","title_canon_sha256":"d3f985bb482cb2b52213105d179f01f94d54b5b0eb67c7dafaec4cc99128841f"},"schema_version":"1.0","source":{"id":"2303.05044","kind":"arxiv","version":2}},"canonical_sha256":"2ed9ca3bba9b08ec21a376ba64c13c2a88c07f4a7f6ff2f406c090919f7db0d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ed9ca3bba9b08ec21a376ba64c13c2a88c07f4a7f6ff2f406c090919f7db0d0","first_computed_at":"2026-07-05T06:28:35.205941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:28:35.205941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uihbd/+3JYpnawGaXzd4nvQrSIqqxIVzclwPD91kEqsspFkAVD7uGpk2O2C0DgIe7qmgz7am4+9ceYLo3K6OBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:28:35.206438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.05044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b59fc34ad4a20ec49f96b3b2a55555efa643c100e05e533ebcabdac5ac12e294","sha256:988d9058f0ed4a797749c62efd19802c73464bb878179a6c3b72e136f2d129a0"],"state_sha256":"e9f689352013aeca4d02e0ca75791e1c5dc533bf509bdf80672a395411b69509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jFGyjXj/4D6zebizUuxP0l8tcRsS/D5s8K5HZafUTIg2PXSpA4axD0Wy2SGz1YK0A+4iluzS9jrQZaus/xXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:24:43.734256Z","bundle_sha256":"834875466d0ea1831490a02a777164327ae871860456b5e471f5f5a0a4683f8b"}}