{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:V6LJMHVAJ4EDEGG7TP45G5HUYA","short_pith_number":"pith:V6LJMHVA","canonical_record":{"source":{"id":"0905.4147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-05-26T09:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"a93b2715c45a88066aa4c4986fe6c0a1cb6c8d68b51f18aec75d40c9bda85214","abstract_canon_sha256":"dfccfe70b8188b169cde1c98be1cf9bec27c81648051fb686f9b3b1ef9ceb767"},"schema_version":"1.0"},"canonical_sha256":"af96961ea04f083218df9bf9d374f4c0063284f2c8cf40c704550366390b3155","source":{"kind":"arxiv","id":"0905.4147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4147","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4147v1","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4147","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"V6LJMHVAJ4ED","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_16","alias_value":"V6LJMHVAJ4EDEGG7","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_8","alias_value":"V6LJMHVA","created_at":"2026-07-04T15:42:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:V6LJMHVAJ4EDEGG7TP45G5HUYA","target":"record","payload":{"canonical_record":{"source":{"id":"0905.4147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-05-26T09:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"a93b2715c45a88066aa4c4986fe6c0a1cb6c8d68b51f18aec75d40c9bda85214","abstract_canon_sha256":"dfccfe70b8188b169cde1c98be1cf9bec27c81648051fb686f9b3b1ef9ceb767"},"schema_version":"1.0"},"canonical_sha256":"af96961ea04f083218df9bf9d374f4c0063284f2c8cf40c704550366390b3155","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:42:55.461917Z","signature_b64":"VOd8wB7sTm0eNO8yknn7LC11Umj4JRIs5v6UnN+Lp3OIWzR7TgzgQJvjLbX5PkimUi1z6Jul/nOEfjYtV/ZpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af96961ea04f083218df9bf9d374f4c0063284f2c8cf40c704550366390b3155","last_reissued_at":"2026-07-04T15:42:55.461481Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:42:55.461481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.4147","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-04T15:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5yP9b6pCY2mtC1m2991vJQz0alF/FdxxBWFlzUxypvP1QpoV+1gSfJf92B20a+liFVWJEx/2Y7+d2fTiAVLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:19:02.369714Z"},"content_sha256":"ad6b8f63c445a8286cd372185209cac878f998bae8a68fc3bf4ce02afd9e5891","schema_version":"1.0","event_id":"sha256:ad6b8f63c445a8286cd372185209cac878f998bae8a68fc3bf4ce02afd9e5891"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:V6LJMHVAJ4EDEGG7TP45G5HUYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Discovery of Large Near-Cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boaz Patt-Shamir, Zvika Brakerski","submitted_at":"2009-05-26T09:51:35Z","abstract_excerpt":"Given an undirected graph and $0\\le\\epsilon\\le1$, a set of nodes is called $\\epsilon$-near clique if all but an $\\epsilon$ fraction of the pairs of nodes in the set have a link between them. In this paper we present a fast synchronous network algorithm that uses small messages and finds a near-clique. Specifically, we present a constant-time algorithm that finds, with constant probability of success, a linear size $\\epsilon$-near clique if there exists an $\\epsilon^3$-near clique of linear size in the graph. The algorithm uses messages of $O(\\log n)$ bits. The failure probability can be reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4147","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/0905.4147/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-04T15:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89L9ftBo7ww6imADi1STMkqONj5J2B9DdySs33M4Axbrd7S2naFZ7ToayDXt3A13irmdxdQGM4VYozr9D20YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:19:02.371298Z"},"content_sha256":"594030b16de843e6871b185821c6ce801f981901c7d2e716f3e9b44b90ad71ba","schema_version":"1.0","event_id":"sha256:594030b16de843e6871b185821c6ce801f981901c7d2e716f3e9b44b90ad71ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/bundle.json","state_url":"https://pith.science/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/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-05T03:19:02Z","links":{"resolver":"https://pith.science/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA","bundle":"https://pith.science/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/bundle.json","state":"https://pith.science/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6LJMHVAJ4EDEGG7TP45G5HUYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:V6LJMHVAJ4EDEGG7TP45G5HUYA","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":"dfccfe70b8188b169cde1c98be1cf9bec27c81648051fb686f9b3b1ef9ceb767","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-05-26T09:51:35Z","title_canon_sha256":"a93b2715c45a88066aa4c4986fe6c0a1cb6c8d68b51f18aec75d40c9bda85214"},"schema_version":"1.0","source":{"id":"0905.4147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4147","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4147v1","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4147","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"V6LJMHVAJ4ED","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_16","alias_value":"V6LJMHVAJ4EDEGG7","created_at":"2026-07-04T15:42:55Z"},{"alias_kind":"pith_short_8","alias_value":"V6LJMHVA","created_at":"2026-07-04T15:42:55Z"}],"graph_snapshots":[{"event_id":"sha256:594030b16de843e6871b185821c6ce801f981901c7d2e716f3e9b44b90ad71ba","target":"graph","created_at":"2026-07-04T15:42:55Z","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/0905.4147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an undirected graph and $0\\le\\epsilon\\le1$, a set of nodes is called $\\epsilon$-near clique if all but an $\\epsilon$ fraction of the pairs of nodes in the set have a link between them. In this paper we present a fast synchronous network algorithm that uses small messages and finds a near-clique. Specifically, we present a constant-time algorithm that finds, with constant probability of success, a linear size $\\epsilon$-near clique if there exists an $\\epsilon^3$-near clique of linear size in the graph. The algorithm uses messages of $O(\\log n)$ bits. The failure probability can be reduce","authors_text":"Boaz Patt-Shamir, Zvika Brakerski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-05-26T09:51:35Z","title":"Distributed Discovery of Large Near-Cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4147","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:ad6b8f63c445a8286cd372185209cac878f998bae8a68fc3bf4ce02afd9e5891","target":"record","created_at":"2026-07-04T15:42:55Z","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":"dfccfe70b8188b169cde1c98be1cf9bec27c81648051fb686f9b3b1ef9ceb767","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-05-26T09:51:35Z","title_canon_sha256":"a93b2715c45a88066aa4c4986fe6c0a1cb6c8d68b51f18aec75d40c9bda85214"},"schema_version":"1.0","source":{"id":"0905.4147","kind":"arxiv","version":1}},"canonical_sha256":"af96961ea04f083218df9bf9d374f4c0063284f2c8cf40c704550366390b3155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af96961ea04f083218df9bf9d374f4c0063284f2c8cf40c704550366390b3155","first_computed_at":"2026-07-04T15:42:55.461481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:42:55.461481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VOd8wB7sTm0eNO8yknn7LC11Umj4JRIs5v6UnN+Lp3OIWzR7TgzgQJvjLbX5PkimUi1z6Jul/nOEfjYtV/ZpCA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:42:55.461917Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.4147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6b8f63c445a8286cd372185209cac878f998bae8a68fc3bf4ce02afd9e5891","sha256:594030b16de843e6871b185821c6ce801f981901c7d2e716f3e9b44b90ad71ba"],"state_sha256":"506c1bee1a7bb58282ea36c65265d41036fe0de4787c81a2030359e25e971f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9L+8Xm6FWqPH9Jybkr5jjfbwijVM/RBMEQG9myXKKdym4CADNUvX962gbYHpL1GSbixqLdc4eAta2ShtVllODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:19:02.380510Z","bundle_sha256":"f617abc6a7d9f6161a24fcd75273b1c2edbffe9c39095458591463444de787f0"}}