{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZAIHJZL3LWRJIFOPCOCTU4DFLY","short_pith_number":"pith:ZAIHJZL3","schema_version":"1.0","canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","source":{"kind":"arxiv","id":"1501.02627","version":2},"attestation_state":"computed","paper":{"title":"A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.CO","stat.ME","stat.ML"],"primary_cat":"cs.NA","authors_text":"Oliver Serang","submitted_at":"2015-01-12T12:57:01Z","abstract_excerpt":"Observations depending on sums of random variables are common throughout many fields; however, no efficient solution is currently known for performing max-product inference on these sums of general discrete distributions (max-product inference can be used to obtain maximum a posteriori estimates). The limiting step to max-product inference is the max-convolution problem (sometimes presented in log-transformed form and denoted as \"infimal convolution\", \"min-convolution\", or \"convolution on the tropical semiring\"), for which no O(k log(k)) method is currently known. Here I present a O(k log(k)) "},"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":"1501.02627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-01-12T12:57:01Z","cross_cats_sorted":["math.NA","stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"668f360557c270e645d7c132bcf595898fef38adff16efb801909001413c449e","abstract_canon_sha256":"f9421d77fc2e64de9b4a5c6938943928c38a9243a0e22cd28d21b960dbae2e1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:34.422277Z","signature_b64":"3IbAT/yz0xiIjaX4iuEFiVh9hBpCgb08dpv1fP7jJGPcN7QoGlMf0htSNM8AwdM/NhrPkHvr+hCPA67WW4QsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","last_reissued_at":"2026-05-18T01:26:34.421540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:34.421540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.CO","stat.ME","stat.ML"],"primary_cat":"cs.NA","authors_text":"Oliver Serang","submitted_at":"2015-01-12T12:57:01Z","abstract_excerpt":"Observations depending on sums of random variables are common throughout many fields; however, no efficient solution is currently known for performing max-product inference on these sums of general discrete distributions (max-product inference can be used to obtain maximum a posteriori estimates). The limiting step to max-product inference is the max-convolution problem (sometimes presented in log-transformed form and denoted as \"infimal convolution\", \"min-convolution\", or \"convolution on the tropical semiring\"), for which no O(k log(k)) method is currently known. Here I present a O(k log(k)) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02627","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":""},"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":"1501.02627","created_at":"2026-05-18T01:26:34.421666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02627v2","created_at":"2026-05-18T01:26:34.421666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02627","created_at":"2026-05-18T01:26:34.421666+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAIHJZL3LWRJ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAIHJZL3LWRJIFOP","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAIHJZL3","created_at":"2026-05-18T12:29:52.810259+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/ZAIHJZL3LWRJIFOPCOCTU4DFLY","json":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY.json","graph_json":"https://pith.science/api/pith-number/ZAIHJZL3LWRJIFOPCOCTU4DFLY/graph.json","events_json":"https://pith.science/api/pith-number/ZAIHJZL3LWRJIFOPCOCTU4DFLY/events.json","paper":"https://pith.science/paper/ZAIHJZL3"},"agent_actions":{"view_html":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY","download_json":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY.json","view_paper":"https://pith.science/paper/ZAIHJZL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02627&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAIHJZL3LWRJIFOPCOCTU4DFLY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAIHJZL3LWRJIFOPCOCTU4DFLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/action/storage_attestation","attest_author":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/action/author_attestation","sign_citation":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/action/citation_signature","submit_replication":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/action/replication_record"}},"created_at":"2026-05-18T01:26:34.421666+00:00","updated_at":"2026-05-18T01:26:34.421666+00:00"}