{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CJ6PT6ZFQ277FBQQTGVTLBZQDI","short_pith_number":"pith:CJ6PT6ZF","canonical_record":{"source":{"id":"1210.4899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:50:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"81f4995471d25606c48bb86003be03655bb138ee93d56dcf114ba74294a85360","abstract_canon_sha256":"6d4ac321bd6e6e48cb7219146af5a7238df880f152ce8db2e788a98da95c0487"},"schema_version":"1.0"},"canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","source":{"kind":"arxiv","id":"1210.4899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4899","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4899v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4899","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJ6PT6ZFQ277","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJ6PT6ZFQ277FBQQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJ6PT6ZF","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CJ6PT6ZFQ277FBQQTGVTLBZQDI","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:50:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"81f4995471d25606c48bb86003be03655bb138ee93d56dcf114ba74294a85360","abstract_canon_sha256":"6d4ac321bd6e6e48cb7219146af5a7238df880f152ce8db2e788a98da95c0487"},"schema_version":"1.0"},"canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.057403Z","signature_b64":"TOIhgP8ETaZo9CI1Qq+IBcMe8NRhIEY/a15i/gw6PBfOewY/2gJkDPQbHbvtzoJe/7CmDcl2b4N60ixTNOfdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","last_reissued_at":"2026-05-18T03:42:55.056846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.056846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4899","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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIRwrEc2vX4g/uPPEq5nyDB1NLKxPKWbT03eCQqNVBY2rx3i3cbH3sboKbZHf4dLBPpCsQGRPTDHP7Hb/41IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:03.471560Z"},"content_sha256":"2f2da904597fc21ac90ef8e2c27619b764849873ce5f6d6c2b4247e62d31488d","schema_version":"1.0","event_id":"sha256:2f2da904597fc21ac90ef8e2c27619b764849873ce5f6d6c2b4247e62d31488d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CJ6PT6ZFQ277FBQQTGVTLBZQDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Exact Inference for Recursive Cardinality Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendan J. Frey, Daniel Tarlow, Kevin Swersky, Richard S. Zemel, Ryan Prescott Adams","submitted_at":"2012-10-16T17:50:25Z","abstract_excerpt":"Cardinality potentials are a generally useful class of high order potential that affect probabilities based on how many of D binary variables are active. Maximum a posteriori (MAP) inference for cardinality potential models is well-understood, with efficient computations taking O(DlogD) time. Yet efficient marginalization and sampling have not been addressed as thoroughly in the machine learning community. We show that there exists a simple algorithm for computing marginal probabilities and drawing exact joint samples that runs in O(Dlog2 D) time, and we show how to frame the algorithm as effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4899","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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThrGU5mnszOZlM9zbuLWeLNHRqE4vyRw3fqftIqG2zKBvGSZGLGO4e56Dlx/aO7UkeJzLHxHlUmofFsPQN+MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:03.472272Z"},"content_sha256":"c2fec51489fb9a59adcedfe77e1c035a4560208d1c6813b643ee60cfe9df9d34","schema_version":"1.0","event_id":"sha256:c2fec51489fb9a59adcedfe77e1c035a4560208d1c6813b643ee60cfe9df9d34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/bundle.json","state_url":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/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-26T09:48:03Z","links":{"resolver":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI","bundle":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/bundle.json","state":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CJ6PT6ZFQ277FBQQTGVTLBZQDI","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":"6d4ac321bd6e6e48cb7219146af5a7238df880f152ce8db2e788a98da95c0487","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:50:25Z","title_canon_sha256":"81f4995471d25606c48bb86003be03655bb138ee93d56dcf114ba74294a85360"},"schema_version":"1.0","source":{"id":"1210.4899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4899","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4899v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4899","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJ6PT6ZFQ277","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJ6PT6ZFQ277FBQQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJ6PT6ZF","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c2fec51489fb9a59adcedfe77e1c035a4560208d1c6813b643ee60cfe9df9d34","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"Cardinality potentials are a generally useful class of high order potential that affect probabilities based on how many of D binary variables are active. Maximum a posteriori (MAP) inference for cardinality potential models is well-understood, with efficient computations taking O(DlogD) time. Yet efficient marginalization and sampling have not been addressed as thoroughly in the machine learning community. We show that there exists a simple algorithm for computing marginal probabilities and drawing exact joint samples that runs in O(Dlog2 D) time, and we show how to frame the algorithm as effi","authors_text":"Brendan J. Frey, Daniel Tarlow, Kevin Swersky, Richard S. Zemel, Ryan Prescott Adams","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:50:25Z","title":"Fast Exact Inference for Recursive Cardinality Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4899","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:2f2da904597fc21ac90ef8e2c27619b764849873ce5f6d6c2b4247e62d31488d","target":"record","created_at":"2026-05-18T03:42:55Z","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":"6d4ac321bd6e6e48cb7219146af5a7238df880f152ce8db2e788a98da95c0487","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:50:25Z","title_canon_sha256":"81f4995471d25606c48bb86003be03655bb138ee93d56dcf114ba74294a85360"},"schema_version":"1.0","source":{"id":"1210.4899","kind":"arxiv","version":1}},"canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","first_computed_at":"2026-05-18T03:42:55.056846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.056846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOIhgP8ETaZo9CI1Qq+IBcMe8NRhIEY/a15i/gw6PBfOewY/2gJkDPQbHbvtzoJe/7CmDcl2b4N60ixTNOfdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.057403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f2da904597fc21ac90ef8e2c27619b764849873ce5f6d6c2b4247e62d31488d","sha256:c2fec51489fb9a59adcedfe77e1c035a4560208d1c6813b643ee60cfe9df9d34"],"state_sha256":"bc6db2a1cde7c428f0bcfc71a0dba0c743cea8359401c89dfa9a6a29d552a967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coYM6rDlaJXB2WgguU57S9fcAjvLT/p0KsZxFcDx6Rv2zI0OnpwyVs2NesZ+RxQxSPGSv+3r6aC5o3xKrgMOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:48:03.475935Z","bundle_sha256":"05b0daa0c6bdb15f717ea4ec907355e4147cc9359d9bb03157e94533d400d09b"}}