{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZAIHJZL3LWRJIFOPCOCTU4DFLY","short_pith_number":"pith:ZAIHJZL3","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"},"canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","source":{"kind":"arxiv","id":"1501.02627","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02627","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02627v2","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02627","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZAIHJZL3LWRJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAIHJZL3LWRJIFOP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAIHJZL3","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZAIHJZL3LWRJIFOPCOCTU4DFLY","target":"record","payload":{"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"},"canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","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"},"source_kind":"arxiv","source_id":"1501.02627","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-05-18T01:26:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8ahzIJ8SaVUabrM32OezP71dY26oASVjRWhLPhJMZI8cpgSCMKuBTQAaxVDCXkINsHyZR8XavSue/RY5JWeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:25:13.266556Z"},"content_sha256":"81ed8bdadabb7358d8926d39a2bf3f1d3479a408599ac381d534ff078e863a77","schema_version":"1.0","event_id":"sha256:81ed8bdadabb7358d8926d39a2bf3f1d3479a408599ac381d534ff078e863a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZAIHJZL3LWRJIFOPCOCTU4DFLY","target":"graph","payload":{"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"},"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-18T01:26:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTwlpM0jEs1BwX3Ebp0X2GvvsooZfUbqWlOKpliotW//m9vGml64SUuI5ASjrSY9cCbBd1GQSXhBJ5jyFaWSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:25:13.267242Z"},"content_sha256":"d5358e85342b123020953ef8ea60c3b67a8bbfd0ead55d746ab1ffc579c6a82e","schema_version":"1.0","event_id":"sha256:d5358e85342b123020953ef8ea60c3b67a8bbfd0ead55d746ab1ffc579c6a82e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/bundle.json","state_url":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/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-30T20:25:13Z","links":{"resolver":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY","bundle":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/bundle.json","state":"https://pith.science/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAIHJZL3LWRJIFOPCOCTU4DFLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZAIHJZL3LWRJIFOPCOCTU4DFLY","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":"f9421d77fc2e64de9b4a5c6938943928c38a9243a0e22cd28d21b960dbae2e1f","cross_cats_sorted":["math.NA","stat.CO","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-01-12T12:57:01Z","title_canon_sha256":"668f360557c270e645d7c132bcf595898fef38adff16efb801909001413c449e"},"schema_version":"1.0","source":{"id":"1501.02627","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02627","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02627v2","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02627","created_at":"2026-05-18T01:26:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZAIHJZL3LWRJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAIHJZL3LWRJIFOP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAIHJZL3","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d5358e85342b123020953ef8ea60c3b67a8bbfd0ead55d746ab1ffc579c6a82e","target":"graph","created_at":"2026-05-18T01:26:34Z","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":"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)) ","authors_text":"Oliver Serang","cross_cats":["math.NA","stat.CO","stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-01-12T12:57:01Z","title":"A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02627","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:81ed8bdadabb7358d8926d39a2bf3f1d3479a408599ac381d534ff078e863a77","target":"record","created_at":"2026-05-18T01:26:34Z","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":"f9421d77fc2e64de9b4a5c6938943928c38a9243a0e22cd28d21b960dbae2e1f","cross_cats_sorted":["math.NA","stat.CO","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-01-12T12:57:01Z","title_canon_sha256":"668f360557c270e645d7c132bcf595898fef38adff16efb801909001413c449e"},"schema_version":"1.0","source":{"id":"1501.02627","kind":"arxiv","version":2}},"canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c81074e57b5da29415cf13853a70655e0c575f83cb2987ecfa8685dec33bd73c","first_computed_at":"2026-05-18T01:26:34.421540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:34.421540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3IbAT/yz0xiIjaX4iuEFiVh9hBpCgb08dpv1fP7jJGPcN7QoGlMf0htSNM8AwdM/NhrPkHvr+hCPA67WW4QsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:34.422277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02627","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81ed8bdadabb7358d8926d39a2bf3f1d3479a408599ac381d534ff078e863a77","sha256:d5358e85342b123020953ef8ea60c3b67a8bbfd0ead55d746ab1ffc579c6a82e"],"state_sha256":"00952127ac7a667993eb7843183c270116d3ec00332382abab89397b0e4356c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yPR4BfOq6urtUdXDugIHOeHVOU07uvxWDAzpjpHXO9uNJF2IwKRkDvX0WThTZErw1+4UXVeJ80GclaWi37LBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:25:13.271093Z","bundle_sha256":"6942cc94656f29380ad022b8a4a522d07ef2ab4c495353d32e591263b6f033df"}}