{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YIUOCOACNQGEIBZKYRKU4YMZZL","short_pith_number":"pith:YIUOCOAC","schema_version":"1.0","canonical_sha256":"c228e138026c0c44072ac4554e6199caf2c9dafb90c3508f71dadf6c0fc2826a","source":{"kind":"arxiv","id":"2506.21543","version":2},"attestation_state":"computed","paper":{"title":"Detecting weighted hidden cliques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Mandal, B. R. Vinay Kumar, G\\'abor Lugosi, Karissa Huang, Maruf Alam Tarafdar, Nandan Malhotra, Ritabrata Karmakar, Urmisha Chatterjee","submitted_at":"2025-06-26T17:58:22Z","abstract_excerpt":"We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesis, edges of a complete graph on $n$ vertices are associated with independent and identically distributed edge weights from a distribution $P$. Under the alternate hypothesis, $k$ vertices are chosen at random and the edge weights between them are drawn from a distribution $Q$, while the remaining are sampled from $P$. The goal is to decide, upon observing the edge weights, which of the two hypotheses they were genera"},"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":"2506.21543","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-26T17:58:22Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"title_canon_sha256":"945a85996713a07c6b9a6f529e34d63cc7f905c902aa57a95695164ce4228579","abstract_canon_sha256":"b9afd8bb1573bf5e445de1b51799f7440cf34aacea070441dda215807bdf3a10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:35.219093Z","signature_b64":"43izghmBQWwrxZKHxEP4URRzsmhWoy/jlTgf0l3mMkWpyXcDaXW0DSM6u1WySohOrt9sDQJl9QzdEvUuOBfJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c228e138026c0c44072ac4554e6199caf2c9dafb90c3508f71dadf6c0fc2826a","last_reissued_at":"2026-05-29T02:05:35.218566Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:35.218566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting weighted hidden cliques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Mandal, B. R. Vinay Kumar, G\\'abor Lugosi, Karissa Huang, Maruf Alam Tarafdar, Nandan Malhotra, Ritabrata Karmakar, Urmisha Chatterjee","submitted_at":"2025-06-26T17:58:22Z","abstract_excerpt":"We study a generalization of the classical hidden clique problem to graphs with real-valued edge weights. Formally, we define a hypothesis testing problem. Under the null hypothesis, edges of a complete graph on $n$ vertices are associated with independent and identically distributed edge weights from a distribution $P$. Under the alternate hypothesis, $k$ vertices are chosen at random and the edge weights between them are drawn from a distribution $Q$, while the remaining are sampled from $P$. The goal is to decide, upon observing the edge weights, which of the two hypotheses they were genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21543","kind":"arxiv","version":2},"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/2506.21543/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.21543","created_at":"2026-05-29T02:05:35.218626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21543v2","created_at":"2026-05-29T02:05:35.218626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21543","created_at":"2026-05-29T02:05:35.218626+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIUOCOACNQGE","created_at":"2026-05-29T02:05:35.218626+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIUOCOACNQGEIBZK","created_at":"2026-05-29T02:05:35.218626+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIUOCOAC","created_at":"2026-05-29T02:05:35.218626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.08691","citing_title":"Planted clique detection and recovery from the hypergraph adjacency matrix","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL","json":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL.json","graph_json":"https://pith.science/api/pith-number/YIUOCOACNQGEIBZKYRKU4YMZZL/graph.json","events_json":"https://pith.science/api/pith-number/YIUOCOACNQGEIBZKYRKU4YMZZL/events.json","paper":"https://pith.science/paper/YIUOCOAC"},"agent_actions":{"view_html":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL","download_json":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL.json","view_paper":"https://pith.science/paper/YIUOCOAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21543&json=true","fetch_graph":"https://pith.science/api/pith-number/YIUOCOACNQGEIBZKYRKU4YMZZL/graph.json","fetch_events":"https://pith.science/api/pith-number/YIUOCOACNQGEIBZKYRKU4YMZZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL/action/storage_attestation","attest_author":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL/action/author_attestation","sign_citation":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL/action/citation_signature","submit_replication":"https://pith.science/pith/YIUOCOACNQGEIBZKYRKU4YMZZL/action/replication_record"}},"created_at":"2026-05-29T02:05:35.218626+00:00","updated_at":"2026-05-29T02:05:35.218626+00:00"}