{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YAVNEUSDWOBH75VZXMIWAV75WI","short_pith_number":"pith:YAVNEUSD","schema_version":"1.0","canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","source":{"kind":"arxiv","id":"1901.07361","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"cs.DS","authors_text":"Antonio Blanca, Daniel \\v{S}tefankovi\\v{c}, Eric Vigoda, Ivona Bezakova, Zongchen Chen","submitted_at":"2019-01-22T14:50:30Z","abstract_excerpt":"We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution $\\mu_{\\hat{M}}$ of an unknown model $\\hat{M}$, can we efficiently determine if the two models $M$ and $\\hat{M}$ are the same? We consider identity testing for both soft-constraint and hard-constraint systems. In particular, we prove hardness results in two prototypical cases, the Ising model and proper colorings, and explore whether identity testing is any easier than"},"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":"1901.07361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T14:50:30Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"bd24f8da5db44cd74306bb7f3a1ceb118d07fd4f42abc4fa362828a4cdbf8c34","abstract_canon_sha256":"c052ae3a69cda302396e36d8dda2525ec98ea84561b9227995e59ddcba4c3dbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.813272Z","signature_b64":"HMN0b087ZC3kEIxrW+Cvsm03yZVGUv/Oyjov3VvVJHS1cFI4cszH/zo1TDrjrvbJTLKE6YWIquXZCVOyr4YYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","last_reissued_at":"2026-05-17T23:42:49.812798Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.812798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"cs.DS","authors_text":"Antonio Blanca, Daniel \\v{S}tefankovi\\v{c}, Eric Vigoda, Ivona Bezakova, Zongchen Chen","submitted_at":"2019-01-22T14:50:30Z","abstract_excerpt":"We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution $\\mu_{\\hat{M}}$ of an unknown model $\\hat{M}$, can we efficiently determine if the two models $M$ and $\\hat{M}$ are the same? We consider identity testing for both soft-constraint and hard-constraint systems. In particular, we prove hardness results in two prototypical cases, the Ising model and proper colorings, and explore whether identity testing is any easier than"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07361","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":"1901.07361","created_at":"2026-05-17T23:42:49.812880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07361v2","created_at":"2026-05-17T23:42:49.812880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07361","created_at":"2026-05-17T23:42:49.812880+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAVNEUSDWOBH","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAVNEUSDWOBH75VZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAVNEUSD","created_at":"2026-05-18T12:33:33.725879+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/YAVNEUSDWOBH75VZXMIWAV75WI","json":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI.json","graph_json":"https://pith.science/api/pith-number/YAVNEUSDWOBH75VZXMIWAV75WI/graph.json","events_json":"https://pith.science/api/pith-number/YAVNEUSDWOBH75VZXMIWAV75WI/events.json","paper":"https://pith.science/paper/YAVNEUSD"},"agent_actions":{"view_html":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI","download_json":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI.json","view_paper":"https://pith.science/paper/YAVNEUSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07361&json=true","fetch_graph":"https://pith.science/api/pith-number/YAVNEUSDWOBH75VZXMIWAV75WI/graph.json","fetch_events":"https://pith.science/api/pith-number/YAVNEUSDWOBH75VZXMIWAV75WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/action/storage_attestation","attest_author":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/action/author_attestation","sign_citation":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/action/citation_signature","submit_replication":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/action/replication_record"}},"created_at":"2026-05-17T23:42:49.812880+00:00","updated_at":"2026-05-17T23:42:49.812880+00:00"}