{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:OGEQRRLCVGNY3JSSBX2ILDVV5Z","short_pith_number":"pith:OGEQRRLC","canonical_record":{"source":{"id":"2003.13933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-31T03:12:20Z","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"4e6f76c4612b9854dc8e2aabee4e166491153dae99764b58b5a9abe148d43249","abstract_canon_sha256":"61c7c019feb37be0448e3817e2393abe215a28df6923b11d4536162331e7746c"},"schema_version":"1.0"},"canonical_sha256":"718908c562a99b8da6520df4858eb5ee7f58397e04be56088d30a9b60ff4b53f","source":{"kind":"arxiv","id":"2003.13933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13933","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13933v2","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13933","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"OGEQRRLCVGNY","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_16","alias_value":"OGEQRRLCVGNY3JSS","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_8","alias_value":"OGEQRRLC","created_at":"2026-07-05T01:39:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:OGEQRRLCVGNY3JSSBX2ILDVV5Z","target":"record","payload":{"canonical_record":{"source":{"id":"2003.13933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-31T03:12:20Z","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"4e6f76c4612b9854dc8e2aabee4e166491153dae99764b58b5a9abe148d43249","abstract_canon_sha256":"61c7c019feb37be0448e3817e2393abe215a28df6923b11d4536162331e7746c"},"schema_version":"1.0"},"canonical_sha256":"718908c562a99b8da6520df4858eb5ee7f58397e04be56088d30a9b60ff4b53f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:57.079707Z","signature_b64":"lxsXXNPvC/FBtk0G0JjzG2O+ix+nRnTp6CgNguZsMAUMpIP+7KozHLCB5NmqfFaxheTeKl8Xe4Nnuiq27ciyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"718908c562a99b8da6520df4858eb5ee7f58397e04be56088d30a9b60ff4b53f","last_reissued_at":"2026-07-05T01:39:57.079164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:57.079164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.13933","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-07-05T01:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjqfDSB60n+NUC/2eNnn8tmoKtaNhhp6Tbu+g2COxw/UBaVlDD6BsUJ5vAIF+fdfvoPnyzRm23Evl8/k/qEzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:30:03.337142Z"},"content_sha256":"c6bb9766b4b723a152de489be463cae92c6300a7dd925434bd25debdad941628","schema_version":"1.0","event_id":"sha256:c6bb9766b4b723a152de489be463cae92c6300a7dd925434bd25debdad941628"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:OGEQRRLCVGNY3JSSBX2ILDVV5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference with Aggregate Data: An Optimal Transport Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Isabel Haasler, Johan Karlsson, Qinsheng Zhang, Rahul Singh, Yongxin Chen","submitted_at":"2020-03-31T03:12:20Z","abstract_excerpt":"We consider inference (filtering) problems over probabilistic graphical models with aggregate data generated by a large population of individuals. We propose a new efficient belief propagation type algorithm over tree-structured graphs with polynomial computational complexity as well as a global convergence guarantee. This is in contrast to previous methods that either exhibit prohibitive complexity as the population grows or do not guarantee convergence. Our method is based on optimal transport, or more specifically, multi-marginal optimal transport theory. In particular, we consider an infer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13933","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.13933/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMbeBXJA45K+FZGWrqhT2Orhf70geuutk4EiezmqmXTHWwj/PkAe86CQPjOb9DHdmcHmhOw1NDFpYZbFrsQLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:30:03.337821Z"},"content_sha256":"7fe5e21843f4d568df61f7b32dac47a5ecc801db83d53b15a285fc6f92a5b81e","schema_version":"1.0","event_id":"sha256:7fe5e21843f4d568df61f7b32dac47a5ecc801db83d53b15a285fc6f92a5b81e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/bundle.json","state_url":"https://pith.science/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/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-07-06T23:30:03Z","links":{"resolver":"https://pith.science/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z","bundle":"https://pith.science/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/bundle.json","state":"https://pith.science/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGEQRRLCVGNY3JSSBX2ILDVV5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OGEQRRLCVGNY3JSSBX2ILDVV5Z","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":"61c7c019feb37be0448e3817e2393abe215a28df6923b11d4536162331e7746c","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-31T03:12:20Z","title_canon_sha256":"4e6f76c4612b9854dc8e2aabee4e166491153dae99764b58b5a9abe148d43249"},"schema_version":"1.0","source":{"id":"2003.13933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13933","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13933v2","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13933","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"OGEQRRLCVGNY","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_16","alias_value":"OGEQRRLCVGNY3JSS","created_at":"2026-07-05T01:39:57Z"},{"alias_kind":"pith_short_8","alias_value":"OGEQRRLC","created_at":"2026-07-05T01:39:57Z"}],"graph_snapshots":[{"event_id":"sha256:7fe5e21843f4d568df61f7b32dac47a5ecc801db83d53b15a285fc6f92a5b81e","target":"graph","created_at":"2026-07-05T01:39:57Z","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/2003.13933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider inference (filtering) problems over probabilistic graphical models with aggregate data generated by a large population of individuals. We propose a new efficient belief propagation type algorithm over tree-structured graphs with polynomial computational complexity as well as a global convergence guarantee. This is in contrast to previous methods that either exhibit prohibitive complexity as the population grows or do not guarantee convergence. Our method is based on optimal transport, or more specifically, multi-marginal optimal transport theory. In particular, we consider an infer","authors_text":"Isabel Haasler, Johan Karlsson, Qinsheng Zhang, Rahul Singh, Yongxin Chen","cross_cats":["cs.SY","eess.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-31T03:12:20Z","title":"Inference with Aggregate Data: An Optimal Transport Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13933","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:c6bb9766b4b723a152de489be463cae92c6300a7dd925434bd25debdad941628","target":"record","created_at":"2026-07-05T01:39:57Z","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":"61c7c019feb37be0448e3817e2393abe215a28df6923b11d4536162331e7746c","cross_cats_sorted":["cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-31T03:12:20Z","title_canon_sha256":"4e6f76c4612b9854dc8e2aabee4e166491153dae99764b58b5a9abe148d43249"},"schema_version":"1.0","source":{"id":"2003.13933","kind":"arxiv","version":2}},"canonical_sha256":"718908c562a99b8da6520df4858eb5ee7f58397e04be56088d30a9b60ff4b53f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"718908c562a99b8da6520df4858eb5ee7f58397e04be56088d30a9b60ff4b53f","first_computed_at":"2026-07-05T01:39:57.079164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:39:57.079164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lxsXXNPvC/FBtk0G0JjzG2O+ix+nRnTp6CgNguZsMAUMpIP+7KozHLCB5NmqfFaxheTeKl8Xe4Nnuiq27ciyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:39:57.079707Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.13933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6bb9766b4b723a152de489be463cae92c6300a7dd925434bd25debdad941628","sha256:7fe5e21843f4d568df61f7b32dac47a5ecc801db83d53b15a285fc6f92a5b81e"],"state_sha256":"892ef7eecccf500df053d70f0f5bcc65c0ea2b87824e70e0a84d3ddd573d0052"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TATx8GfPl+nbVKfLnKyEf41JNRKarlqk3dDE454E4Sqzg+0SITBiqHCfqyoqBNur3o79EmGSTCY7cSuj/J03BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:30:03.340657Z","bundle_sha256":"461b8b144cfa60097e66c3196bd0ec67be3f31ca17e9a8c5433c8c6ee395c34a"}}