{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EGHJ3C2X3YTKCJNWYRM56A2ICF","short_pith_number":"pith:EGHJ3C2X","schema_version":"1.0","canonical_sha256":"218e9d8b57de26a125b6c459df03481179a7025baa0a5cd6c3b0162729976992","source":{"kind":"arxiv","id":"1411.1652","version":2},"attestation_state":"computed","paper":{"title":"Chip-firing may be much faster than you think","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT"],"primary_cat":"math.CO","authors_text":"Felix Goldberg","submitted_at":"2014-11-06T16:18:01Z","abstract_excerpt":"A new bound (Theorem \\ref{thm:main}) for the duration of the chip-firing game with $N$ chips on a $n$-vertex graph is obtained, by a careful analysis of the pseudo-inverse of the discrete Laplacian matrix of the graph. This new bound is expressed in terms of the entries of the pseudo-inverse.\n  It is shown (Section 5) to be always better than the classic bound due to Bj{\\\"o}rner, Lov\\'{a}sz and Shor. In some cases the improvement is dramatic.\n  For instance: for strongly regular graphs the classic and the new bounds reduce to $O(nN)$ and $O(n+N)$, respectively. For dense regular graphs - $d=(\\"},"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":"1411.1652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T16:18:01Z","cross_cats_sorted":["cs.DM","cs.GT"],"title_canon_sha256":"aaafaa0f904505bb302ffb78cc97015e6785f90b927adf786ac3374848cae985","abstract_canon_sha256":"2aec5e43bb7f660ffe2647dbc9d24e09c163aa22322d2db241bbf604464cca61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.828403Z","signature_b64":"ChXRPaUw7i4fLglusMwZIicZ1X5W1wSsj9j88+1otEjNjqMswPbW+vGMeJUJNLd4+ZzyAa6dfM8LB28NZg08Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218e9d8b57de26a125b6c459df03481179a7025baa0a5cd6c3b0162729976992","last_reissued_at":"2026-05-18T02:33:00.828060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.828060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chip-firing may be much faster than you think","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT"],"primary_cat":"math.CO","authors_text":"Felix Goldberg","submitted_at":"2014-11-06T16:18:01Z","abstract_excerpt":"A new bound (Theorem \\ref{thm:main}) for the duration of the chip-firing game with $N$ chips on a $n$-vertex graph is obtained, by a careful analysis of the pseudo-inverse of the discrete Laplacian matrix of the graph. This new bound is expressed in terms of the entries of the pseudo-inverse.\n  It is shown (Section 5) to be always better than the classic bound due to Bj{\\\"o}rner, Lov\\'{a}sz and Shor. In some cases the improvement is dramatic.\n  For instance: for strongly regular graphs the classic and the new bounds reduce to $O(nN)$ and $O(n+N)$, respectively. For dense regular graphs - $d=(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1652","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":"1411.1652","created_at":"2026-05-18T02:33:00.828108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1652v2","created_at":"2026-05-18T02:33:00.828108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1652","created_at":"2026-05-18T02:33:00.828108+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGHJ3C2X3YTK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGHJ3C2X3YTKCJNW","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGHJ3C2X","created_at":"2026-05-18T12:28:25.294606+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/EGHJ3C2X3YTKCJNWYRM56A2ICF","json":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF.json","graph_json":"https://pith.science/api/pith-number/EGHJ3C2X3YTKCJNWYRM56A2ICF/graph.json","events_json":"https://pith.science/api/pith-number/EGHJ3C2X3YTKCJNWYRM56A2ICF/events.json","paper":"https://pith.science/paper/EGHJ3C2X"},"agent_actions":{"view_html":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF","download_json":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF.json","view_paper":"https://pith.science/paper/EGHJ3C2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1652&json=true","fetch_graph":"https://pith.science/api/pith-number/EGHJ3C2X3YTKCJNWYRM56A2ICF/graph.json","fetch_events":"https://pith.science/api/pith-number/EGHJ3C2X3YTKCJNWYRM56A2ICF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF/action/storage_attestation","attest_author":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF/action/author_attestation","sign_citation":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF/action/citation_signature","submit_replication":"https://pith.science/pith/EGHJ3C2X3YTKCJNWYRM56A2ICF/action/replication_record"}},"created_at":"2026-05-18T02:33:00.828108+00:00","updated_at":"2026-05-18T02:33:00.828108+00:00"}