{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KIYVYZUVJUA25QOMEFXCDAMLOU","short_pith_number":"pith:KIYVYZUV","canonical_record":{"source":{"id":"1010.2997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T18:08:29Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"7d22b68f571ec6af41539451aa0b2e2fac2af0e4af6c7af1bdf50573143c8b8f","abstract_canon_sha256":"00ced1fe75d609d3cd493b9841a7d967d11004f724163564778daffde8768d4d"},"schema_version":"1.0"},"canonical_sha256":"52315c66954d01aec1cc216e21818b752deb9f343688868a243ae0cdd562954a","source":{"kind":"arxiv","id":"1010.2997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2997","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2997v1","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2997","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"KIYVYZUVJUA2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KIYVYZUVJUA25QOM","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KIYVYZUV","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KIYVYZUVJUA25QOMEFXCDAMLOU","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T18:08:29Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"7d22b68f571ec6af41539451aa0b2e2fac2af0e4af6c7af1bdf50573143c8b8f","abstract_canon_sha256":"00ced1fe75d609d3cd493b9841a7d967d11004f724163564778daffde8768d4d"},"schema_version":"1.0"},"canonical_sha256":"52315c66954d01aec1cc216e21818b752deb9f343688868a243ae0cdd562954a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:18.683673Z","signature_b64":"Xm6uUxrzh3O5nftmgWCTRzQeNIek2qoBoxz0+omGHg9QL7NmICyKrViWD8MOJDDdj+9k98WFsauPN0TUKmPMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52315c66954d01aec1cc216e21818b752deb9f343688868a243ae0cdd562954a","last_reissued_at":"2026-05-18T04:39:18.682998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:18.682998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2997","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-18T04:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZN+pq6fXNs+nSl/6NpKXWofx5jpg6HhPEa9eJWSwo5eLKIcrRB2RKKVWySWkHm8IWydiaI6FoaQExqbmMftaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:52:36.157878Z"},"content_sha256":"4fa69817c119ba508712b664ded3e373d9da6204c9217fca52f7b0101f72140e","schema_version":"1.0","event_id":"sha256:4fa69817c119ba508712b664ded3e373d9da6204c9217fca52f7b0101f72140e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KIYVYZUVJUA25QOMEFXCDAMLOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Hidden Cliques in Linear Time with High Probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Ori Gurel-Gurevich, Yael Dekel, Yuval Peres","submitted_at":"2010-10-14T18:08:29Z","abstract_excerpt":"We are given a graph $G$ with $n$ vertices, where a random subset of $k$ vertices has been made into a clique, and the remaining edges are chosen independently with probability $\\tfrac12$. This random graph model is denoted $G(n,\\tfrac12,k)$. The hidden clique problem is to design an algorithm that finds the $k$-clique in polynomial time with high probability. An algorithm due to Alon, Krivelevich and Sudakov uses spectral techniques to find the hidden clique with high probability when $k = c \\sqrt{n}$ for a sufficiently large constant $c > 0$. Recently, an algorithm that solves the same probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2997","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-18T04:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GDRVcSzWSoOfvHulE67UxWfUEKm/h5Ap8xjR5K/EOJ1fBhgzeF1Bdbv//zbkaE1gBDpmW4Vvo3dr+DawBAsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:52:36.158622Z"},"content_sha256":"2a5d4d8e784a0b03007bc36e16ba903a6a6bba04b5d1b16a4caa188dac421d45","schema_version":"1.0","event_id":"sha256:2a5d4d8e784a0b03007bc36e16ba903a6a6bba04b5d1b16a4caa188dac421d45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/bundle.json","state_url":"https://pith.science/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/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-06-09T06:52:36Z","links":{"resolver":"https://pith.science/pith/KIYVYZUVJUA25QOMEFXCDAMLOU","bundle":"https://pith.science/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/bundle.json","state":"https://pith.science/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIYVYZUVJUA25QOMEFXCDAMLOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KIYVYZUVJUA25QOMEFXCDAMLOU","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":"00ced1fe75d609d3cd493b9841a7d967d11004f724163564778daffde8768d4d","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T18:08:29Z","title_canon_sha256":"7d22b68f571ec6af41539451aa0b2e2fac2af0e4af6c7af1bdf50573143c8b8f"},"schema_version":"1.0","source":{"id":"1010.2997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2997","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2997v1","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2997","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"KIYVYZUVJUA2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KIYVYZUVJUA25QOM","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KIYVYZUV","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:2a5d4d8e784a0b03007bc36e16ba903a6a6bba04b5d1b16a4caa188dac421d45","target":"graph","created_at":"2026-05-18T04:39:18Z","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":"We are given a graph $G$ with $n$ vertices, where a random subset of $k$ vertices has been made into a clique, and the remaining edges are chosen independently with probability $\\tfrac12$. This random graph model is denoted $G(n,\\tfrac12,k)$. The hidden clique problem is to design an algorithm that finds the $k$-clique in polynomial time with high probability. An algorithm due to Alon, Krivelevich and Sudakov uses spectral techniques to find the hidden clique with high probability when $k = c \\sqrt{n}$ for a sufficiently large constant $c > 0$. Recently, an algorithm that solves the same probl","authors_text":"Ori Gurel-Gurevich, Yael Dekel, Yuval Peres","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T18:08:29Z","title":"Finding Hidden Cliques in Linear Time with High Probability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2997","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:4fa69817c119ba508712b664ded3e373d9da6204c9217fca52f7b0101f72140e","target":"record","created_at":"2026-05-18T04:39:18Z","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":"00ced1fe75d609d3cd493b9841a7d967d11004f724163564778daffde8768d4d","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T18:08:29Z","title_canon_sha256":"7d22b68f571ec6af41539451aa0b2e2fac2af0e4af6c7af1bdf50573143c8b8f"},"schema_version":"1.0","source":{"id":"1010.2997","kind":"arxiv","version":1}},"canonical_sha256":"52315c66954d01aec1cc216e21818b752deb9f343688868a243ae0cdd562954a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52315c66954d01aec1cc216e21818b752deb9f343688868a243ae0cdd562954a","first_computed_at":"2026-05-18T04:39:18.682998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:18.682998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xm6uUxrzh3O5nftmgWCTRzQeNIek2qoBoxz0+omGHg9QL7NmICyKrViWD8MOJDDdj+9k98WFsauPN0TUKmPMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:18.683673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fa69817c119ba508712b664ded3e373d9da6204c9217fca52f7b0101f72140e","sha256:2a5d4d8e784a0b03007bc36e16ba903a6a6bba04b5d1b16a4caa188dac421d45"],"state_sha256":"8dea13598e34f5b4e2905505dd090eef97bd4762b01346644b87262fab23f835"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLfufojQwcshxX1OqT7WMWNlphvZfkbBy230QNvG853HEfSqu9nlukixsIoBDKNu9P2lbXy1wgKZ8gx+602zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:52:36.163084Z","bundle_sha256":"551e7018ae758e01ed8e93b3aa29a0206fd6095315e19fdfdfd22932fb7f4efe"}}