{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2RHZ3XOBBJOAPMQOFPUGJIQ5KG","short_pith_number":"pith:2RHZ3XOB","schema_version":"1.0","canonical_sha256":"d44f9dddc10a5c07b20e2be864a21d519d6b3484ce30bac031ccac45eefc2358","source":{"kind":"arxiv","id":"1708.06448","version":1},"attestation_state":"computed","paper":{"title":"The p-convolution forest: a method for solving graphical models with additive probabilistic equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Oliver Serang","submitted_at":"2017-08-21T22:48:57Z","abstract_excerpt":"Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this \"convolution forest\" approach is constructed from scratch, including an improved trimmed convolution tree algorithm and engineering details that permit fast inference in practice, and improve the ability of scientists to prototype models with additive relationships between discrete variables. The utility of this approach is demonstrated using several examples: these inclu"},"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":"1708.06448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-21T22:48:57Z","cross_cats_sorted":[],"title_canon_sha256":"183d403c8887887169b6d1bd697391aea5384b932bb58e6c0e97968cf8cb567f","abstract_canon_sha256":"2807759101d578dac2cda0e3da8154a0907d0ed741b59cae3f56baadfe9849f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.496134Z","signature_b64":"nTAUtFzjiMP+mc4iQvyRYN5vZF6A5qX3ZGWWboxUwiAqWQMTV6wpfllFJpBuIOhV1eO15+Peu9dhIiIK6EjLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d44f9dddc10a5c07b20e2be864a21d519d6b3484ce30bac031ccac45eefc2358","last_reissued_at":"2026-05-18T00:37:41.495461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.495461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The p-convolution forest: a method for solving graphical models with additive probabilistic equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Oliver Serang","submitted_at":"2017-08-21T22:48:57Z","abstract_excerpt":"Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this \"convolution forest\" approach is constructed from scratch, including an improved trimmed convolution tree algorithm and engineering details that permit fast inference in practice, and improve the ability of scientists to prototype models with additive relationships between discrete variables. The utility of this approach is demonstrated using several examples: these inclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06448","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":"1708.06448","created_at":"2026-05-18T00:37:41.495556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06448v1","created_at":"2026-05-18T00:37:41.495556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06448","created_at":"2026-05-18T00:37:41.495556+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RHZ3XOBBJOA","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RHZ3XOBBJOAPMQO","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RHZ3XOB","created_at":"2026-05-18T12:30:55.937587+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/2RHZ3XOBBJOAPMQOFPUGJIQ5KG","json":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG.json","graph_json":"https://pith.science/api/pith-number/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/graph.json","events_json":"https://pith.science/api/pith-number/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/events.json","paper":"https://pith.science/paper/2RHZ3XOB"},"agent_actions":{"view_html":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG","download_json":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG.json","view_paper":"https://pith.science/paper/2RHZ3XOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06448&json=true","fetch_graph":"https://pith.science/api/pith-number/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/graph.json","fetch_events":"https://pith.science/api/pith-number/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/action/storage_attestation","attest_author":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/action/author_attestation","sign_citation":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/action/citation_signature","submit_replication":"https://pith.science/pith/2RHZ3XOBBJOAPMQOFPUGJIQ5KG/action/replication_record"}},"created_at":"2026-05-18T00:37:41.495556+00:00","updated_at":"2026-05-18T00:37:41.495556+00:00"}