{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YAVNEUSDWOBH75VZXMIWAV75WI","short_pith_number":"pith:YAVNEUSD","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"},"canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","source":{"kind":"arxiv","id":"1901.07361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07361","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07361v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07361","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"YAVNEUSDWOBH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YAVNEUSDWOBH75VZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YAVNEUSD","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YAVNEUSDWOBH75VZXMIWAV75WI","target":"record","payload":{"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"},"canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","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"},"source_kind":"arxiv","source_id":"1901.07361","source_version":2,"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7pCcRAautQD0kEatRpcIFE2iXIQoIUrXT7QZ2wE2+RUExrMzrVmet1PplkxcVyhhTFNBUCxsv+6/WfOuN4FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:25:17.040181Z"},"content_sha256":"af0240997ec678c4159df17404dfd6d5cfed16470dc54e2103281e71108985ee","schema_version":"1.0","event_id":"sha256:af0240997ec678c4159df17404dfd6d5cfed16470dc54e2103281e71108985ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YAVNEUSDWOBH75VZXMIWAV75WI","target":"graph","payload":{"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"},"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbgxR7pS6/BWNO0cXrXLJkUaqYGei5dQPYjKLUggUzxDWib3SLUrdNCXHZ2PT+QZOJqWC6iaa1LQ+lMpYG6yCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:25:17.040549Z"},"content_sha256":"c825af2110f313b762a2ae576312c2b9c8f44dbd77f8564452a98ff1a2ec2d55","schema_version":"1.0","event_id":"sha256:c825af2110f313b762a2ae576312c2b9c8f44dbd77f8564452a98ff1a2ec2d55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/bundle.json","state_url":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAVNEUSDWOBH75VZXMIWAV75WI/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-06-12T10:25:17Z","links":{"resolver":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI","bundle":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/bundle.json","state":"https://pith.science/pith/YAVNEUSDWOBH75VZXMIWAV75WI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAVNEUSDWOBH75VZXMIWAV75WI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YAVNEUSDWOBH75VZXMIWAV75WI","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":"c052ae3a69cda302396e36d8dda2525ec98ea84561b9227995e59ddcba4c3dbe","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T14:50:30Z","title_canon_sha256":"bd24f8da5db44cd74306bb7f3a1ceb118d07fd4f42abc4fa362828a4cdbf8c34"},"schema_version":"1.0","source":{"id":"1901.07361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07361","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07361v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07361","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"YAVNEUSDWOBH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YAVNEUSDWOBH75VZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YAVNEUSD","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c825af2110f313b762a2ae576312c2b9c8f44dbd77f8564452a98ff1a2ec2d55","target":"graph","created_at":"2026-05-17T23:42:49Z","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 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","authors_text":"Antonio Blanca, Daniel \\v{S}tefankovi\\v{c}, Eric Vigoda, Ivona Bezakova, Zongchen Chen","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T14:50:30Z","title":"Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07361","kind":"arxiv","version":2},"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:af0240997ec678c4159df17404dfd6d5cfed16470dc54e2103281e71108985ee","target":"record","created_at":"2026-05-17T23:42:49Z","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":"c052ae3a69cda302396e36d8dda2525ec98ea84561b9227995e59ddcba4c3dbe","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T14:50:30Z","title_canon_sha256":"bd24f8da5db44cd74306bb7f3a1ceb118d07fd4f42abc4fa362828a4cdbf8c34"},"schema_version":"1.0","source":{"id":"1901.07361","kind":"arxiv","version":2}},"canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c02ad25243b3827ff6b9bb116057fdb20efe75dcb67f4706c095e8b7b5df72b3","first_computed_at":"2026-05-17T23:42:49.812798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.812798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HMN0b087ZC3kEIxrW+Cvsm03yZVGUv/Oyjov3VvVJHS1cFI4cszH/zo1TDrjrvbJTLKE6YWIquXZCVOyr4YYCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.813272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af0240997ec678c4159df17404dfd6d5cfed16470dc54e2103281e71108985ee","sha256:c825af2110f313b762a2ae576312c2b9c8f44dbd77f8564452a98ff1a2ec2d55"],"state_sha256":"982045c24b96bfd440762fc24a0f6169308f860253acbc750fe9d48914720019"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDF+4FvKWaNzelrRPI7iWhBBGDH2StKgoDiSMAGPU3eZPLrMkc+5e4GIyIj67ZKrADl7Vnc20JYOi4fs5QvLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:25:17.042652Z","bundle_sha256":"d9cbac8bab16ed11a9d31be191f93130ec328c4a7ac97bcb3fe1b9038fb024d7"}}