{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SYN7EMBA265LMMHUYZDPO7TYL5","short_pith_number":"pith:SYN7EMBA","schema_version":"1.0","canonical_sha256":"961bf23020d7bab630f4c646f77e785f6381335844707c8a7ea0fae5fbceee3b","source":{"kind":"arxiv","id":"1709.07849","version":1},"attestation_state":"computed","paper":{"title":"Pemantle's min-plus binary tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antonio Auffinger, Dylan Cable","submitted_at":"2017-09-22T17:05:22Z","abstract_excerpt":"We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives. Particles start at the bottom of a binary tree of depth N and move towards the root. Assuming that merging or annihilation happens independently at random, we determine the limit law of the final mass of the system in the large N limit."},"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":"1709.07849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-22T17:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"da111050a2f369ab06a7f2fe7ab8b0dd7cab8019969d051fab8435decf3261fe","abstract_canon_sha256":"f135cfa6b8353519e47777481dc314152b85a5c597069aab9a7ee488935292ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.244744Z","signature_b64":"OLouvLuBme2ZinwikHDo7O24O5c64uT7kJXW+5mK+xHN0dp0NF9F4dSDvuMx1357ioDBfR8tPp8mbOFPY38qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961bf23020d7bab630f4c646f77e785f6381335844707c8a7ea0fae5fbceee3b","last_reissued_at":"2026-05-18T00:34:32.244358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.244358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pemantle's min-plus binary tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antonio Auffinger, Dylan Cable","submitted_at":"2017-09-22T17:05:22Z","abstract_excerpt":"We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives. Particles start at the bottom of a binary tree of depth N and move towards the root. Assuming that merging or annihilation happens independently at random, we determine the limit law of the final mass of the system in the large N limit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07849","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":"1709.07849","created_at":"2026-05-18T00:34:32.244420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07849v1","created_at":"2026-05-18T00:34:32.244420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07849","created_at":"2026-05-18T00:34:32.244420+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYN7EMBA265L","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYN7EMBA265LMMHU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYN7EMBA","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.16880","citing_title":"Hipster random walks, random series-parallel graph and random homogeneous systems","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5","json":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5.json","graph_json":"https://pith.science/api/pith-number/SYN7EMBA265LMMHUYZDPO7TYL5/graph.json","events_json":"https://pith.science/api/pith-number/SYN7EMBA265LMMHUYZDPO7TYL5/events.json","paper":"https://pith.science/paper/SYN7EMBA"},"agent_actions":{"view_html":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5","download_json":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5.json","view_paper":"https://pith.science/paper/SYN7EMBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07849&json=true","fetch_graph":"https://pith.science/api/pith-number/SYN7EMBA265LMMHUYZDPO7TYL5/graph.json","fetch_events":"https://pith.science/api/pith-number/SYN7EMBA265LMMHUYZDPO7TYL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5/action/storage_attestation","attest_author":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5/action/author_attestation","sign_citation":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5/action/citation_signature","submit_replication":"https://pith.science/pith/SYN7EMBA265LMMHUYZDPO7TYL5/action/replication_record"}},"created_at":"2026-05-18T00:34:32.244420+00:00","updated_at":"2026-05-18T00:34:32.244420+00:00"}