{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CJ6PT6ZFQ277FBQQTGVTLBZQDI","short_pith_number":"pith:CJ6PT6ZF","schema_version":"1.0","canonical_sha256":"127cf9fb2586bff2861099ab3587301a22a311c78b99554d1a222ff4ba5e5928","source":{"kind":"arxiv","id":"1210.4899","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4899","created_at":"2026-05-18T03:42:55.056935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4899v1","created_at":"2026-05-18T03:42:55.056935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4899","created_at":"2026-05-18T03:42:55.056935+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJ6PT6ZFQ277","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJ6PT6ZFQ277FBQQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJ6PT6ZF","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI","json":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI.json","graph_json":"https://pith.science/api/pith-number/CJ6PT6ZFQ277FBQQTGVTLBZQDI/graph.json","events_json":"https://pith.science/api/pith-number/CJ6PT6ZFQ277FBQQTGVTLBZQDI/events.json","paper":"https://pith.science/paper/CJ6PT6ZF"},"agent_actions":{"view_html":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI","download_json":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI.json","view_paper":"https://pith.science/paper/CJ6PT6ZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4899&json=true","fetch_graph":"https://pith.science/api/pith-number/CJ6PT6ZFQ277FBQQTGVTLBZQDI/graph.json","fetch_events":"https://pith.science/api/pith-number/CJ6PT6ZFQ277FBQQTGVTLBZQDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/action/storage_attestation","attest_author":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/action/author_attestation","sign_citation":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/action/citation_signature","submit_replication":"https://pith.science/pith/CJ6PT6ZFQ277FBQQTGVTLBZQDI/action/replication_record"}},"created_at":"2026-05-18T03:42:55.056935+00:00","updated_at":"2026-05-18T03:42:55.056935+00:00"}