{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","short_pith_number":"pith:J4ZXOQTJ","canonical_record":{"source":{"id":"1809.06950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T21:57:20Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"92ecc8cb0cf29f1dbc695a486038532976816928b2ad9e0d02c6f6bd3eacd460","abstract_canon_sha256":"0a9d4582f3b35bfce17016f79a180e7c208e086b299016f10fa07a2d9a4f4eb8"},"schema_version":"1.0"},"canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","source":{"kind":"arxiv","id":"1809.06950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06950","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06950v1","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06950","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"J4ZXOQTJ2QNQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J4ZXOQTJ2QNQ6YT5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J4ZXOQTJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T21:57:20Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"92ecc8cb0cf29f1dbc695a486038532976816928b2ad9e0d02c6f6bd3eacd460","abstract_canon_sha256":"0a9d4582f3b35bfce17016f79a180e7c208e086b299016f10fa07a2d9a4f4eb8"},"schema_version":"1.0"},"canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.086756Z","signature_b64":"JJiK2wzi/bAMofZHA/ih4/+gdOoQ1NuYAbSpWjLiHvLgsCzEmg8IDeBkVPGszZHpZyct1GCexj7h4Gep2LFfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","last_reissued_at":"2026-05-18T00:05:21.086185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.086185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06950","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-05-18T00:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWcZmYjqIIjr5etiX/dHkh78l8UBUNSn2Btm0CrmLPMWZhlHcF+3dalLjtkvfh/zi3RlVnqm5/8HpppIVMaMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:35:32.270280Z"},"content_sha256":"ef5e56121445bc5033097eb700734d1720c30a87f36cb7e794154f4a89e1393f","schema_version":"1.0","event_id":"sha256:ef5e56121445bc5033097eb700734d1720c30a87f36cb7e794154f4a89e1393f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding cliques using few probes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"David Gamarnik, Joe Neeman, Mikl\\'os Z. R\\'acz, Prasad Tetali, Uriel Feige","submitted_at":"2018-09-18T21:57:20Z","abstract_excerpt":"Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\\frac{1}{2}}$ (and hence is likely to have a clique of size roughly $2\\log n$), then for every $\\delta < 2$ and constant $\\ell$, there is an $\\alpha < 2$ (that may depend on $\\delta$ and $\\ell$) such that no algorithm that makes $n^{\\delta}$ probes in $\\ell$ rounds is likely (over the choice of the random graph) to output a clique of size larger than $\\alpha \\log n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06950","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":""},"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-18T00:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nevmMoaCjeB6siK3AYF8Uu0ds/iVQRggp1U69mo0HQLialj+JhIfCFXGTUx9xSBobzCNOGnsV/vCDWXj2BRqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:35:32.270941Z"},"content_sha256":"b65e4140ee470051ebbc91aa9d1a519bc4ca83851f78532dbfbab6e75d5c8bb4","schema_version":"1.0","event_id":"sha256:b65e4140ee470051ebbc91aa9d1a519bc4ca83851f78532dbfbab6e75d5c8bb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/bundle.json","state_url":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/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-31T03:35:32Z","links":{"resolver":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","bundle":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/bundle.json","state":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","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":"0a9d4582f3b35bfce17016f79a180e7c208e086b299016f10fa07a2d9a4f4eb8","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T21:57:20Z","title_canon_sha256":"92ecc8cb0cf29f1dbc695a486038532976816928b2ad9e0d02c6f6bd3eacd460"},"schema_version":"1.0","source":{"id":"1809.06950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06950","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06950v1","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06950","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"J4ZXOQTJ2QNQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J4ZXOQTJ2QNQ6YT5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J4ZXOQTJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b65e4140ee470051ebbc91aa9d1a519bc4ca83851f78532dbfbab6e75d5c8bb4","target":"graph","created_at":"2026-05-18T00:05:21Z","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"},"paper":{"abstract_excerpt":"Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\\frac{1}{2}}$ (and hence is likely to have a clique of size roughly $2\\log n$), then for every $\\delta < 2$ and constant $\\ell$, there is an $\\alpha < 2$ (that may depend on $\\delta$ and $\\ell$) such that no algorithm that makes $n^{\\delta}$ probes in $\\ell$ rounds is likely (over the choice of the random graph) to output a clique of size larger than $\\alpha \\log n$.","authors_text":"David Gamarnik, Joe Neeman, Mikl\\'os Z. R\\'acz, Prasad Tetali, Uriel Feige","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T21:57:20Z","title":"Finding cliques using few probes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06950","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:ef5e56121445bc5033097eb700734d1720c30a87f36cb7e794154f4a89e1393f","target":"record","created_at":"2026-05-18T00:05:21Z","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":"0a9d4582f3b35bfce17016f79a180e7c208e086b299016f10fa07a2d9a4f4eb8","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T21:57:20Z","title_canon_sha256":"92ecc8cb0cf29f1dbc695a486038532976816928b2ad9e0d02c6f6bd3eacd460"},"schema_version":"1.0","source":{"id":"1809.06950","kind":"arxiv","version":1}},"canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","first_computed_at":"2026-05-18T00:05:21.086185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.086185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJiK2wzi/bAMofZHA/ih4/+gdOoQ1NuYAbSpWjLiHvLgsCzEmg8IDeBkVPGszZHpZyct1GCexj7h4Gep2LFfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.086756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef5e56121445bc5033097eb700734d1720c30a87f36cb7e794154f4a89e1393f","sha256:b65e4140ee470051ebbc91aa9d1a519bc4ca83851f78532dbfbab6e75d5c8bb4"],"state_sha256":"f32b7121ac7dc8d741dc5574d834cbf6eb60c3b3da75f87b86da80c8b3a119ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Kua0gux6vehP4wLR/J9jIWAxl/Riv7YVRYm8feHsy3UYno+SIv0ONEEChxTyXLDZabo3bDP88OgPGDDb6drDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:35:32.274281Z","bundle_sha256":"4d71081023a2ceda137c8a06ddc81e097820a2b3ad0a8f3879bd172c013810a4"}}