{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NQWMDLRVVS3BOFFYPHCUXVQVDL","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":"37ea6ee6751d56cb3165c25c3354def51473263378e66d4279b8d8a4f45dfaa8","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2026-05-18T13:09:33Z","title_canon_sha256":"fb26dd081671f9d5c02b0d4d96e28ce27a88670714aa6224978540bb35f47445"},"schema_version":"1.0","source":{"id":"2605.18353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18353","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18353v1","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18353","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"NQWMDLRVVS3B","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"NQWMDLRVVS3BOFFY","created_at":"2026-05-20T00:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"NQWMDLRV","created_at":"2026-05-20T00:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:843b81fa25c918fe62f5990df9a8d67d0ad4480d0328223e2251d5894183a191","target":"graph","created_at":"2026-05-20T00:05:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The algorithm reduces the computational complexity from O(N^{2d}) to O(d N^d log N), considering N bins per d components, and calculates coagulation consistently with the conventional direct method."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"We assumed that two pairs of colliding aggregates reproduce a similar outcome if the dust properties are similar, and that the ratio of dust properties in logarithmic space gives the similarity as a distance. (Abstract, paragraph describing the assumptions that enable the tree algorithm.)"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A tree algorithm groups similar dust aggregates to cut multi-component coagulation costs from quadratic to near-linear scaling while matching direct-method results."}],"snapshot_sha256":"d54a29f3c3aef4b91d92dd12fd074070044c540346e7ab36454912d54c993084"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"98deb06698cf91db6542aee854655745e5afa703d6d3a0db9db3ae528b7ff022"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.397946Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:52:30.580215Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:31.335986Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:31:54.738990Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.805841Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18353/integrity.json","findings":[],"snapshot_sha256":"985af51020fb77307242b07527c0056508d5a2c2b5e783aef2225369ff09ce49","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dust properties, such as mass and porosity, impact planet formation directly. Understanding the time evolution of dust distribution across multiple properties requires numerical computation. However, available ways to calculate the multi-component coagulation-fragmentation are highly time-consuming. This study aims to develop a fast and accurate algorithm for multi-component coagulation. We assumed that two pairs of colliding aggregates reproduce a similar outcome if the dust properties are similar, and that the ratio of dust properties in logarithmic space gives the similarity as a \"distance\"","authors_text":"Akimasa Kataoka, Taichi K. Watanabe","cross_cats":["astro-ph.IM"],"headline":"A tree algorithm groups similar dust aggregates to cut multi-component coagulation costs from quadratic to near-linear scaling while matching direct-method results.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2026-05-18T13:09:33Z","title":"A fast tree algorithm for multi-component coagulation equation"},"references":{"count":189,"internal_anchors":2,"resolved_work":189,"sample":[{"cited_arxiv_id":"","doi":"10.1088/2041-8205/808/1/l3","is_internal_anchor":false,"ref_index":1,"title":"2015 , pages =","work_id":"8a67fa67-8c9b-4f5e-8f8d-41cc9c85d732","year":2014},{"cited_arxiv_id":"","doi":"10.1002/2016je005088","is_internal_anchor":false,"ref_index":2,"title":"Journal of Geophysical Research: Planets , author =","work_id":"f08b4c21-cc3a-484c-afd1-66981282e594","year":null},{"cited_arxiv_id":"","doi":"10.3847/1538-4357/ac7d58","is_internal_anchor":false,"ref_index":3,"title":"doi:10.3847/1538-4357/ac7d58 , url =","work_id":"792c477d-dd88-45fe-af0f-48ae527f903f","year":2022},{"cited_arxiv_id":"","doi":"10.1088/0004-637x/752/2/106","is_internal_anchor":false,"ref_index":4,"title":"doi:10.1088/0004-637X/752/2/106","work_id":"c3456892-26d1-47cf-909d-b5fc66ac9e61","year":2012},{"cited_arxiv_id":"","doi":"10.1051/0004-6361/201322151","is_internal_anchor":false,"ref_index":5,"title":"A&A , volume =","work_id":"62922506-44f5-45fc-b735-fcfafec4ead4","year":null}],"snapshot_sha256":"ef4f1716b0b6a297bfdec45f05aa321f9e4513edcc412e0958d37ec8ebd3ba0e"},"source":{"id":"2605.18353","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:41:50.814293Z","id":"440adeb8-62fb-4c0d-ac21-6538ea2b5120","model_set":{"reader":"grok-4.3"},"one_line_summary":"A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A tree algorithm groups similar dust aggregates to cut multi-component coagulation costs from quadratic to near-linear scaling while matching direct-method results.","strongest_claim":"The algorithm reduces the computational complexity from O(N^{2d}) to O(d N^d log N), considering N bins per d components, and calculates coagulation consistently with the conventional direct method.","weakest_assumption":"We assumed that two pairs of colliding aggregates reproduce a similar outcome if the dust properties are similar, and that the ratio of dust properties in logarithmic space gives the similarity as a distance. (Abstract, paragraph describing the assumptions that enable the tree algorithm.)"}},"verdict_id":"440adeb8-62fb-4c0d-ac21-6538ea2b5120"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:058764d874c4b6eab49a6e34f241ae7d8688253729ae11800ca57470798a5090","target":"record","created_at":"2026-05-20T00:05:56Z","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":"37ea6ee6751d56cb3165c25c3354def51473263378e66d4279b8d8a4f45dfaa8","cross_cats_sorted":["astro-ph.IM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2026-05-18T13:09:33Z","title_canon_sha256":"fb26dd081671f9d5c02b0d4d96e28ce27a88670714aa6224978540bb35f47445"},"schema_version":"1.0","source":{"id":"2605.18353","kind":"arxiv","version":1}},"canonical_sha256":"6c2cc1ae35acb61714b879c54bd6151ac48f8a6a60cbbcdcfdcd2e9a51438fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c2cc1ae35acb61714b879c54bd6151ac48f8a6a60cbbcdcfdcd2e9a51438fd9","first_computed_at":"2026-05-20T00:05:56.683556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:56.683556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y5tMWvJ4TjhkPM7nmHpwB0wZRXHSYtYFvuzCRNpqKcs03i5Ep/lkO+sGGQM9ZUiGkf44p1tdvduekMSii50qDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:56.684376Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:058764d874c4b6eab49a6e34f241ae7d8688253729ae11800ca57470798a5090","sha256:843b81fa25c918fe62f5990df9a8d67d0ad4480d0328223e2251d5894183a191"],"state_sha256":"00efb96e16f7e1d8f9a9805cdf1428d2245067cd7e59062efb5076e982b088ca"}