{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:G2TN2QJAZESJLDCB2ADJDFVMOC","short_pith_number":"pith:G2TN2QJA","schema_version":"1.0","canonical_sha256":"36a6dd4120c924958c41d0069196ac70a268f4d42094e7bca8196ec7c9e87e07","source":{"kind":"arxiv","id":"cond-mat/9808183","version":2},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Sandpiles","license":"","headline":"","cross_cats":["adap-org","nlin.AO","nlin.PS","patt-sol"],"primary_cat":"cond-mat","authors_text":"Cristopher Moore, Martin Nilsson","submitted_at":"1998-08-17T22:40:22Z","abstract_excerpt":"Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is almost certainly necessary. We also show that the problem of determining whether a sandpile state is recurrent is P-complete in d >= 3.\n  In d=1, we give two algorithms for predicting the sandpile on a lattice of size n, both faster than explicit simulation: a serial one that runs in time O(n log n), and a parallel one that runs in time O(log^3 n), i.e. in "},"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":"cond-mat/9808183","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat","submitted_at":"1998-08-17T22:40:22Z","cross_cats_sorted":["adap-org","nlin.AO","nlin.PS","patt-sol"],"title_canon_sha256":"10cdfeb837c048dd63c3e6664e4cf7f27b7d7307f7ad6ff47a78836ebc926697","abstract_canon_sha256":"74b123efd4d011bbb8c194e4289fe60cecea5d49bd5e1ef601c1fc69d6afd080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:30.166964Z","signature_b64":"+F1PIDhvKHCh6SV7h3PvRwAmdS45BMlmD8/1J0iNMcj8riN1gX5dCLZsTUNlItLvw0K1K9LWrqCcM4L5buh0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a6dd4120c924958c41d0069196ac70a268f4d42094e7bca8196ec7c9e87e07","last_reissued_at":"2026-05-18T01:39:30.165902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:30.165902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Sandpiles","license":"","headline":"","cross_cats":["adap-org","nlin.AO","nlin.PS","patt-sol"],"primary_cat":"cond-mat","authors_text":"Cristopher Moore, Martin Nilsson","submitted_at":"1998-08-17T22:40:22Z","abstract_excerpt":"Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is almost certainly necessary. We also show that the problem of determining whether a sandpile state is recurrent is P-complete in d >= 3.\n  In d=1, we give two algorithms for predicting the sandpile on a lattice of size n, both faster than explicit simulation: a serial one that runs in time O(n log n), and a parallel one that runs in time O(log^3 n), i.e. in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9808183","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":"cond-mat/9808183","created_at":"2026-05-18T01:39:30.166048+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9808183v2","created_at":"2026-05-18T01:39:30.166048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9808183","created_at":"2026-05-18T01:39:30.166048+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2TN2QJAZESJ","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2TN2QJAZESJLDCB","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2TN2QJA","created_at":"2026-05-18T12:25:49.038998+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/G2TN2QJAZESJLDCB2ADJDFVMOC","json":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC.json","graph_json":"https://pith.science/api/pith-number/G2TN2QJAZESJLDCB2ADJDFVMOC/graph.json","events_json":"https://pith.science/api/pith-number/G2TN2QJAZESJLDCB2ADJDFVMOC/events.json","paper":"https://pith.science/paper/G2TN2QJA"},"agent_actions":{"view_html":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC","download_json":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC.json","view_paper":"https://pith.science/paper/G2TN2QJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9808183&json=true","fetch_graph":"https://pith.science/api/pith-number/G2TN2QJAZESJLDCB2ADJDFVMOC/graph.json","fetch_events":"https://pith.science/api/pith-number/G2TN2QJAZESJLDCB2ADJDFVMOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC/action/storage_attestation","attest_author":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC/action/author_attestation","sign_citation":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC/action/citation_signature","submit_replication":"https://pith.science/pith/G2TN2QJAZESJLDCB2ADJDFVMOC/action/replication_record"}},"created_at":"2026-05-18T01:39:30.166048+00:00","updated_at":"2026-05-18T01:39:30.166048+00:00"}