{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UOWASSR5M3AEO6PPDWM6NLPJHP","short_pith_number":"pith:UOWASSR5","canonical_record":{"source":{"id":"1606.02365","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T00:58:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bb8a6ada18e6fe5e51ada6852d9735687ec072fd56f08f3690d01a6cbc016586","abstract_canon_sha256":"f7d3d069d0b2a135142eda5c66cf09c2b58e79d31e7e615261eaefbc10044d4b"},"schema_version":"1.0"},"canonical_sha256":"a3ac094a3d66c04779ef1d99e6ade93bffc0d320bd4667df51c75e200b83dce9","source":{"kind":"arxiv","id":"1606.02365","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02365","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02365v4","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02365","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"UOWASSR5M3AE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOWASSR5M3AEO6PP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOWASSR5","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UOWASSR5M3AEO6PPDWM6NLPJHP","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02365","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T00:58:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bb8a6ada18e6fe5e51ada6852d9735687ec072fd56f08f3690d01a6cbc016586","abstract_canon_sha256":"f7d3d069d0b2a135142eda5c66cf09c2b58e79d31e7e615261eaefbc10044d4b"},"schema_version":"1.0"},"canonical_sha256":"a3ac094a3d66c04779ef1d99e6ade93bffc0d320bd4667df51c75e200b83dce9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.692200Z","signature_b64":"uauz0miSGzMJGkcSHcv7C8tbTzzkTlUNfQSXpCGXdEbToq3821nXhwdlb4TZFsF3rx62oJi9Ng7lDvV18WJYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ac094a3d66c04779ef1d99e6ade93bffc0d320bd4667df51c75e200b83dce9","last_reissued_at":"2026-05-18T00:34:31.691841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.691841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02365","source_version":4,"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+uJ8oq8vDP80oIyRC3nGXrzBcsh9PDwKGFbB4dLu6VYZ05TP4vTPayKFUOnrqrGLqm9jCAS8xdSuKjIUrskNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:43:30.165592Z"},"content_sha256":"efda22033dd74c8d1a253be0d6049f0564179d6fcee8e52b3da0a0c687e0895f","schema_version":"1.0","event_id":"sha256:efda22033dd74c8d1a253be0d6049f0564179d6fcee8e52b3da0a0c687e0895f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UOWASSR5M3AEO6PPDWM6NLPJHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization on Sparse Random Hypergraphs and Spin Glasses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Subhabrata Sen","submitted_at":"2016-06-08T00:58:14Z","abstract_excerpt":"We establish that in the large degree limit, the value of certain optimization problems on sparse random hypergraphs is determined by an appropriate Gaussian optimization problem. This approach was initiated in Dembo et. al.(2016) for extremal cuts of graphs. The usefulness of this technique is further illustrated by deriving the optimal value for Max $q$-cut on Erd\\H{o}s-R\\'enyi and random regular graphs, Max XORSAT on Erd\\H{o}s-R\\'enyi hypergraphs, and the min-bisection for the Stochastic Block Model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02365","kind":"arxiv","version":4},"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3xjKTGTLnlIts1BL6OriEavDbG14Nehb2Sn6x+f77qqByDlXgGpxEUypwLXesdomR1ij9jj3Qoh/JTC0AzgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:43:30.166126Z"},"content_sha256":"5fb988d656f16f3c0433b089a02c326f93db6a2679735186c034e8f14a533ebd","schema_version":"1.0","event_id":"sha256:5fb988d656f16f3c0433b089a02c326f93db6a2679735186c034e8f14a533ebd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/bundle.json","state_url":"https://pith.science/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/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-29T21:43:30Z","links":{"resolver":"https://pith.science/pith/UOWASSR5M3AEO6PPDWM6NLPJHP","bundle":"https://pith.science/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/bundle.json","state":"https://pith.science/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOWASSR5M3AEO6PPDWM6NLPJHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UOWASSR5M3AEO6PPDWM6NLPJHP","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":"f7d3d069d0b2a135142eda5c66cf09c2b58e79d31e7e615261eaefbc10044d4b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T00:58:14Z","title_canon_sha256":"bb8a6ada18e6fe5e51ada6852d9735687ec072fd56f08f3690d01a6cbc016586"},"schema_version":"1.0","source":{"id":"1606.02365","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02365","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02365v4","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02365","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"UOWASSR5M3AE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOWASSR5M3AEO6PP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOWASSR5","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5fb988d656f16f3c0433b089a02c326f93db6a2679735186c034e8f14a533ebd","target":"graph","created_at":"2026-05-18T00:34:31Z","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 establish that in the large degree limit, the value of certain optimization problems on sparse random hypergraphs is determined by an appropriate Gaussian optimization problem. This approach was initiated in Dembo et. al.(2016) for extremal cuts of graphs. The usefulness of this technique is further illustrated by deriving the optimal value for Max $q$-cut on Erd\\H{o}s-R\\'enyi and random regular graphs, Max XORSAT on Erd\\H{o}s-R\\'enyi hypergraphs, and the min-bisection for the Stochastic Block Model.","authors_text":"Subhabrata Sen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T00:58:14Z","title":"Optimization on Sparse Random Hypergraphs and Spin Glasses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02365","kind":"arxiv","version":4},"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:efda22033dd74c8d1a253be0d6049f0564179d6fcee8e52b3da0a0c687e0895f","target":"record","created_at":"2026-05-18T00:34:31Z","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":"f7d3d069d0b2a135142eda5c66cf09c2b58e79d31e7e615261eaefbc10044d4b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T00:58:14Z","title_canon_sha256":"bb8a6ada18e6fe5e51ada6852d9735687ec072fd56f08f3690d01a6cbc016586"},"schema_version":"1.0","source":{"id":"1606.02365","kind":"arxiv","version":4}},"canonical_sha256":"a3ac094a3d66c04779ef1d99e6ade93bffc0d320bd4667df51c75e200b83dce9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3ac094a3d66c04779ef1d99e6ade93bffc0d320bd4667df51c75e200b83dce9","first_computed_at":"2026-05-18T00:34:31.691841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:31.691841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uauz0miSGzMJGkcSHcv7C8tbTzzkTlUNfQSXpCGXdEbToq3821nXhwdlb4TZFsF3rx62oJi9Ng7lDvV18WJYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:31.692200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02365","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efda22033dd74c8d1a253be0d6049f0564179d6fcee8e52b3da0a0c687e0895f","sha256:5fb988d656f16f3c0433b089a02c326f93db6a2679735186c034e8f14a533ebd"],"state_sha256":"710c7c6108a921c86ec68b1b3809e0d1e441d635415a4a8e721b3184b6937a5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0SFZsttRZdUMn2Z4vl0sP3R1SE/9RTKiDH9fcBhRjZfWGLtdZ86d283X3m+hxPw+zw4G9W4onZTavfWbQ5tAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:43:30.169618Z","bundle_sha256":"dd6d609fdf55caa67b2e69579d38001fe60e36cd86bfd61115a14e27c2defffd"}}