{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3RWQSAGPCG5AATGLHPXMVHIZU5","short_pith_number":"pith:3RWQSAGP","canonical_record":{"source":{"id":"1802.05903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-16T11:49:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8dd1a67ea75c66e8a26a2484e60df9f86353618cd4e334d817eddc9c4b76600","abstract_canon_sha256":"484096cdd021dacdf5f5675160c098a7130e105437c6552259e1cc14188771a2"},"schema_version":"1.0"},"canonical_sha256":"dc6d0900cf11ba004ccb3beeca9d19a7467286dad77fa80771d1705c1e147576","source":{"kind":"arxiv","id":"1802.05903","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05903","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05903v2","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05903","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"pith_short_12","alias_value":"3RWQSAGPCG5A","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3RWQSAGPCG5AATGL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3RWQSAGP","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3RWQSAGPCG5AATGLHPXMVHIZU5","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-16T11:49:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8dd1a67ea75c66e8a26a2484e60df9f86353618cd4e334d817eddc9c4b76600","abstract_canon_sha256":"484096cdd021dacdf5f5675160c098a7130e105437c6552259e1cc14188771a2"},"schema_version":"1.0"},"canonical_sha256":"dc6d0900cf11ba004ccb3beeca9d19a7467286dad77fa80771d1705c1e147576","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:48.367272Z","signature_b64":"ohXYrzgMXuF1YdRkcXIGM0TEmzFZRDb8wD5PcU9eq5JKAiJaEx40vgUrmIerGHnT4I4GkhrNcRdM+dbbVgczCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6d0900cf11ba004ccb3beeca9d19a7467286dad77fa80771d1705c1e147576","last_reissued_at":"2026-05-17T23:56:48.366607Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:48.366607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05903","source_version":2,"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-17T23:56:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xz3sy77xCm2NcqPn/2srtC075VFwrlozAbPrpPVVYvZdlFO77Y0U8yT7jsACjDA8FE03yl15gU7lj66ggsvEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:46.317494Z"},"content_sha256":"f55a600822fffccac7d9fcab5b7846d834262b6a7509384831be2f42a5f6e979","schema_version":"1.0","event_id":"sha256:f55a600822fffccac7d9fcab5b7846d834262b6a7509384831be2f42a5f6e979"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3RWQSAGPCG5AATGLHPXMVHIZU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Tempering for the planted clique problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Maria Chiara Angelini","submitted_at":"2018-02-16T11:49:21Z","abstract_excerpt":"The theoretical information threshold for the planted clique problem is $2\\log_2(N)$, however no polynomial algorithm is known to recover a planted clique of size $O(N^{1/2-\\epsilon})$, $\\epsilon>0$. In this paper we will apply a standard method for the analysis of disordered models, the Parallel-Tempering (PT) algorithm, to the clique problem, showing numerically that its time-scaling in the hard region is indeed polynomial for the analyzed sizes. We also apply PT to a different but connected model, the Sparse Planted Independent Set problem. In this situation thresholds should be sharper and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05903","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":""},"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-17T23:56:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qu1gPdOknxpC6wrCZzm6058rAa1u/pWGSDyEucdv4IpnFouyiyKOjsIkYIkdEzUt6b4XaF0FMP19Qqb9CFKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:46.317877Z"},"content_sha256":"246897509f1c231a8cdd297067a46eb91c1bab2190f19921821d87328b21ceac","schema_version":"1.0","event_id":"sha256:246897509f1c231a8cdd297067a46eb91c1bab2190f19921821d87328b21ceac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/bundle.json","state_url":"https://pith.science/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/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-27T02:11:46Z","links":{"resolver":"https://pith.science/pith/3RWQSAGPCG5AATGLHPXMVHIZU5","bundle":"https://pith.science/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/bundle.json","state":"https://pith.science/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RWQSAGPCG5AATGLHPXMVHIZU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3RWQSAGPCG5AATGLHPXMVHIZU5","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":"484096cdd021dacdf5f5675160c098a7130e105437c6552259e1cc14188771a2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-16T11:49:21Z","title_canon_sha256":"e8dd1a67ea75c66e8a26a2484e60df9f86353618cd4e334d817eddc9c4b76600"},"schema_version":"1.0","source":{"id":"1802.05903","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05903","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05903v2","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05903","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"pith_short_12","alias_value":"3RWQSAGPCG5A","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3RWQSAGPCG5AATGL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3RWQSAGP","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:246897509f1c231a8cdd297067a46eb91c1bab2190f19921821d87328b21ceac","target":"graph","created_at":"2026-05-17T23:56:48Z","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":"The theoretical information threshold for the planted clique problem is $2\\log_2(N)$, however no polynomial algorithm is known to recover a planted clique of size $O(N^{1/2-\\epsilon})$, $\\epsilon>0$. In this paper we will apply a standard method for the analysis of disordered models, the Parallel-Tempering (PT) algorithm, to the clique problem, showing numerically that its time-scaling in the hard region is indeed polynomial for the analyzed sizes. We also apply PT to a different but connected model, the Sparse Planted Independent Set problem. In this situation thresholds should be sharper and","authors_text":"Maria Chiara Angelini","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-16T11:49:21Z","title":"Parallel Tempering for the planted clique problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05903","kind":"arxiv","version":2},"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:f55a600822fffccac7d9fcab5b7846d834262b6a7509384831be2f42a5f6e979","target":"record","created_at":"2026-05-17T23:56:48Z","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":"484096cdd021dacdf5f5675160c098a7130e105437c6552259e1cc14188771a2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-16T11:49:21Z","title_canon_sha256":"e8dd1a67ea75c66e8a26a2484e60df9f86353618cd4e334d817eddc9c4b76600"},"schema_version":"1.0","source":{"id":"1802.05903","kind":"arxiv","version":2}},"canonical_sha256":"dc6d0900cf11ba004ccb3beeca9d19a7467286dad77fa80771d1705c1e147576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6d0900cf11ba004ccb3beeca9d19a7467286dad77fa80771d1705c1e147576","first_computed_at":"2026-05-17T23:56:48.366607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:48.366607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohXYrzgMXuF1YdRkcXIGM0TEmzFZRDb8wD5PcU9eq5JKAiJaEx40vgUrmIerGHnT4I4GkhrNcRdM+dbbVgczCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:48.367272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05903","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f55a600822fffccac7d9fcab5b7846d834262b6a7509384831be2f42a5f6e979","sha256:246897509f1c231a8cdd297067a46eb91c1bab2190f19921821d87328b21ceac"],"state_sha256":"553410487aa976b4d4d464effdefadf6bc8c23863faa59d2e8af9e36ffec6509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItMmHutVWBAuLX9xYy5TjjzRFxTSsoB/CHl+6dCU1XcLpoV78mI1E0zixFM/vuCcck1l5fg/mxecCLN+eAxtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:11:46.320470Z","bundle_sha256":"e28ce895bbc04f7d979a876ecf08ea50d59cbc218ffc2da5a86e2ddcc21adf0f"}}