{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CJTRFBCQ7GITSMEABNUDTGP5TM","short_pith_number":"pith:CJTRFBCQ","schema_version":"1.0","canonical_sha256":"1267128450f9913930800b683999fd9b05e1f7c7cee733a1e5903b0c2b6dc239","source":{"kind":"arxiv","id":"1507.03209","version":4},"attestation_state":"computed","paper":{"title":"On the complexity of the chip-firing reachability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint Hujter, Lilla T\\'othm\\'er\\'esz, Viktor Kiss","submitted_at":"2015-07-12T09:52:21Z","abstract_excerpt":"In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial time, even if the digraph has multiple edges. We also show a special case when the reachability problem can be decided in polynomial time for general digraphs: if the target distribution is recurrent restricted to each strongly connected component. As a further positive result, we show that the chip-firing reachability problem is in co-NP for general digraphs. We also show that the chip-firing halting problem is in co"},"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":"1507.03209","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-12T09:52:21Z","cross_cats_sorted":[],"title_canon_sha256":"3cb8e03148cc8144c9e1ba1665fb26344f5c2c6af77fae350cc8c0eebdbe4fb6","abstract_canon_sha256":"3b6cd89d15f3721ddb1e63073d5b4a5e6e2682d1806d39807869ee5b01759995"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:10.053604Z","signature_b64":"1+Oh+hiSUyTlXZQg8wbhqO/Z9DeeBYTBOeJtFKDm7tCGB/beCAg56XRWGQgbrCIbeMoXiOZBUuUP14bc9fFBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1267128450f9913930800b683999fd9b05e1f7c7cee733a1e5903b0c2b6dc239","last_reissued_at":"2026-05-18T00:44:10.053126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:10.053126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of the chip-firing reachability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint Hujter, Lilla T\\'othm\\'er\\'esz, Viktor Kiss","submitted_at":"2015-07-12T09:52:21Z","abstract_excerpt":"In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial time, even if the digraph has multiple edges. We also show a special case when the reachability problem can be decided in polynomial time for general digraphs: if the target distribution is recurrent restricted to each strongly connected component. As a further positive result, we show that the chip-firing reachability problem is in co-NP for general digraphs. We also show that the chip-firing halting problem is in co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03209","kind":"arxiv","version":4},"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":"1507.03209","created_at":"2026-05-18T00:44:10.053202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03209v4","created_at":"2026-05-18T00:44:10.053202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03209","created_at":"2026-05-18T00:44:10.053202+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJTRFBCQ7GIT","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJTRFBCQ7GITSMEA","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJTRFBCQ","created_at":"2026-05-18T12:29:14.074870+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/CJTRFBCQ7GITSMEABNUDTGP5TM","json":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM.json","graph_json":"https://pith.science/api/pith-number/CJTRFBCQ7GITSMEABNUDTGP5TM/graph.json","events_json":"https://pith.science/api/pith-number/CJTRFBCQ7GITSMEABNUDTGP5TM/events.json","paper":"https://pith.science/paper/CJTRFBCQ"},"agent_actions":{"view_html":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM","download_json":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM.json","view_paper":"https://pith.science/paper/CJTRFBCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03209&json=true","fetch_graph":"https://pith.science/api/pith-number/CJTRFBCQ7GITSMEABNUDTGP5TM/graph.json","fetch_events":"https://pith.science/api/pith-number/CJTRFBCQ7GITSMEABNUDTGP5TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM/action/storage_attestation","attest_author":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM/action/author_attestation","sign_citation":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM/action/citation_signature","submit_replication":"https://pith.science/pith/CJTRFBCQ7GITSMEABNUDTGP5TM/action/replication_record"}},"created_at":"2026-05-18T00:44:10.053202+00:00","updated_at":"2026-05-18T00:44:10.053202+00:00"}