{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KGEU6AUAGVGII774K6XGSG2RFD","short_pith_number":"pith:KGEU6AUA","canonical_record":{"source":{"id":"1505.07519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-28T01:03:29Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"4ff724a8c1b84a243c4a84e7297bc2e3c363e7bea6a0a7353835396b28fe87d8","abstract_canon_sha256":"6ac738f8b2578348527be27afc0f46b6bab2ef71d5982522f2565472e23895ce"},"schema_version":"1.0"},"canonical_sha256":"51894f0280354c847ffc57ae691b5128e58185f2d3d077b6d1fb09f1a0034978","source":{"kind":"arxiv","id":"1505.07519","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07519","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07519v2","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07519","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"KGEU6AUAGVGI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KGEU6AUAGVGII774","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KGEU6AUA","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KGEU6AUAGVGII774K6XGSG2RFD","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-28T01:03:29Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"4ff724a8c1b84a243c4a84e7297bc2e3c363e7bea6a0a7353835396b28fe87d8","abstract_canon_sha256":"6ac738f8b2578348527be27afc0f46b6bab2ef71d5982522f2565472e23895ce"},"schema_version":"1.0"},"canonical_sha256":"51894f0280354c847ffc57ae691b5128e58185f2d3d077b6d1fb09f1a0034978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:20.029255Z","signature_b64":"28MQTbnFDqrOYRBYt0talYWuXW3JEqx34CXGffbmR5b8SYJN5OVWziFwIavXXkkhNdXpbsB3vLnRPnm4ICbrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51894f0280354c847ffc57ae691b5128e58185f2d3d077b6d1fb09f1a0034978","last_reissued_at":"2026-05-18T01:12:20.028857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:20.028857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07519","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpZevKRtVBc1EojI26EigSKuVCqAPRTuCESItlS1zudRkg9eVrt2fj5x9RJaSI5yUpBsNwjauKG8l/nv/BhLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:08:02.722228Z"},"content_sha256":"2102fbdde6446462938c83a826c7904c50d0e635b5b037fb2e57553e791610fb","schema_version":"1.0","event_id":"sha256:2102fbdde6446462938c83a826c7904c50d0e635b5b037fb2e57553e791610fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KGEU6AUAGVGII774K6XGSG2RFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bounded $p$-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"stat.CO","authors_text":"Julianus Pfeuffer, Oliver Serang","submitted_at":"2015-05-28T01:03:29Z","abstract_excerpt":"Max-convolution is an important problem closely resembling standard convolution; as such, max-convolution occurs frequently across many fields. Here we extend the method with fastest known worst-case runtime, which can be applied to nonnegative vectors by numerically approximating the Chebyshev norm $\\| \\cdot \\|_\\infty$, and use this approach to derive two numerically stable methods based on the idea of computing $p$-norms via fast convolution: The first method proposed, with runtime in $O( k \\log(k) \\log(\\log(k)) )$ (which is less than $18 k \\log(k)$ for any vectors that can be practically re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07519","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9XhDBfn+FCblhPBpoQEq9lARWEsO5aHB9Ec3RevSVjGaCH9WIadf5r4hy/QQW6tH2TrIvzRXZ2CDyHVJjcNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:08:02.723360Z"},"content_sha256":"c65d48773d548ba482b7da057b058a5d01704cf352a6a4de43ec6ab444be72ce","schema_version":"1.0","event_id":"sha256:c65d48773d548ba482b7da057b058a5d01704cf352a6a4de43ec6ab444be72ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGEU6AUAGVGII774K6XGSG2RFD/bundle.json","state_url":"https://pith.science/pith/KGEU6AUAGVGII774K6XGSG2RFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGEU6AUAGVGII774K6XGSG2RFD/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-30T19:08:02Z","links":{"resolver":"https://pith.science/pith/KGEU6AUAGVGII774K6XGSG2RFD","bundle":"https://pith.science/pith/KGEU6AUAGVGII774K6XGSG2RFD/bundle.json","state":"https://pith.science/pith/KGEU6AUAGVGII774K6XGSG2RFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGEU6AUAGVGII774K6XGSG2RFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KGEU6AUAGVGII774K6XGSG2RFD","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":"6ac738f8b2578348527be27afc0f46b6bab2ef71d5982522f2565472e23895ce","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-28T01:03:29Z","title_canon_sha256":"4ff724a8c1b84a243c4a84e7297bc2e3c363e7bea6a0a7353835396b28fe87d8"},"schema_version":"1.0","source":{"id":"1505.07519","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07519","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07519v2","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07519","created_at":"2026-05-18T01:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"KGEU6AUAGVGI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KGEU6AUAGVGII774","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KGEU6AUA","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:c65d48773d548ba482b7da057b058a5d01704cf352a6a4de43ec6ab444be72ce","target":"graph","created_at":"2026-05-18T01:12:20Z","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":"Max-convolution is an important problem closely resembling standard convolution; as such, max-convolution occurs frequently across many fields. Here we extend the method with fastest known worst-case runtime, which can be applied to nonnegative vectors by numerically approximating the Chebyshev norm $\\| \\cdot \\|_\\infty$, and use this approach to derive two numerically stable methods based on the idea of computing $p$-norms via fast convolution: The first method proposed, with runtime in $O( k \\log(k) \\log(\\log(k)) )$ (which is less than $18 k \\log(k)$ for any vectors that can be practically re","authors_text":"Julianus Pfeuffer, Oliver Serang","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-28T01:03:29Z","title":"A Bounded $p$-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07519","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:2102fbdde6446462938c83a826c7904c50d0e635b5b037fb2e57553e791610fb","target":"record","created_at":"2026-05-18T01:12:20Z","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":"6ac738f8b2578348527be27afc0f46b6bab2ef71d5982522f2565472e23895ce","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-05-28T01:03:29Z","title_canon_sha256":"4ff724a8c1b84a243c4a84e7297bc2e3c363e7bea6a0a7353835396b28fe87d8"},"schema_version":"1.0","source":{"id":"1505.07519","kind":"arxiv","version":2}},"canonical_sha256":"51894f0280354c847ffc57ae691b5128e58185f2d3d077b6d1fb09f1a0034978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51894f0280354c847ffc57ae691b5128e58185f2d3d077b6d1fb09f1a0034978","first_computed_at":"2026-05-18T01:12:20.028857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:20.028857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"28MQTbnFDqrOYRBYt0talYWuXW3JEqx34CXGffbmR5b8SYJN5OVWziFwIavXXkkhNdXpbsB3vLnRPnm4ICbrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:20.029255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07519","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2102fbdde6446462938c83a826c7904c50d0e635b5b037fb2e57553e791610fb","sha256:c65d48773d548ba482b7da057b058a5d01704cf352a6a4de43ec6ab444be72ce"],"state_sha256":"fb4ab73806a2d9b393989005175f3579e8ae31514683315bc0eb5826cd59d183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbvNBKJx+EXoFoWZzDWUBZTjQ6FbNSRUK8F+DWWIiPV3P2nAqSzS9RuSksYxZmNH+iKGaGioZTdfnqZ4avc6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:08:02.727423Z","bundle_sha256":"4128dfa8cba63694e75cea5830ff47a7feada1980c6dd7927850da04bf3fc1ac"}}