{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C66FXZPJWVI424XYJSAWJKDZEL","short_pith_number":"pith:C66FXZPJ","canonical_record":{"source":{"id":"1407.0581","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T14:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"65eb216f38246e701d791638f47af8974a72d9737887ef3e7be9a41384fd1997","abstract_canon_sha256":"2d9d6c91bf5dd019ada539a1fa75c9cd6d0ae9f51c8ddbd2eaf7370b36576ad7"},"schema_version":"1.0"},"canonical_sha256":"17bc5be5e9b551cd72f84c8164a87922c5fc925e7a878bad9411f3e9af3113c2","source":{"kind":"arxiv","id":"1407.0581","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0581","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0581v10","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0581","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"C66FXZPJWVI4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C66FXZPJWVI424XY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C66FXZPJ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C66FXZPJWVI424XYJSAWJKDZEL","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0581","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T14:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"65eb216f38246e701d791638f47af8974a72d9737887ef3e7be9a41384fd1997","abstract_canon_sha256":"2d9d6c91bf5dd019ada539a1fa75c9cd6d0ae9f51c8ddbd2eaf7370b36576ad7"},"schema_version":"1.0"},"canonical_sha256":"17bc5be5e9b551cd72f84c8164a87922c5fc925e7a878bad9411f3e9af3113c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:30.964640Z","signature_b64":"BK5Y3DD4hVF8YcFSSqzuUU0p8aHuAsY2Trbk1GG/CZCaWrXSIJ0ptcxlBpKrZhQg9Ias9XPDya26RdTPQ96hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17bc5be5e9b551cd72f84c8164a87922c5fc925e7a878bad9411f3e9af3113c2","last_reissued_at":"2026-05-18T01:17:30.963942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:30.963942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0581","source_version":10,"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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8C1ytHvGmn4Yh5eCDmWpHPBpL8TBVq9qAgAHe8NK9tppUZVoXBRIyOxYmgFSYWHf0LaMB0xWP9NKZaPQ/4YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:03:13.891885Z"},"content_sha256":"51295540c33932c374758d9f9a37aa8cd8d6cf92df260c7aed3d6cd4a00c7cdf","schema_version":"1.0","event_id":"sha256:51295540c33932c374758d9f9a37aa8cd8d6cf92df260c7aed3d6cd4a00c7cdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C66FXZPJWVI424XYJSAWJKDZEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Support Consistency of Direct Sparse-Change Learning in Markov Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jun Sese, Kenji Fukumizu, Masashi Sugiyama, Raissa Relator, Song Liu, Taiji Suzuki","submitted_at":"2014-07-02T14:27:48Z","abstract_excerpt":"We study the problem of learning sparse structure changes between two Markov networks $P$ and $Q$. Rather than fitting two Markov networks separately to two sets of data and figuring out their differences, a recent work proposed to learn changes \\emph{directly} via estimating the ratio between two Markov network models. In this paper, we give sufficient conditions for \\emph{successful change detection} with respect to the sample size $n_p, n_q$, the dimension of data $m$, and the number of changed edges $d$. When using an unbounded density ratio model we prove that the true sparse changes can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0581","kind":"arxiv","version":10},"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-18T01:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y03JgnHqLt0lUN9ql37nPeMDjuzIrrrusT5U51BB7zEQXmVDhHfRDZI2D1YnmAyaI+lavEa9KLZbhaC4otSQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:03:13.892559Z"},"content_sha256":"c425ae6a236186973fcee310ecccb1017d5ac17d80bcc6ec78b3f66c4924371e","schema_version":"1.0","event_id":"sha256:c425ae6a236186973fcee310ecccb1017d5ac17d80bcc6ec78b3f66c4924371e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C66FXZPJWVI424XYJSAWJKDZEL/bundle.json","state_url":"https://pith.science/pith/C66FXZPJWVI424XYJSAWJKDZEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C66FXZPJWVI424XYJSAWJKDZEL/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-29T15:03:13Z","links":{"resolver":"https://pith.science/pith/C66FXZPJWVI424XYJSAWJKDZEL","bundle":"https://pith.science/pith/C66FXZPJWVI424XYJSAWJKDZEL/bundle.json","state":"https://pith.science/pith/C66FXZPJWVI424XYJSAWJKDZEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C66FXZPJWVI424XYJSAWJKDZEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C66FXZPJWVI424XYJSAWJKDZEL","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":"2d9d6c91bf5dd019ada539a1fa75c9cd6d0ae9f51c8ddbd2eaf7370b36576ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T14:27:48Z","title_canon_sha256":"65eb216f38246e701d791638f47af8974a72d9737887ef3e7be9a41384fd1997"},"schema_version":"1.0","source":{"id":"1407.0581","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0581","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0581v10","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0581","created_at":"2026-05-18T01:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"C66FXZPJWVI4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C66FXZPJWVI424XY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C66FXZPJ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:c425ae6a236186973fcee310ecccb1017d5ac17d80bcc6ec78b3f66c4924371e","target":"graph","created_at":"2026-05-18T01:17:30Z","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 problem of learning sparse structure changes between two Markov networks $P$ and $Q$. Rather than fitting two Markov networks separately to two sets of data and figuring out their differences, a recent work proposed to learn changes \\emph{directly} via estimating the ratio between two Markov network models. In this paper, we give sufficient conditions for \\emph{successful change detection} with respect to the sample size $n_p, n_q$, the dimension of data $m$, and the number of changed edges $d$. When using an unbounded density ratio model we prove that the true sparse changes can ","authors_text":"Jun Sese, Kenji Fukumizu, Masashi Sugiyama, Raissa Relator, Song Liu, Taiji Suzuki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T14:27:48Z","title":"Support Consistency of Direct Sparse-Change Learning in Markov Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0581","kind":"arxiv","version":10},"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:51295540c33932c374758d9f9a37aa8cd8d6cf92df260c7aed3d6cd4a00c7cdf","target":"record","created_at":"2026-05-18T01:17:30Z","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":"2d9d6c91bf5dd019ada539a1fa75c9cd6d0ae9f51c8ddbd2eaf7370b36576ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T14:27:48Z","title_canon_sha256":"65eb216f38246e701d791638f47af8974a72d9737887ef3e7be9a41384fd1997"},"schema_version":"1.0","source":{"id":"1407.0581","kind":"arxiv","version":10}},"canonical_sha256":"17bc5be5e9b551cd72f84c8164a87922c5fc925e7a878bad9411f3e9af3113c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17bc5be5e9b551cd72f84c8164a87922c5fc925e7a878bad9411f3e9af3113c2","first_computed_at":"2026-05-18T01:17:30.963942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:30.963942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BK5Y3DD4hVF8YcFSSqzuUU0p8aHuAsY2Trbk1GG/CZCaWrXSIJ0ptcxlBpKrZhQg9Ias9XPDya26RdTPQ96hAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:30.964640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0581","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51295540c33932c374758d9f9a37aa8cd8d6cf92df260c7aed3d6cd4a00c7cdf","sha256:c425ae6a236186973fcee310ecccb1017d5ac17d80bcc6ec78b3f66c4924371e"],"state_sha256":"02f12ad47f24cdbb46b3bec3d5ea96a4ac088d7d7a680c3e91ff0aa2842979ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUZyTsOhPh6Vv08Lp4NO7lhZ79CvSU+TBNycircfcCD1+RhWGQPUFxFh4+MnrnWmCk/k0LeBUwLEaQ7nlCK5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:03:13.896406Z","bundle_sha256":"0ecd2f1050c8f4d3ab94b9c2f6848a1a49130a6e7394d93a0223c6005ec0d432"}}