{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:4UMCPJJE2R6R7WSWL4YHWGK3CJ","short_pith_number":"pith:4UMCPJJE","schema_version":"1.0","canonical_sha256":"e51827a524d47d1fda565f307b195b1262c23a5d81275f389dbc49235c5c8393","source":{"kind":"arxiv","id":"0804.2070","version":1},"attestation_state":"computed","paper":{"title":"Strategies for Optimize Off-Lattice Aggregate Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"M. L. Martins, S. C. Ferreira Jr., S. G. Alves","submitted_at":"2008-04-13T14:47:37Z","abstract_excerpt":"We review some computer algorithms for the simulation of off-lattice clusters grown from a seed, with emphasis on the diffusion-limited aggregation, ballistic aggregation and Eden models. Only those methods which can be immediately extended to distinct off-lattice aggregation processes are discussed. The computer efficiencies of the distinct algorithms are compared."},"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":"0804.2070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2008-04-13T14:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"2ed03c08ca1ecf4f075f5d5a1b7fa2134af8662560f08ffa49bb1c63cb16386c","abstract_canon_sha256":"324da480fa02bec1026e89dae2e0952aadb87368e3f6ec1f983ff451a3ac1510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:53.697974Z","signature_b64":"NL6xfwbzJRq9VEFR9YQ6ap/17K/BTe6Ivq5sbI6p8sW+GUok3aQ8GiOtIt8KfLxajFk5YzxV1YH9B8W5odkkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e51827a524d47d1fda565f307b195b1262c23a5d81275f389dbc49235c5c8393","last_reissued_at":"2026-05-18T02:15:53.697534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:53.697534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategies for Optimize Off-Lattice Aggregate Simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"M. L. Martins, S. C. Ferreira Jr., S. G. Alves","submitted_at":"2008-04-13T14:47:37Z","abstract_excerpt":"We review some computer algorithms for the simulation of off-lattice clusters grown from a seed, with emphasis on the diffusion-limited aggregation, ballistic aggregation and Eden models. Only those methods which can be immediately extended to distinct off-lattice aggregation processes are discussed. The computer efficiencies of the distinct algorithms are compared."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.2070","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":"0804.2070","created_at":"2026-05-18T02:15:53.697599+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.2070v1","created_at":"2026-05-18T02:15:53.697599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.2070","created_at":"2026-05-18T02:15:53.697599+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UMCPJJE2R6R","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UMCPJJE2R6R7WSW","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UMCPJJE","created_at":"2026-05-18T12:25:56.245647+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/4UMCPJJE2R6R7WSWL4YHWGK3CJ","json":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ.json","graph_json":"https://pith.science/api/pith-number/4UMCPJJE2R6R7WSWL4YHWGK3CJ/graph.json","events_json":"https://pith.science/api/pith-number/4UMCPJJE2R6R7WSWL4YHWGK3CJ/events.json","paper":"https://pith.science/paper/4UMCPJJE"},"agent_actions":{"view_html":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ","download_json":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ.json","view_paper":"https://pith.science/paper/4UMCPJJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.2070&json=true","fetch_graph":"https://pith.science/api/pith-number/4UMCPJJE2R6R7WSWL4YHWGK3CJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4UMCPJJE2R6R7WSWL4YHWGK3CJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ/action/storage_attestation","attest_author":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ/action/author_attestation","sign_citation":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ/action/citation_signature","submit_replication":"https://pith.science/pith/4UMCPJJE2R6R7WSWL4YHWGK3CJ/action/replication_record"}},"created_at":"2026-05-18T02:15:53.697599+00:00","updated_at":"2026-05-18T02:15:53.697599+00:00"}