{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WHIIRX7KAP3JR4T72DG65VA4JP","short_pith_number":"pith:WHIIRX7K","canonical_record":{"source":{"id":"2607.28355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-30T15:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"91c3eb1d88236b79406875f471264422effed6e87ed027da6d17f9cb70e78e6e","abstract_canon_sha256":"23545b1219a0b22b5c248a7447e3688b7effd82a7b73e63f18bb673f8dc03550"},"schema_version":"1.0"},"canonical_sha256":"b1d088dfea03f698f27fd0cdeed41c4bd7822d514a5eb7f43150e9f6d5d80fe8","source":{"kind":"arxiv","id":"2607.28355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28355","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28355v1","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28355","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"WHIIRX7KAP3J","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_16","alias_value":"WHIIRX7KAP3JR4T7","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_8","alias_value":"WHIIRX7K","created_at":"2026-07-31T01:37:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WHIIRX7KAP3JR4T72DG65VA4JP","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-30T15:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"91c3eb1d88236b79406875f471264422effed6e87ed027da6d17f9cb70e78e6e","abstract_canon_sha256":"23545b1219a0b22b5c248a7447e3688b7effd82a7b73e63f18bb673f8dc03550"},"schema_version":"1.0"},"canonical_sha256":"b1d088dfea03f698f27fd0cdeed41c4bd7822d514a5eb7f43150e9f6d5d80fe8","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1d088dfea03f698f27fd0cdeed41c4bd7822d514a5eb7f43150e9f6d5d80fe8","last_reissued_at":"2026-07-31T01:37:23.599515Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:23.599515Z"},"source_kind":"arxiv","source_id":"2607.28355","source_version":1,"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-31T01:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohHcIxdMDIakfWBBUCqTfn2d+7qlkd7BIXHMGDas4+NLDoEUTAEvwOTC2Kg4bDAVwfKEslfiFnvxSq0chhx3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:20:08.325215Z"},"content_sha256":"01eca2bd46723997bc69b54ecc5a02ee64bffbc15b47508dd22658f546c80a4f","schema_version":"1.0","event_id":"sha256:01eca2bd46723997bc69b54ecc5a02ee64bffbc15b47508dd22658f546c80a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WHIIRX7KAP3JR4T72DG65VA4JP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2026-07-30T15:24:28Z","abstract_excerpt":"We study the complexity of computing the Threshold dimension of a hypothesis class and its variant, the Extended threshold dimension. For the latter, we prove that it is both NP-hard and co-NP-hard, which (partially) answers an open question of Dmitriev et al. (SODA 2026). Furthermore, by relating the problem to a variant of Maximum Balanced Biclique, we prove strong hardness of approximation for both dimensions, including in the parameterized setting.\n  As an intermediate result, we also prove hardness (of approximation) results for computing the ladder index and the semi-ladder index (Fabian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28355","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/2607.28355/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-31T01:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmTE2DgYYEyIRqD9A13lcXsdtqXD4b7I5IBBo6XFZE/IClM698oMmDygXzxfkOsAgcXc1Psr3bLpb+hPuAhGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:20:08.325616Z"},"content_sha256":"f8920286ae5e010e6b50a5f7201adbf84e5eee1998b6ec5f1ff682183d613b30","schema_version":"1.0","event_id":"sha256:f8920286ae5e010e6b50a5f7201adbf84e5eee1998b6ec5f1ff682183d613b30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHIIRX7KAP3JR4T72DG65VA4JP/bundle.json","state_url":"https://pith.science/pith/WHIIRX7KAP3JR4T72DG65VA4JP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHIIRX7KAP3JR4T72DG65VA4JP/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-06T13:20:08Z","links":{"resolver":"https://pith.science/pith/WHIIRX7KAP3JR4T72DG65VA4JP","bundle":"https://pith.science/pith/WHIIRX7KAP3JR4T72DG65VA4JP/bundle.json","state":"https://pith.science/pith/WHIIRX7KAP3JR4T72DG65VA4JP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHIIRX7KAP3JR4T72DG65VA4JP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WHIIRX7KAP3JR4T72DG65VA4JP","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":"23545b1219a0b22b5c248a7447e3688b7effd82a7b73e63f18bb673f8dc03550","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-30T15:24:28Z","title_canon_sha256":"91c3eb1d88236b79406875f471264422effed6e87ed027da6d17f9cb70e78e6e"},"schema_version":"1.0","source":{"id":"2607.28355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28355","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28355v1","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28355","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"WHIIRX7KAP3J","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_16","alias_value":"WHIIRX7KAP3JR4T7","created_at":"2026-07-31T01:37:23Z"},{"alias_kind":"pith_short_8","alias_value":"WHIIRX7K","created_at":"2026-07-31T01:37:23Z"}],"graph_snapshots":[{"event_id":"sha256:f8920286ae5e010e6b50a5f7201adbf84e5eee1998b6ec5f1ff682183d613b30","target":"graph","created_at":"2026-07-31T01:37:23Z","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/2607.28355/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the complexity of computing the Threshold dimension of a hypothesis class and its variant, the Extended threshold dimension. For the latter, we prove that it is both NP-hard and co-NP-hard, which (partially) answers an open question of Dmitriev et al. (SODA 2026). Furthermore, by relating the problem to a variant of Maximum Balanced Biclique, we prove strong hardness of approximation for both dimensions, including in the parameterized setting.\n  As an intermediate result, we also prove hardness (of approximation) results for computing the ladder index and the semi-ladder index (Fabian","authors_text":"Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28355","kind":"arxiv","version":1},"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:01eca2bd46723997bc69b54ecc5a02ee64bffbc15b47508dd22658f546c80a4f","target":"record","created_at":"2026-07-31T01:37:23Z","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":"23545b1219a0b22b5c248a7447e3688b7effd82a7b73e63f18bb673f8dc03550","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-30T15:24:28Z","title_canon_sha256":"91c3eb1d88236b79406875f471264422effed6e87ed027da6d17f9cb70e78e6e"},"schema_version":"1.0","source":{"id":"2607.28355","kind":"arxiv","version":1}},"canonical_sha256":"b1d088dfea03f698f27fd0cdeed41c4bd7822d514a5eb7f43150e9f6d5d80fe8","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1d088dfea03f698f27fd0cdeed41c4bd7822d514a5eb7f43150e9f6d5d80fe8","first_computed_at":"2026-07-31T01:37:23.599515Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:37:23.599515Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01eca2bd46723997bc69b54ecc5a02ee64bffbc15b47508dd22658f546c80a4f","sha256:f8920286ae5e010e6b50a5f7201adbf84e5eee1998b6ec5f1ff682183d613b30"],"state_sha256":"fe6bc87dfe613a0a5f043f5abd0518a63109cb35cffaada1305085f441abad69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2wsnC5VA4pPsOQl0gA7ra8T4JwzRjJ0y7XzwdvJHGF4hyK3+Jiah038g8rEsgHgHxfIMRziTsf/Y3NrSo67Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:20:08.329490Z","bundle_sha256":"c7e3a4f2ff6e06426c774e4052502516497fa9e070e572e23cda7415219348ff"}}