{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CBCGFZRHVFUBJNNXOHTR2XOGUG","short_pith_number":"pith:CBCGFZRH","canonical_record":{"source":{"id":"2602.00754","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-01-31T14:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"043f213d517d09382ce63c0d04fb64c4ddc0d7179e2bb2f357d24e893702aa1b","abstract_canon_sha256":"d492811a0cea3bc5beefb80f12b8c2fc78eac203aab6541d9e9c185b3a1701ac"},"schema_version":"1.0"},"canonical_sha256":"104462e627a96814b5b771e71d5dc6a1ba200ad1d40b77f9f29e48434f8f690f","source":{"kind":"arxiv","id":"2602.00754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00754","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00754v2","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00754","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"CBCGFZRHVFUB","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"CBCGFZRHVFUBJNNX","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"CBCGFZRH","created_at":"2026-05-22T01:03:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CBCGFZRHVFUBJNNXOHTR2XOGUG","target":"record","payload":{"canonical_record":{"source":{"id":"2602.00754","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-01-31T14:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"043f213d517d09382ce63c0d04fb64c4ddc0d7179e2bb2f357d24e893702aa1b","abstract_canon_sha256":"d492811a0cea3bc5beefb80f12b8c2fc78eac203aab6541d9e9c185b3a1701ac"},"schema_version":"1.0"},"canonical_sha256":"104462e627a96814b5b771e71d5dc6a1ba200ad1d40b77f9f29e48434f8f690f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:55.534180Z","signature_b64":"Q4aUnv2CgIVY7f2/zBDNl/M2HznnPeo6BRlU/gSEXFmqX0NrQrKeYhz4B6vB32HEJQGaBTw+nOmJ4D3O95N0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"104462e627a96814b5b771e71d5dc6a1ba200ad1d40b77f9f29e48434f8f690f","last_reissued_at":"2026-05-22T01:03:55.533175Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:55.533175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.00754","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-05-22T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDpu1zCWdlIXaUojx51+lfyfeZhfAJJ++IG648EMjoyK/ir0lZsklB9JGfVSoOSGRR7W1e6BuGLi4r7/LghXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:54:57.607002Z"},"content_sha256":"0cb48b3b5c219d7a7dc29a250f95817a571bd69b4f249ec46b217dff151993fb","schema_version":"1.0","event_id":"sha256:0cb48b3b5c219d7a7dc29a250f95817a571bd69b4f249ec46b217dff151993fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CBCGFZRHVFUBJNNXOHTR2XOGUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for Hardness Condensation in the Query Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chandrima Kayal, Jayalal Sarma, Karthikeya Polisetty, Manaswi Paraashar, Nitin Saurabh, Rajat Mittal, Sai Soumya Nalli","submitted_at":"2026-01-31T14:39:24Z","abstract_excerpt":"For any Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ with a complexity measure having value $k \\ll n$, is it possible to restrict the function $f$ to $\\Theta(k)$ variables while keeping the complexity preserved at $\\Theta(k)$? This question, in the context of query complexity, was recently studied by G{\\\"{o}}{\\\"{o}}s, Newman, Riazanov and Sokolov (STOC 2024). They showed, among other results, that query complexity can not be condensed losslessly. They asked if complexity measures like block sensitivity or unambiguous certificate complexity can be condensed losslessly?\n  In this work, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00754","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/2602.00754/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-05-22T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxqfIbx/5WYVScYDTxB40uaJEGuggruR9oh347jB5+VK9vzSoviVOlFYV1r/eN0IkKjBgyUjWn+Pg76Vg+TWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:54:57.607450Z"},"content_sha256":"07bd2a6f0bc6d06d0da5575c00c6cc05e7a57400d03c052cd7c0030f9d064be6","schema_version":"1.0","event_id":"sha256:07bd2a6f0bc6d06d0da5575c00c6cc05e7a57400d03c052cd7c0030f9d064be6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/bundle.json","state_url":"https://pith.science/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/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-05-23T08:54:57Z","links":{"resolver":"https://pith.science/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG","bundle":"https://pith.science/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/bundle.json","state":"https://pith.science/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBCGFZRHVFUBJNNXOHTR2XOGUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CBCGFZRHVFUBJNNXOHTR2XOGUG","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":"d492811a0cea3bc5beefb80f12b8c2fc78eac203aab6541d9e9c185b3a1701ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-01-31T14:39:24Z","title_canon_sha256":"043f213d517d09382ce63c0d04fb64c4ddc0d7179e2bb2f357d24e893702aa1b"},"schema_version":"1.0","source":{"id":"2602.00754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00754","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00754v2","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00754","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"CBCGFZRHVFUB","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"CBCGFZRHVFUBJNNX","created_at":"2026-05-22T01:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"CBCGFZRH","created_at":"2026-05-22T01:03:55Z"}],"graph_snapshots":[{"event_id":"sha256:07bd2a6f0bc6d06d0da5575c00c6cc05e7a57400d03c052cd7c0030f9d064be6","target":"graph","created_at":"2026-05-22T01:03:55Z","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/2602.00754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For any Boolean function $f:\\{0,1\\}^n \\to \\{0,1\\}$ with a complexity measure having value $k \\ll n$, is it possible to restrict the function $f$ to $\\Theta(k)$ variables while keeping the complexity preserved at $\\Theta(k)$? This question, in the context of query complexity, was recently studied by G{\\\"{o}}{\\\"{o}}s, Newman, Riazanov and Sokolov (STOC 2024). They showed, among other results, that query complexity can not be condensed losslessly. They asked if complexity measures like block sensitivity or unambiguous certificate complexity can be condensed losslessly?\n  In this work, we show tha","authors_text":"Chandrima Kayal, Jayalal Sarma, Karthikeya Polisetty, Manaswi Paraashar, Nitin Saurabh, Rajat Mittal, Sai Soumya Nalli","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-01-31T14:39:24Z","title":"Bounds for Hardness Condensation in the Query Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00754","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:0cb48b3b5c219d7a7dc29a250f95817a571bd69b4f249ec46b217dff151993fb","target":"record","created_at":"2026-05-22T01:03:55Z","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":"d492811a0cea3bc5beefb80f12b8c2fc78eac203aab6541d9e9c185b3a1701ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-01-31T14:39:24Z","title_canon_sha256":"043f213d517d09382ce63c0d04fb64c4ddc0d7179e2bb2f357d24e893702aa1b"},"schema_version":"1.0","source":{"id":"2602.00754","kind":"arxiv","version":2}},"canonical_sha256":"104462e627a96814b5b771e71d5dc6a1ba200ad1d40b77f9f29e48434f8f690f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"104462e627a96814b5b771e71d5dc6a1ba200ad1d40b77f9f29e48434f8f690f","first_computed_at":"2026-05-22T01:03:55.533175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:55.533175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4aUnv2CgIVY7f2/zBDNl/M2HznnPeo6BRlU/gSEXFmqX0NrQrKeYhz4B6vB32HEJQGaBTw+nOmJ4D3O95N0BQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:55.534180Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.00754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb48b3b5c219d7a7dc29a250f95817a571bd69b4f249ec46b217dff151993fb","sha256:07bd2a6f0bc6d06d0da5575c00c6cc05e7a57400d03c052cd7c0030f9d064be6"],"state_sha256":"462794a26d1c9b9c500e626f8eaedd89e68dab21e06a97befa7c5a7d2ea16dfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zn2LAXK2zATry1ULSRk9A+tlm5BKYSPL7AGoFJOvHMt1bpReuNmLEYJMl1RRaysznjzbDU1V3QoyZxHyv19Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:54:57.610517Z","bundle_sha256":"ffba6fe35ec88aff47d20f9c65765244d0b4ed5cb67e5dedde4bdbabf6776ef8"}}