{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:576DENKNAOPWFLZ3MYGFGWHBAB","short_pith_number":"pith:576DENKN","schema_version":"1.0","canonical_sha256":"effc32354d039f62af3b660c5358e1004b16c0a4c031cee575f25982c68163da","source":{"kind":"arxiv","id":"1802.06129","version":2},"attestation_state":"computed","paper":{"title":"The Vertex Sample Complexity of Free Energy is Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, Frederic Koehler, Vishesh Jain","submitted_at":"2018-02-16T21:25:42Z","abstract_excerpt":"We study the following question: given a massive Markov random field on $n$ nodes, can a small sample from it provide a rough approximation to the free energy $\\mathcal{F}_n = \\log{Z_n}$?\n  Results in graph limit literature by Borgs, Chayes, Lov\\'asz, S\\'os, and Vesztergombi show that for Ising models on $n$ nodes and interactions of strength $\\Theta(1/n)$, an $\\epsilon$ approximation to $\\log Z_n / n$ can be achieved by sampling a randomly induced model on $2^{O(1/\\epsilon^2)}$ nodes. We show that the sampling complexity of this problem is {\\em polynomial in} $1/\\epsilon$. We further show a p"},"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":"1802.06129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-16T21:25:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e837528ca54602ed0b68d094e709cc32092383e4a41ca4f4b021693da4c34b3f","abstract_canon_sha256":"729295a5d549df4a4d68d7d58c66559df1c746102bcc329c9ec83838e7604d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.874893Z","signature_b64":"tbihto61GwWNPr0aoLnM6ivZ8QJXvqs4x/v9J6213598Phc6Unid5f8Yvd5OgeMGs5akEEEDuw2CFGgfpU33Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc32354d039f62af3b660c5358e1004b16c0a4c031cee575f25982c68163da","last_reissued_at":"2026-05-18T00:22:36.874410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.874410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Vertex Sample Complexity of Free Energy is Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, Frederic Koehler, Vishesh Jain","submitted_at":"2018-02-16T21:25:42Z","abstract_excerpt":"We study the following question: given a massive Markov random field on $n$ nodes, can a small sample from it provide a rough approximation to the free energy $\\mathcal{F}_n = \\log{Z_n}$?\n  Results in graph limit literature by Borgs, Chayes, Lov\\'asz, S\\'os, and Vesztergombi show that for Ising models on $n$ nodes and interactions of strength $\\Theta(1/n)$, an $\\epsilon$ approximation to $\\log Z_n / n$ can be achieved by sampling a randomly induced model on $2^{O(1/\\epsilon^2)}$ nodes. We show that the sampling complexity of this problem is {\\em polynomial in} $1/\\epsilon$. We further show a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06129","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.06129","created_at":"2026-05-18T00:22:36.874487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06129v2","created_at":"2026-05-18T00:22:36.874487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06129","created_at":"2026-05-18T00:22:36.874487+00:00"},{"alias_kind":"pith_short_12","alias_value":"576DENKNAOPW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"576DENKNAOPWFLZ3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"576DENKN","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB","json":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB.json","graph_json":"https://pith.science/api/pith-number/576DENKNAOPWFLZ3MYGFGWHBAB/graph.json","events_json":"https://pith.science/api/pith-number/576DENKNAOPWFLZ3MYGFGWHBAB/events.json","paper":"https://pith.science/paper/576DENKN"},"agent_actions":{"view_html":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB","download_json":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB.json","view_paper":"https://pith.science/paper/576DENKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06129&json=true","fetch_graph":"https://pith.science/api/pith-number/576DENKNAOPWFLZ3MYGFGWHBAB/graph.json","fetch_events":"https://pith.science/api/pith-number/576DENKNAOPWFLZ3MYGFGWHBAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB/action/storage_attestation","attest_author":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB/action/author_attestation","sign_citation":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB/action/citation_signature","submit_replication":"https://pith.science/pith/576DENKNAOPWFLZ3MYGFGWHBAB/action/replication_record"}},"created_at":"2026-05-18T00:22:36.874487+00:00","updated_at":"2026-05-18T00:22:36.874487+00:00"}