{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5YYJJBX6BQG3ZNLWQIJYM4B76H","short_pith_number":"pith:5YYJJBX6","canonical_record":{"source":{"id":"2506.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-06-06T17:39:32Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"title_canon_sha256":"e407cd5394920df5b8787c6e2aee5072d2de27fca6946a942fa512571ab6208f","abstract_canon_sha256":"b99c315f9b7d590c28d73967a6a1a538c7a93a72b0478bdca7eb25b7ecabf558"},"schema_version":"1.0"},"canonical_sha256":"ee309486fe0c0dbcb576821386703ff1d9b46eacc001488dd3d8acdb4a252b45","source":{"kind":"arxiv","id":"2506.06259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06259","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06259v1","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06259","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"5YYJJBX6BQG3","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"5YYJJBX6BQG3ZNLW","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"5YYJJBX6","created_at":"2026-07-05T11:17:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5YYJJBX6BQG3ZNLWQIJYM4B76H","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-06-06T17:39:32Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"title_canon_sha256":"e407cd5394920df5b8787c6e2aee5072d2de27fca6946a942fa512571ab6208f","abstract_canon_sha256":"b99c315f9b7d590c28d73967a6a1a538c7a93a72b0478bdca7eb25b7ecabf558"},"schema_version":"1.0"},"canonical_sha256":"ee309486fe0c0dbcb576821386703ff1d9b46eacc001488dd3d8acdb4a252b45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:28.255040Z","signature_b64":"OGvlW6Qa1XwqxwyI+gUC7i0xjBMxM1pPMDGzUbotYi1qF+/UEfJW+t2phQm6ujN2YUGP6tXRaYMzWM3AFPssAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee309486fe0c0dbcb576821386703ff1d9b46eacc001488dd3d8acdb4a252b45","last_reissued_at":"2026-07-05T11:17:28.254609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:28.254609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06259","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-05T11:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBqcsGdZtZG5ikbYu2rI0O67lCAFV+egKuNGYm+FMtFxFXyScTRpAh/NP9PNMzxKD7EeBpLnLjrLsVzzSbmOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:26:21.333896Z"},"content_sha256":"31f8bd93e97de13cc33083f2206409cf99c72ea155ba8cbabcfa20ca4c2b283b","schema_version":"1.0","event_id":"sha256:31f8bd93e97de13cc33083f2206409cf99c72ea155ba8cbabcfa20ca4c2b283b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5YYJJBX6BQG3ZNLWQIJYM4B76H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Ilias Zadik, Peiyuan Zhang, Siyu Chen, Theodor Misiakiewicz","submitted_at":"2025-06-06T17:39:32Z","abstract_excerpt":"Bandeira et al. (2022) introduced the Franz-Parisi (FP) criterion for characterizing the computational hard phases in statistical detection problems. The FP criterion, based on an annealed version of the celebrated Franz-Parisi potential from statistical physics, was shown to be equivalent to low-degree polynomial (LDP) lower bounds for Gaussian additive models, thereby connecting two distinct approaches to understanding the computational hardness in statistical inference. In this paper, we propose a refined FP criterion that aims to better capture the geometric ``overlap\" structure of statist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06259","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/2506.06259/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-05T11:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9qM4LdP31koMXbyFt+LG+4kcxbYqr/UJBl3MQflq0/gpfRxKqBD4laJkRrIYHLUHd8+Mxhgzi7nBjWpvQndCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:26:21.334405Z"},"content_sha256":"962a23804d4cf407dbc8e67a05effabdf7388aa6595ef07e546f6572c79a7320","schema_version":"1.0","event_id":"sha256:962a23804d4cf407dbc8e67a05effabdf7388aa6595ef07e546f6572c79a7320"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/bundle.json","state_url":"https://pith.science/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/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-19T05:26:21Z","links":{"resolver":"https://pith.science/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H","bundle":"https://pith.science/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/bundle.json","state":"https://pith.science/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YYJJBX6BQG3ZNLWQIJYM4B76H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5YYJJBX6BQG3ZNLWQIJYM4B76H","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":"b99c315f9b7d590c28d73967a6a1a538c7a93a72b0478bdca7eb25b7ecabf558","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-06-06T17:39:32Z","title_canon_sha256":"e407cd5394920df5b8787c6e2aee5072d2de27fca6946a942fa512571ab6208f"},"schema_version":"1.0","source":{"id":"2506.06259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06259","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06259v1","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06259","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"5YYJJBX6BQG3","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"5YYJJBX6BQG3ZNLW","created_at":"2026-07-05T11:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"5YYJJBX6","created_at":"2026-07-05T11:17:28Z"}],"graph_snapshots":[{"event_id":"sha256:962a23804d4cf407dbc8e67a05effabdf7388aa6595ef07e546f6572c79a7320","target":"graph","created_at":"2026-07-05T11:17:28Z","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/2506.06259/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bandeira et al. (2022) introduced the Franz-Parisi (FP) criterion for characterizing the computational hard phases in statistical detection problems. The FP criterion, based on an annealed version of the celebrated Franz-Parisi potential from statistical physics, was shown to be equivalent to low-degree polynomial (LDP) lower bounds for Gaussian additive models, thereby connecting two distinct approaches to understanding the computational hardness in statistical inference. In this paper, we propose a refined FP criterion that aims to better capture the geometric ``overlap\" structure of statist","authors_text":"Ilias Zadik, Peiyuan Zhang, Siyu Chen, Theodor Misiakiewicz","cross_cats":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-06-06T17:39:32Z","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06259","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:31f8bd93e97de13cc33083f2206409cf99c72ea155ba8cbabcfa20ca4c2b283b","target":"record","created_at":"2026-07-05T11:17:28Z","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":"b99c315f9b7d590c28d73967a6a1a538c7a93a72b0478bdca7eb25b7ecabf558","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-06-06T17:39:32Z","title_canon_sha256":"e407cd5394920df5b8787c6e2aee5072d2de27fca6946a942fa512571ab6208f"},"schema_version":"1.0","source":{"id":"2506.06259","kind":"arxiv","version":1}},"canonical_sha256":"ee309486fe0c0dbcb576821386703ff1d9b46eacc001488dd3d8acdb4a252b45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee309486fe0c0dbcb576821386703ff1d9b46eacc001488dd3d8acdb4a252b45","first_computed_at":"2026-07-05T11:17:28.254609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:28.254609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGvlW6Qa1XwqxwyI+gUC7i0xjBMxM1pPMDGzUbotYi1qF+/UEfJW+t2phQm6ujN2YUGP6tXRaYMzWM3AFPssAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:28.255040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31f8bd93e97de13cc33083f2206409cf99c72ea155ba8cbabcfa20ca4c2b283b","sha256:962a23804d4cf407dbc8e67a05effabdf7388aa6595ef07e546f6572c79a7320"],"state_sha256":"968ffb237d6aaa20606a07ab1c28cb0dead35d2fbf15b5722d5941ece4503049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNFvWs6uQLPM+FC+Y6BrSvCY2Buj7gLLtO+4r0qRi6D3uEhxqfuMjqYjfhyrHq5j8wUmwU05Xom5nC3iBNuKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:26:21.343489Z","bundle_sha256":"d2a7723fe2719b0f5479cb8df599a8578f00ee66250993c1ac1be1c0609a5960"}}