{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","short_pith_number":"pith:J4ZXOQTJ","schema_version":"1.0","canonical_sha256":"4f33774269d41b0f627daf6f548bad7eb3f7e6e05613bcfff5de215ac54419a0","source":{"kind":"arxiv","id":"1809.06950","version":1},"attestation_state":"computed","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$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.06950","created_at":"2026-05-18T00:05:21.086291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06950v1","created_at":"2026-05-18T00:05:21.086291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06950","created_at":"2026-05-18T00:05:21.086291+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4ZXOQTJ2QNQ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4ZXOQTJ2QNQ6YT5","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4ZXOQTJ","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","json":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2.json","graph_json":"https://pith.science/api/pith-number/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/graph.json","events_json":"https://pith.science/api/pith-number/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/events.json","paper":"https://pith.science/paper/J4ZXOQTJ"},"agent_actions":{"view_html":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2","download_json":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2.json","view_paper":"https://pith.science/paper/J4ZXOQTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06950&json=true","fetch_graph":"https://pith.science/api/pith-number/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/graph.json","fetch_events":"https://pith.science/api/pith-number/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/action/storage_attestation","attest_author":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/action/author_attestation","sign_citation":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/action/citation_signature","submit_replication":"https://pith.science/pith/J4ZXOQTJ2QNQ6YT5V5XVJC5NP2/action/replication_record"}},"created_at":"2026-05-18T00:05:21.086291+00:00","updated_at":"2026-05-18T00:05:21.086291+00:00"}