{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:3ON6M6NHA3OBP7KVGHIBXLZUE6","short_pith_number":"pith:3ON6M6NH","schema_version":"1.0","canonical_sha256":"db9be679a706dc17fd5531d01baf342799e8aed56bdf4a4efbc55fa4d0bca352","source":{"kind":"arxiv","id":"physics/0606226","version":1},"attestation_state":"computed","paper":{"title":"A Complexity O(1) Priority Queue for Event Driven Molecular Dynamics Simulations","license":"","headline":"","cross_cats":["cond-mat.other","physics.gen-ph"],"primary_cat":"physics.comp-ph","authors_text":"Gerald Paul","submitted_at":"2006-06-26T16:05:55Z","abstract_excerpt":"We propose and implement a priority queue suitable for use in event driven molecular dynamics simulations. All operations on the queue take on average O(1) time per collision. In comparison, previously studied queues for event driven molecular dynamics simulations require O(log $N$) time per collision for systems of $N$ particles."},"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":"physics/0606226","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"physics.comp-ph","submitted_at":"2006-06-26T16:05:55Z","cross_cats_sorted":["cond-mat.other","physics.gen-ph"],"title_canon_sha256":"b11356929fe81b4ec296c10eafd72ba593c6423418412adcdeacc39be2a51cec","abstract_canon_sha256":"fe867f48182469be7b21ec97d28e07873e42f9cc74f02046f476fe1242db11b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:06.885944Z","signature_b64":"P2snNp/5m2/EydUtYmIhtC/REZ9FYS7MfcK7fGjB9w+Ve8ixioJDaG+6ocrbv0K5btwooZV27CAZUZAhBjXTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db9be679a706dc17fd5531d01baf342799e8aed56bdf4a4efbc55fa4d0bca352","last_reissued_at":"2026-05-18T01:38:06.885471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:06.885471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complexity O(1) Priority Queue for Event Driven Molecular Dynamics Simulations","license":"","headline":"","cross_cats":["cond-mat.other","physics.gen-ph"],"primary_cat":"physics.comp-ph","authors_text":"Gerald Paul","submitted_at":"2006-06-26T16:05:55Z","abstract_excerpt":"We propose and implement a priority queue suitable for use in event driven molecular dynamics simulations. All operations on the queue take on average O(1) time per collision. In comparison, previously studied queues for event driven molecular dynamics simulations require O(log $N$) time per collision for systems of $N$ particles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"physics/0606226","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":"physics/0606226","created_at":"2026-05-18T01:38:06.885545+00:00"},{"alias_kind":"arxiv_version","alias_value":"physics/0606226v1","created_at":"2026-05-18T01:38:06.885545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0606226","created_at":"2026-05-18T01:38:06.885545+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ON6M6NHA3OB","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ON6M6NHA3OBP7KV","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ON6M6NH","created_at":"2026-05-18T12:25:53.939244+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/3ON6M6NHA3OBP7KVGHIBXLZUE6","json":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6.json","graph_json":"https://pith.science/api/pith-number/3ON6M6NHA3OBP7KVGHIBXLZUE6/graph.json","events_json":"https://pith.science/api/pith-number/3ON6M6NHA3OBP7KVGHIBXLZUE6/events.json","paper":"https://pith.science/paper/3ON6M6NH"},"agent_actions":{"view_html":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6","download_json":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6.json","view_paper":"https://pith.science/paper/3ON6M6NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=physics/0606226&json=true","fetch_graph":"https://pith.science/api/pith-number/3ON6M6NHA3OBP7KVGHIBXLZUE6/graph.json","fetch_events":"https://pith.science/api/pith-number/3ON6M6NHA3OBP7KVGHIBXLZUE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6/action/storage_attestation","attest_author":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6/action/author_attestation","sign_citation":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6/action/citation_signature","submit_replication":"https://pith.science/pith/3ON6M6NHA3OBP7KVGHIBXLZUE6/action/replication_record"}},"created_at":"2026-05-18T01:38:06.885545+00:00","updated_at":"2026-05-18T01:38:06.885545+00:00"}