{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:U52VAC4CNZNEUYD7U5UD4O4MAF","short_pith_number":"pith:U52VAC4C","schema_version":"1.0","canonical_sha256":"a775500b826e5a4a607fa7683e3b8c0144147fa1724b2e645dde3cf4e427634f","source":{"kind":"arxiv","id":"comp-gas/9609001","version":2},"attestation_state":"computed","paper":{"title":"Parallel Algorithm and Dynamic Exponent for Diffusion-limited Aggregation","license":"","headline":"","cross_cats":["cond-mat.stat-mech","nlin.CG"],"primary_cat":"comp-gas","authors_text":"J. Machta (U. Massachusetts), K. Moriarty, R. Greenlaw (U. New Hampshire)","submitted_at":"1996-09-09T18:46:51Z","abstract_excerpt":"A parallel algorithm for ``diffusion-limited aggregation'' (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to $T \\sim L^{z}$, where L is the cluster size, T is the running time, and the algorithm uses a number of processors polynomial in L\\@. It is argued that z=D-D_2/2, where D is the fractal dimension and D_2 is the second generalized dimension. Simulations of DLA are carried out to measure D_2 and"},"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":"comp-gas/9609001","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"comp-gas","submitted_at":"1996-09-09T18:46:51Z","cross_cats_sorted":["cond-mat.stat-mech","nlin.CG"],"title_canon_sha256":"7a56cbcc8ff6eaeeb3e67490fdb1279a9b25c0154316518efb138b28767969fb","abstract_canon_sha256":"1ffb88f901d4b9dc7673f487cd066d861397b9d7bed0e0de06443d02933f86bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:23.700928Z","signature_b64":"hKXHzkdYsSqqDh0e4l01t4x1Pzwv49fEZXRxnszFs1LItK2LL7Yi2uxkc6XokeXAhMwSFQ6VVW/QQrZFnv1yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a775500b826e5a4a607fa7683e3b8c0144147fa1724b2e645dde3cf4e427634f","last_reissued_at":"2026-05-18T01:07:23.700477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:23.700477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Algorithm and Dynamic Exponent for Diffusion-limited Aggregation","license":"","headline":"","cross_cats":["cond-mat.stat-mech","nlin.CG"],"primary_cat":"comp-gas","authors_text":"J. Machta (U. Massachusetts), K. Moriarty, R. Greenlaw (U. New Hampshire)","submitted_at":"1996-09-09T18:46:51Z","abstract_excerpt":"A parallel algorithm for ``diffusion-limited aggregation'' (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to $T \\sim L^{z}$, where L is the cluster size, T is the running time, and the algorithm uses a number of processors polynomial in L\\@. It is argued that z=D-D_2/2, where D is the fractal dimension and D_2 is the second generalized dimension. Simulations of DLA are carried out to measure D_2 and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"comp-gas/9609001","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"comp-gas/9609001","created_at":"2026-05-18T01:07:23.700560+00:00"},{"alias_kind":"arxiv_version","alias_value":"comp-gas/9609001v2","created_at":"2026-05-18T01:07:23.700560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.comp-gas/9609001","created_at":"2026-05-18T01:07:23.700560+00:00"},{"alias_kind":"pith_short_12","alias_value":"U52VAC4CNZNE","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"U52VAC4CNZNEUYD7","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"U52VAC4C","created_at":"2026-05-18T12:25:48.327863+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/U52VAC4CNZNEUYD7U5UD4O4MAF","json":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF.json","graph_json":"https://pith.science/api/pith-number/U52VAC4CNZNEUYD7U5UD4O4MAF/graph.json","events_json":"https://pith.science/api/pith-number/U52VAC4CNZNEUYD7U5UD4O4MAF/events.json","paper":"https://pith.science/paper/U52VAC4C"},"agent_actions":{"view_html":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF","download_json":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF.json","view_paper":"https://pith.science/paper/U52VAC4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=comp-gas/9609001&json=true","fetch_graph":"https://pith.science/api/pith-number/U52VAC4CNZNEUYD7U5UD4O4MAF/graph.json","fetch_events":"https://pith.science/api/pith-number/U52VAC4CNZNEUYD7U5UD4O4MAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF/action/storage_attestation","attest_author":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF/action/author_attestation","sign_citation":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF/action/citation_signature","submit_replication":"https://pith.science/pith/U52VAC4CNZNEUYD7U5UD4O4MAF/action/replication_record"}},"created_at":"2026-05-18T01:07:23.700560+00:00","updated_at":"2026-05-18T01:07:23.700560+00:00"}