{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JJ4QCM5AJBNRPV3ESLUAKQU2OF","short_pith_number":"pith:JJ4QCM5A","canonical_record":{"source":{"id":"2303.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-01T06:17:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b64db0b07838bd53868c275cc716f8b6d3b83fa4a95fbeba300a956726e0ee23","abstract_canon_sha256":"cf6698a3eaab644162e19af1bf8fe86417596c37253cbca45c1b08eb80532564"},"schema_version":"1.0"},"canonical_sha256":"4a790133a0485b17d76492e805429a7153a271d3eae42db8778b800a4c26c7d3","source":{"kind":"arxiv","id":"2303.00252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00252","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00252v1","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00252","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJ4QCM5AJBNR","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"JJ4QCM5AJBNRPV3E","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"JJ4QCM5A","created_at":"2026-07-05T05:47:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JJ4QCM5AJBNRPV3ESLUAKQU2OF","target":"record","payload":{"canonical_record":{"source":{"id":"2303.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-01T06:17:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b64db0b07838bd53868c275cc716f8b6d3b83fa4a95fbeba300a956726e0ee23","abstract_canon_sha256":"cf6698a3eaab644162e19af1bf8fe86417596c37253cbca45c1b08eb80532564"},"schema_version":"1.0"},"canonical_sha256":"4a790133a0485b17d76492e805429a7153a271d3eae42db8778b800a4c26c7d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:07.023253Z","signature_b64":"ziI9HH/K2Ww/jdkdi+FhUU6Ceiv1mjEkvlnTARWRSgYKXH64L1envSF2/7SM7QHzFwDgA3x73DK++raOWUjQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a790133a0485b17d76492e805429a7153a271d3eae42db8778b800a4c26c7d3","last_reissued_at":"2026-07-05T05:47:07.022855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:07.022855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.00252","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-05T05:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJiDVICLEICMOoiW1fqBxR3UsJDn5xylSkIPcVrQVGV9+fsqLyM2Thdsy3DY26lrjmuc6Vtvy7TJKHv4wfEpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:04:48.107068Z"},"content_sha256":"df70a638947f516f21714c5e53a0cf3167ceed0d8a965a748dffbebbfdef7c3a","schema_version":"1.0","event_id":"sha256:df70a638947f516f21714c5e53a0cf3167ceed0d8a965a748dffbebbfdef7c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JJ4QCM5AJBNRPV3ESLUAKQU2OF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is Planted Coloring Easier than Planted Clique?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexander S. Wein, Jeff Xu, Pravesh K. Kothari, Santosh S. Vempala","submitted_at":"2023-03-01T06:17:54Z","abstract_excerpt":"We study the computational complexity of two related problems: recovering a planted $q$-coloring in $G(n,1/2)$, and finding efficiently verifiable witnesses of non-$q$-colorability (a.k.a. refutations) in $G(n,1/2)$. Our main results show hardness for both these problems in a restricted-but-powerful class of algorithms based on computing low-degree polynomials in the inputs.\n  The problem of recovering a planted $q$-coloring is equivalent to recovering $q$ disjoint planted cliques that cover all the vertices -- a potentially easier variant of the well-studied planted clique problem. Our first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00252","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/2303.00252/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-05T05:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4VbBCIUk4RV4TsP5fqU/b9n4lUp/Qrf9kom9vUNRGo2Lz5chMPGR5Mcfg3kFkVWKTa0bAiJRwbYYUVZbGomBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T02:04:48.107594Z"},"content_sha256":"2c115a27443dd8ae5e1fdc532d73597d2b575f697e9d711937a447efc89629f3","schema_version":"1.0","event_id":"sha256:2c115a27443dd8ae5e1fdc532d73597d2b575f697e9d711937a447efc89629f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/bundle.json","state_url":"https://pith.science/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/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-22T02:04:48Z","links":{"resolver":"https://pith.science/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF","bundle":"https://pith.science/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/bundle.json","state":"https://pith.science/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ4QCM5AJBNRPV3ESLUAKQU2OF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JJ4QCM5AJBNRPV3ESLUAKQU2OF","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":"cf6698a3eaab644162e19af1bf8fe86417596c37253cbca45c1b08eb80532564","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-01T06:17:54Z","title_canon_sha256":"b64db0b07838bd53868c275cc716f8b6d3b83fa4a95fbeba300a956726e0ee23"},"schema_version":"1.0","source":{"id":"2303.00252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00252","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00252v1","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00252","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJ4QCM5AJBNR","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"JJ4QCM5AJBNRPV3E","created_at":"2026-07-05T05:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"JJ4QCM5A","created_at":"2026-07-05T05:47:07Z"}],"graph_snapshots":[{"event_id":"sha256:2c115a27443dd8ae5e1fdc532d73597d2b575f697e9d711937a447efc89629f3","target":"graph","created_at":"2026-07-05T05:47:07Z","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.00252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computational complexity of two related problems: recovering a planted $q$-coloring in $G(n,1/2)$, and finding efficiently verifiable witnesses of non-$q$-colorability (a.k.a. refutations) in $G(n,1/2)$. Our main results show hardness for both these problems in a restricted-but-powerful class of algorithms based on computing low-degree polynomials in the inputs.\n  The problem of recovering a planted $q$-coloring is equivalent to recovering $q$ disjoint planted cliques that cover all the vertices -- a potentially easier variant of the well-studied planted clique problem. Our first ","authors_text":"Alexander S. Wein, Jeff Xu, Pravesh K. Kothari, Santosh S. Vempala","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-01T06:17:54Z","title":"Is Planted Coloring Easier than Planted Clique?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00252","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:df70a638947f516f21714c5e53a0cf3167ceed0d8a965a748dffbebbfdef7c3a","target":"record","created_at":"2026-07-05T05:47:07Z","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":"cf6698a3eaab644162e19af1bf8fe86417596c37253cbca45c1b08eb80532564","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-01T06:17:54Z","title_canon_sha256":"b64db0b07838bd53868c275cc716f8b6d3b83fa4a95fbeba300a956726e0ee23"},"schema_version":"1.0","source":{"id":"2303.00252","kind":"arxiv","version":1}},"canonical_sha256":"4a790133a0485b17d76492e805429a7153a271d3eae42db8778b800a4c26c7d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a790133a0485b17d76492e805429a7153a271d3eae42db8778b800a4c26c7d3","first_computed_at":"2026-07-05T05:47:07.022855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:07.022855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ziI9HH/K2Ww/jdkdi+FhUU6Ceiv1mjEkvlnTARWRSgYKXH64L1envSF2/7SM7QHzFwDgA3x73DK++raOWUjQBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:07.023253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.00252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df70a638947f516f21714c5e53a0cf3167ceed0d8a965a748dffbebbfdef7c3a","sha256:2c115a27443dd8ae5e1fdc532d73597d2b575f697e9d711937a447efc89629f3"],"state_sha256":"74354a693a912117a8324ab6873f0dcb41a495b6608353f2d6458bfcb5bc501b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+hEh0Jj73fHMk4ZAKP9AYwN0v1jyLkcOj82HKH/Ee/wPn8CbU40XZPPTXjoqQPIf5f33/qI9wdzMclJm2d7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T02:04:48.112485Z","bundle_sha256":"828ea4698dfdd0fea6a289bf8b8ee398550874d8ddb6789eeee75b28f4c819ae"}}