{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HUHXOBVTF3ZBMEHVOJ72ATQ3PT","short_pith_number":"pith:HUHXOBVT","canonical_record":{"source":{"id":"1504.05910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-22T18:13:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"87cc7e25129d27460e4de16cbf3180d7bcb577e46b551dc30f45182f8fcf2212","abstract_canon_sha256":"657a06e4c8c99e9227d48f308133ea9165432115f501bbbeb96d6a503d606b44"},"schema_version":"1.0"},"canonical_sha256":"3d0f7706b32ef21610f5727fa04e1b7cd2d07cd527a18f42d1e33320a59f5db8","source":{"kind":"arxiv","id":"1504.05910","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05910","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05910v3","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05910","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUHXOBVTF3ZB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HUHXOBVTF3ZBMEHV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HUHXOBVT","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HUHXOBVTF3ZBMEHVOJ72ATQ3PT","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-22T18:13:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"87cc7e25129d27460e4de16cbf3180d7bcb577e46b551dc30f45182f8fcf2212","abstract_canon_sha256":"657a06e4c8c99e9227d48f308133ea9165432115f501bbbeb96d6a503d606b44"},"schema_version":"1.0"},"canonical_sha256":"3d0f7706b32ef21610f5727fa04e1b7cd2d07cd527a18f42d1e33320a59f5db8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.072532Z","signature_b64":"/7D7PLgbzkpL/np2qQ00BfWJI2VKcKPVm7xMjAarxsu+3IYxiROnUSCHZtkRZxVliTfAkOmga07ywh98FnZ9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0f7706b32ef21610f5727fa04e1b7cd2d07cd527a18f42d1e33320a59f5db8","last_reissued_at":"2026-05-18T01:23:49.071791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.071791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05910","source_version":3,"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-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbmrypoLkzQooxHEB+8RxK+KXIplaEub1AQaHrS1h3mUvrwzANF7/HLHlX8zr1k785jFo+2EEX4jGsK5KQvlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:47:24.531139Z"},"content_sha256":"a674e3ee722297fc2aa1b5c910e4aae2a24428634059271687d8f2b3fa7e38ce","schema_version":"1.0","event_id":"sha256:a674e3ee722297fc2aa1b5c910e4aae2a24428634059271687d8f2b3fa7e38ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HUHXOBVTF3ZBMEHVOJ72ATQ3PT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite Programs on Sparse Random Graphs and their Application to Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Andrea Montanari, Subhabrata Sen","submitted_at":"2015-04-22T18:13:35Z","abstract_excerpt":"Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\\langle A-E\\{A\\},X\\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$. We prove that for large (bounded) average degree $d$, the value of this semidefinite program (SDP) is --with high probability-- $2n\\sqrt{d} + n\\, o(\\sqrt{d})+o(n)$. For a random regular graph of degree $d$, we prove that the SDP value is $2n\\sqrt{d-1}+o(n)$, matching a spectral upper bound. Informally, Erdos-Renyi graphs appear to behave similarly to random r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05910","kind":"arxiv","version":3},"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-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJC8NxyPvhC0pja2xuCmqJaTk3UX+y2q5TZq+OAKBvUOcK4wFeJb/g2Rv/7i20EuVfsRY5CP0tqu/YeMx/szCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:47:24.531916Z"},"content_sha256":"112ba1b4cb584d9ba83b0405e0b9311c46a013af497454b4cf0dd9f91c549580","schema_version":"1.0","event_id":"sha256:112ba1b4cb584d9ba83b0405e0b9311c46a013af497454b4cf0dd9f91c549580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/bundle.json","state_url":"https://pith.science/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/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-28T21:47:24Z","links":{"resolver":"https://pith.science/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT","bundle":"https://pith.science/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/bundle.json","state":"https://pith.science/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUHXOBVTF3ZBMEHVOJ72ATQ3PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HUHXOBVTF3ZBMEHVOJ72ATQ3PT","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":"657a06e4c8c99e9227d48f308133ea9165432115f501bbbeb96d6a503d606b44","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-22T18:13:35Z","title_canon_sha256":"87cc7e25129d27460e4de16cbf3180d7bcb577e46b551dc30f45182f8fcf2212"},"schema_version":"1.0","source":{"id":"1504.05910","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05910","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05910v3","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05910","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUHXOBVTF3ZB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HUHXOBVTF3ZBMEHV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HUHXOBVT","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:112ba1b4cb584d9ba83b0405e0b9311c46a013af497454b4cf0dd9f91c549580","target":"graph","created_at":"2026-05-18T01:23:49Z","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":"Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\\langle A-E\\{A\\},X\\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$. We prove that for large (bounded) average degree $d$, the value of this semidefinite program (SDP) is --with high probability-- $2n\\sqrt{d} + n\\, o(\\sqrt{d})+o(n)$. For a random regular graph of degree $d$, we prove that the SDP value is $2n\\sqrt{d-1}+o(n)$, matching a spectral upper bound. Informally, Erdos-Renyi graphs appear to behave similarly to random r","authors_text":"Andrea Montanari, Subhabrata Sen","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-22T18:13:35Z","title":"Semidefinite Programs on Sparse Random Graphs and their Application to Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05910","kind":"arxiv","version":3},"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:a674e3ee722297fc2aa1b5c910e4aae2a24428634059271687d8f2b3fa7e38ce","target":"record","created_at":"2026-05-18T01:23:49Z","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":"657a06e4c8c99e9227d48f308133ea9165432115f501bbbeb96d6a503d606b44","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-22T18:13:35Z","title_canon_sha256":"87cc7e25129d27460e4de16cbf3180d7bcb577e46b551dc30f45182f8fcf2212"},"schema_version":"1.0","source":{"id":"1504.05910","kind":"arxiv","version":3}},"canonical_sha256":"3d0f7706b32ef21610f5727fa04e1b7cd2d07cd527a18f42d1e33320a59f5db8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d0f7706b32ef21610f5727fa04e1b7cd2d07cd527a18f42d1e33320a59f5db8","first_computed_at":"2026-05-18T01:23:49.071791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:49.071791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/7D7PLgbzkpL/np2qQ00BfWJI2VKcKPVm7xMjAarxsu+3IYxiROnUSCHZtkRZxVliTfAkOmga07ywh98FnZ9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:49.072532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05910","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a674e3ee722297fc2aa1b5c910e4aae2a24428634059271687d8f2b3fa7e38ce","sha256:112ba1b4cb584d9ba83b0405e0b9311c46a013af497454b4cf0dd9f91c549580"],"state_sha256":"266e725ea49d684e69cdab7174c0ec0e2858cc47bfbd15ad3c76816d05e0d231"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpfMxc9wwmpDozquVA2GWBvHKjNtCYH/hbPAq+s2z3iLuZo+u9nKdZs1bk22iGNBI2AlVV92ltEgw2shGG7CAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:47:24.535557Z","bundle_sha256":"723426544585051532efe84b6d03a9ea5fc00f642223fc28dcb55613459c3a6d"}}