{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GJ6XH2JNFTB5SJBZM54FO3OZYZ","short_pith_number":"pith:GJ6XH2JN","schema_version":"1.0","canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","source":{"kind":"arxiv","id":"1407.6958","version":3},"attestation_state":"computed","paper":{"title":"Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Lilla T\\'othm\\'er\\'esz, Viktor Kiss","submitted_at":"2014-07-25T16:19:38Z","abstract_excerpt":"Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.\n  The determination of the rank of a divisor can be translated to a question about a chip-firing game on the same underlying graph. We prove the NP-hardness of this question by relating chip-firing on directed and undirected graphs."},"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":"1407.6958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-25T16:19:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1b312ad35484be105bbda363bbb840f937999a347a481bf033a7c1d3a17f9f04","abstract_canon_sha256":"58f0253dba0b38ae46cb97f31f765fa85a2f7ee525fcbe52292a45bc11fdde62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.248208Z","signature_b64":"jfMlMk36oyB+VckYN462TmC91iwIKLj1KJnTLX3B4429LkVS6Kh0rGTtVnbrycfvJroVgoNVCmdjYPvytC1KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","last_reissued_at":"2026-05-18T01:24:04.247464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.247464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Lilla T\\'othm\\'er\\'esz, Viktor Kiss","submitted_at":"2014-07-25T16:19:38Z","abstract_excerpt":"Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.\n  The determination of the rank of a divisor can be translated to a question about a chip-firing game on the same underlying graph. We prove the NP-hardness of this question by relating chip-firing on directed and undirected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6958","kind":"arxiv","version":3},"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":"1407.6958","created_at":"2026-05-18T01:24:04.247589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6958v3","created_at":"2026-05-18T01:24:04.247589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6958","created_at":"2026-05-18T01:24:04.247589+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJ6XH2JNFTB5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJ6XH2JNFTB5SJBZ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJ6XH2JN","created_at":"2026-05-18T12:28:30.664211+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/GJ6XH2JNFTB5SJBZM54FO3OZYZ","json":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ.json","graph_json":"https://pith.science/api/pith-number/GJ6XH2JNFTB5SJBZM54FO3OZYZ/graph.json","events_json":"https://pith.science/api/pith-number/GJ6XH2JNFTB5SJBZM54FO3OZYZ/events.json","paper":"https://pith.science/paper/GJ6XH2JN"},"agent_actions":{"view_html":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ","download_json":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ.json","view_paper":"https://pith.science/paper/GJ6XH2JN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6958&json=true","fetch_graph":"https://pith.science/api/pith-number/GJ6XH2JNFTB5SJBZM54FO3OZYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GJ6XH2JNFTB5SJBZM54FO3OZYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/action/storage_attestation","attest_author":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/action/author_attestation","sign_citation":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/action/citation_signature","submit_replication":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/action/replication_record"}},"created_at":"2026-05-18T01:24:04.247589+00:00","updated_at":"2026-05-18T01:24:04.247589+00:00"}