{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CJTRFBCQ7GITSMEABNUDTGP5TM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b6cd89d15f3721ddb1e63073d5b4a5e6e2682d1806d39807869ee5b01759995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-12T09:52:21Z","title_canon_sha256":"3cb8e03148cc8144c9e1ba1665fb26344f5c2c6af77fae350cc8c0eebdbe4fb6"},"schema_version":"1.0","source":{"id":"1507.03209","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03209","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03209v4","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03209","created_at":"2026-05-18T00:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"CJTRFBCQ7GIT","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJTRFBCQ7GITSMEA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJTRFBCQ","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:c45f222b2d1b7666edd3bd107bc80dc4682dd134613407cd3908e7da006a10a2","target":"graph","created_at":"2026-05-18T00:44:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"B\\'alint Hujter, Lilla T\\'othm\\'er\\'esz, Viktor Kiss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-12T09:52:21Z","title":"On the complexity of the chip-firing reachability problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03209","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3de3d49d42920d4843df8d6d8b7ed12ec90b1d06efa753debd3045a29c7c195a","target":"record","created_at":"2026-05-18T00:44:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b6cd89d15f3721ddb1e63073d5b4a5e6e2682d1806d39807869ee5b01759995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-12T09:52:21Z","title_canon_sha256":"3cb8e03148cc8144c9e1ba1665fb26344f5c2c6af77fae350cc8c0eebdbe4fb6"},"schema_version":"1.0","source":{"id":"1507.03209","kind":"arxiv","version":4}},"canonical_sha256":"1267128450f9913930800b683999fd9b05e1f7c7cee733a1e5903b0c2b6dc239","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1267128450f9913930800b683999fd9b05e1f7c7cee733a1e5903b0c2b6dc239","first_computed_at":"2026-05-18T00:44:10.053126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:10.053126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1+Oh+hiSUyTlXZQg8wbhqO/Z9DeeBYTBOeJtFKDm7tCGB/beCAg56XRWGQgbrCIbeMoXiOZBUuUP14bc9fFBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:10.053604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03209","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3de3d49d42920d4843df8d6d8b7ed12ec90b1d06efa753debd3045a29c7c195a","sha256:c45f222b2d1b7666edd3bd107bc80dc4682dd134613407cd3908e7da006a10a2"],"state_sha256":"6feae202bfddd28520f501aef540f52222d7cab8c1de8396b9a1aae44fda48e9"}