{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T3XD5UROVCCZEXJRB6W2RHRABJ","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":"0eb60b5479e018198c58cb2d5b6a58c806494c7bc63b7dcdb187785bcdb46925","cross_cats_sorted":["cs.LG","math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-20T20:57:14Z","title_canon_sha256":"ff0de20430222ae1bb2648c4bb6d617a5329722c82202e2f63b216819291feb4"},"schema_version":"1.0","source":{"id":"1710.07702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07702","created_at":"2026-07-05T00:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07702v2","created_at":"2026-07-05T00:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07702","created_at":"2026-07-05T00:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"T3XD5UROVCCZ","created_at":"2026-07-05T00:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"T3XD5UROVCCZEXJR","created_at":"2026-07-05T00:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"T3XD5URO","created_at":"2026-07-05T00:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:072e0a5812a4db3a0359c7e73b7ddb914f72f11f8857d5060a3d8d1f26a941cd","target":"graph","created_at":"2026-07-05T00:32:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1710.07702/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate scalings of graph parameters that provably lead to a well-defined limiting posterior as the size of the unlabeled data set grows. Furthermore, we show that these consistency results have profound algorithmic implications. When consistency holds, carefully designed graph-based Markov chain Monte Carlo algorithms are proved to have a uniform spectral gap, ind","authors_text":"Daniel Sanz-Alonso, Nicolas Garcia Trillos, Thabo Samakhoana, Zachary Kaplan","cross_cats":["cs.LG","math.PR","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-20T20:57:14Z","title":"On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07702","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:40d135fba196f159c4a0272bb9a9d0c4c7e85041d6b743ff472e36420b04e64e","target":"record","created_at":"2026-07-05T00:32:46Z","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":"0eb60b5479e018198c58cb2d5b6a58c806494c7bc63b7dcdb187785bcdb46925","cross_cats_sorted":["cs.LG","math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-20T20:57:14Z","title_canon_sha256":"ff0de20430222ae1bb2648c4bb6d617a5329722c82202e2f63b216819291feb4"},"schema_version":"1.0","source":{"id":"1710.07702","kind":"arxiv","version":2}},"canonical_sha256":"9eee3ed22ea885925d310fada89e200a6526f7a648e9939977240a2f985b1657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eee3ed22ea885925d310fada89e200a6526f7a648e9939977240a2f985b1657","first_computed_at":"2026-07-05T00:32:46.545029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:46.545029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SZHUYM8paZMSwXVV25pPRrRCR81Pldi18Tb8Cw2nodcoc+RaQebWrcEGEO7VoyM5Qn9rGu5mRiorhmeh1JVKDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:46.545437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40d135fba196f159c4a0272bb9a9d0c4c7e85041d6b743ff472e36420b04e64e","sha256:072e0a5812a4db3a0359c7e73b7ddb914f72f11f8857d5060a3d8d1f26a941cd"],"state_sha256":"5b74d75418bef3e99908d1d60cce1e204ff0dbe19f5d30d440474069420bc159"}