{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KA3CQXYFWI6OEJHMTGXJBEXKUJ","short_pith_number":"pith:KA3CQXYF","canonical_record":{"source":{"id":"1710.10366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-28T01:13:24Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"452c065d1a37deb00316928e6732c702e9aa23c7406d39bbf1acd46ffaf903b4","abstract_canon_sha256":"18f2df9d3c099f4460e6b96fdee1315f53b1f5b853b3deadb26c98fc83ce5cac"},"schema_version":"1.0"},"canonical_sha256":"5036285f05b23ce224ec99ae9092eaa26c30d4861c2985120d82cb3b990d2301","source":{"kind":"arxiv","id":"1710.10366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10366","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10366v1","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10366","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"pith_short_12","alias_value":"KA3CQXYFWI6O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KA3CQXYFWI6OEJHM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KA3CQXYF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KA3CQXYFWI6OEJHMTGXJBEXKUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-28T01:13:24Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"452c065d1a37deb00316928e6732c702e9aa23c7406d39bbf1acd46ffaf903b4","abstract_canon_sha256":"18f2df9d3c099f4460e6b96fdee1315f53b1f5b853b3deadb26c98fc83ce5cac"},"schema_version":"1.0"},"canonical_sha256":"5036285f05b23ce224ec99ae9092eaa26c30d4861c2985120d82cb3b990d2301","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:49.744499Z","signature_b64":"XFQq0ixtr+aPenFTwIlWIpwpOGx2zjOa5V9fE2K70gma8wFby7apT7PH4w38KixHTZstfHDR0BWQU1lg0jrAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5036285f05b23ce224ec99ae9092eaa26c30d4861c2985120d82cb3b990d2301","last_reissued_at":"2026-05-18T00:31:49.743785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:49.743785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10366","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-05-18T00:31:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sat3xHr+4ydG6Cc+k77oPaWVd+zsLrB3CcHwIQfSpAm2HqPqmlUosNxMEvE8cOonIxNygLWdtpNnfPH0KhlBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:50:57.314665Z"},"content_sha256":"490540fc7106ae5da00749cc2db4dc7ecd413017d36eda3de97cb5251dc4a25f","schema_version":"1.0","event_id":"sha256:490540fc7106ae5da00749cc2db4dc7ecd413017d36eda3de97cb5251dc4a25f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KA3CQXYFWI6OEJHMTGXJBEXKUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Two-Sample Structural Change Detection in Ising and Gaussian Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Aditya Gangrade, Bobak Nazer, Venkatesh Saligrama","submitted_at":"2017-10-28T01:13:24Z","abstract_excerpt":"The change detection problem is to determine if the Markov network structures of two Markov random fields differ from one another given two sets of samples drawn from the respective underlying distributions. We study the trade-off between the sample sizes and the reliability of change detection, measured as a minimax risk, for the important cases of the Ising models and the Gaussian Markov random fields restricted to the models which have network structures with $p$ nodes and degree at most $d$, and obtain information-theoretic lower bounds for reliable change detection over these models. We s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10366","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":""},"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-18T00:31:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtUmDp1pk9onWKpvYBWNc+L/ZdUHVItdyertLAYNExFW4BbkSPitNr7aGXK6Ua1PN3cXyn3w3Iyj1XlRUBouCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:50:57.315419Z"},"content_sha256":"c3c6e29dd30378d06ff365833063512a66d6b0cac3c641f10090265505fed71e","schema_version":"1.0","event_id":"sha256:c3c6e29dd30378d06ff365833063512a66d6b0cac3c641f10090265505fed71e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/bundle.json","state_url":"https://pith.science/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/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-05-30T21:50:57Z","links":{"resolver":"https://pith.science/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ","bundle":"https://pith.science/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/bundle.json","state":"https://pith.science/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KA3CQXYFWI6OEJHMTGXJBEXKUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KA3CQXYFWI6OEJHMTGXJBEXKUJ","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":"18f2df9d3c099f4460e6b96fdee1315f53b1f5b853b3deadb26c98fc83ce5cac","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-28T01:13:24Z","title_canon_sha256":"452c065d1a37deb00316928e6732c702e9aa23c7406d39bbf1acd46ffaf903b4"},"schema_version":"1.0","source":{"id":"1710.10366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10366","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10366v1","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10366","created_at":"2026-05-18T00:31:49Z"},{"alias_kind":"pith_short_12","alias_value":"KA3CQXYFWI6O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KA3CQXYFWI6OEJHM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KA3CQXYF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:c3c6e29dd30378d06ff365833063512a66d6b0cac3c641f10090265505fed71e","target":"graph","created_at":"2026-05-18T00:31: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":"The change detection problem is to determine if the Markov network structures of two Markov random fields differ from one another given two sets of samples drawn from the respective underlying distributions. We study the trade-off between the sample sizes and the reliability of change detection, measured as a minimax risk, for the important cases of the Ising models and the Gaussian Markov random fields restricted to the models which have network structures with $p$ nodes and degree at most $d$, and obtain information-theoretic lower bounds for reliable change detection over these models. We s","authors_text":"Aditya Gangrade, Bobak Nazer, Venkatesh Saligrama","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-28T01:13:24Z","title":"Lower Bounds for Two-Sample Structural Change Detection in Ising and Gaussian Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10366","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:490540fc7106ae5da00749cc2db4dc7ecd413017d36eda3de97cb5251dc4a25f","target":"record","created_at":"2026-05-18T00:31: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":"18f2df9d3c099f4460e6b96fdee1315f53b1f5b853b3deadb26c98fc83ce5cac","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-28T01:13:24Z","title_canon_sha256":"452c065d1a37deb00316928e6732c702e9aa23c7406d39bbf1acd46ffaf903b4"},"schema_version":"1.0","source":{"id":"1710.10366","kind":"arxiv","version":1}},"canonical_sha256":"5036285f05b23ce224ec99ae9092eaa26c30d4861c2985120d82cb3b990d2301","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5036285f05b23ce224ec99ae9092eaa26c30d4861c2985120d82cb3b990d2301","first_computed_at":"2026-05-18T00:31:49.743785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:49.743785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XFQq0ixtr+aPenFTwIlWIpwpOGx2zjOa5V9fE2K70gma8wFby7apT7PH4w38KixHTZstfHDR0BWQU1lg0jrAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:49.744499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:490540fc7106ae5da00749cc2db4dc7ecd413017d36eda3de97cb5251dc4a25f","sha256:c3c6e29dd30378d06ff365833063512a66d6b0cac3c641f10090265505fed71e"],"state_sha256":"2d85d8d904ece3cf6c49375469fc23c26db55d4517f573a26c2046edb4553e25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSGxHCrWEpEpmjuaNkWGh76wGMa7bIVC/SFCkNXE0aiJaa1z5FmZaQKnBV47q8/14KfWBtQrGZRPZmMNPHm0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:50:57.320028Z","bundle_sha256":"2a34bc44f857501ce69e61d2e842e23152800e5a0c9e96f02ff7d893bf3afa4d"}}