{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LDLLNRKGGASLO7RNVYNV6ULP56","short_pith_number":"pith:LDLLNRKG","schema_version":"1.0","canonical_sha256":"58d6b6c5463024b77e2dae1b5f516fefbe888bd4aca5b5a920e432195486e25c","source":{"kind":"arxiv","id":"2507.15632","version":3},"attestation_state":"computed","paper":{"title":"Any-Dimensional Polynomial Optimization via de Finetti Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.OC","authors_text":"Eitan Levin, Venkat Chandrasekaran","submitted_at":"2025-07-21T13:55:00Z","abstract_excerpt":"Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examples include certifying inequalities between symmetric functions or graph homomorphism densities that hold over vectors and graphs of all sizes, and computing the value of mean-field games viewed as limits of games with a growing number of players. In this paper, we study such any-dimensional polynomial problems using the theory of representation stability, and we develop a systematic framework to produce hierarchies "},"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":"2507.15632","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-21T13:55:00Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"4e11a66238c29aed40f17f8193cef02432c6e94ad1e50ba0884c0f70a06c98ac","abstract_canon_sha256":"8a9ecedde66ed5039317617ad2fc3a19202383ca0f41bdf659f83827082ed2ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:14:40.088698Z","signature_b64":"zqFJXGBnacjL3hgCt6Irdj8Xf2aKy6vl9Wa3qVzgxCx94vrz4viVgma+Re5lrv/SoV9mjzCyX0aY75iRQOxGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58d6b6c5463024b77e2dae1b5f516fefbe888bd4aca5b5a920e432195486e25c","last_reissued_at":"2026-08-06T01:14:40.087122Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:14:40.087122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Any-Dimensional Polynomial Optimization via de Finetti Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.OC","authors_text":"Eitan Levin, Venkat Chandrasekaran","submitted_at":"2025-07-21T13:55:00Z","abstract_excerpt":"Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examples include certifying inequalities between symmetric functions or graph homomorphism densities that hold over vectors and graphs of all sizes, and computing the value of mean-field games viewed as limits of games with a growing number of players. In this paper, we study such any-dimensional polynomial problems using the theory of representation stability, and we develop a systematic framework to produce hierarchies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15632","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.15632/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":"2507.15632","created_at":"2026-08-06T01:14:40.088617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15632v3","created_at":"2026-08-06T01:14:40.088617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15632","created_at":"2026-08-06T01:14:40.088617+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDLLNRKGGASL","created_at":"2026-08-06T01:14:40.088617+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDLLNRKGGASLO7RN","created_at":"2026-08-06T01:14:40.088617+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDLLNRKG","created_at":"2026-08-06T01:14:40.088617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07680","citing_title":"Any-Dimensional Learning by Sampling","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27551","citing_title":"Any-dimensional Positivstellens\\\"atze for symmetric functions","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56","json":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56.json","graph_json":"https://pith.science/api/pith-number/LDLLNRKGGASLO7RNVYNV6ULP56/graph.json","events_json":"https://pith.science/api/pith-number/LDLLNRKGGASLO7RNVYNV6ULP56/events.json","paper":"https://pith.science/paper/LDLLNRKG"},"agent_actions":{"view_html":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56","download_json":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56.json","view_paper":"https://pith.science/paper/LDLLNRKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15632&json=true","fetch_graph":"https://pith.science/api/pith-number/LDLLNRKGGASLO7RNVYNV6ULP56/graph.json","fetch_events":"https://pith.science/api/pith-number/LDLLNRKGGASLO7RNVYNV6ULP56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56/action/storage_attestation","attest_author":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56/action/author_attestation","sign_citation":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56/action/citation_signature","submit_replication":"https://pith.science/pith/LDLLNRKGGASLO7RNVYNV6ULP56/action/replication_record"}},"created_at":"2026-08-06T01:14:40.088617+00:00","updated_at":"2026-08-06T01:14:40.088617+00:00"}