{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GJ6XH2JNFTB5SJBZM54FO3OZYZ","short_pith_number":"pith:GJ6XH2JN","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"},"canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","source":{"kind":"arxiv","id":"1407.6958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6958","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6958v3","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6958","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"GJ6XH2JNFTB5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GJ6XH2JNFTB5SJBZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GJ6XH2JN","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GJ6XH2JNFTB5SJBZM54FO3OZYZ","target":"record","payload":{"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"},"canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","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"},"source_kind":"arxiv","source_id":"1407.6958","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqRdV1mxRY3kSJr0eTE4Lwpt6L09k5XPo0LmZdsp7UrgJGR/U86NKAy8OVCtTxnRyVNicruNF3hlhNn9DtNUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:51:49.250570Z"},"content_sha256":"64c5e2c3f47c8d0f4e5fe93a70060bd4dd36da803cdbc08d9dc0510265d9ca5f","schema_version":"1.0","event_id":"sha256:64c5e2c3f47c8d0f4e5fe93a70060bd4dd36da803cdbc08d9dc0510265d9ca5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GJ6XH2JNFTB5SJBZM54FO3OZYZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nd5H6sL3wbmu2cq7t0Z+aSt39ifu7sDAuXkbtNsJBhIt11RiU2CI2LagqcSZgRqnOtYylW2ozorF9DYDAYsXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:51:49.250898Z"},"content_sha256":"ced74dd542e5c2ff9c42ccf284cbe4adcc2569026a2d9da6209e81f7a6f0b0f4","schema_version":"1.0","event_id":"sha256:ced74dd542e5c2ff9c42ccf284cbe4adcc2569026a2d9da6209e81f7a6f0b0f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/bundle.json","state_url":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T07:51:49Z","links":{"resolver":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ","bundle":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/bundle.json","state":"https://pith.science/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJ6XH2JNFTB5SJBZM54FO3OZYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GJ6XH2JNFTB5SJBZM54FO3OZYZ","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":"58f0253dba0b38ae46cb97f31f765fa85a2f7ee525fcbe52292a45bc11fdde62","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-25T16:19:38Z","title_canon_sha256":"1b312ad35484be105bbda363bbb840f937999a347a481bf033a7c1d3a17f9f04"},"schema_version":"1.0","source":{"id":"1407.6958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6958","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6958v3","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6958","created_at":"2026-05-18T01:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"GJ6XH2JNFTB5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GJ6XH2JNFTB5SJBZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GJ6XH2JN","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:ced74dd542e5c2ff9c42ccf284cbe4adcc2569026a2d9da6209e81f7a6f0b0f4","target":"graph","created_at":"2026-05-18T01:24:04Z","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":"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.","authors_text":"Lilla T\\'othm\\'er\\'esz, Viktor Kiss","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-25T16:19:38Z","title":"Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6958","kind":"arxiv","version":3},"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:64c5e2c3f47c8d0f4e5fe93a70060bd4dd36da803cdbc08d9dc0510265d9ca5f","target":"record","created_at":"2026-05-18T01:24:04Z","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":"58f0253dba0b38ae46cb97f31f765fa85a2f7ee525fcbe52292a45bc11fdde62","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-25T16:19:38Z","title_canon_sha256":"1b312ad35484be105bbda363bbb840f937999a347a481bf033a7c1d3a17f9f04"},"schema_version":"1.0","source":{"id":"1407.6958","kind":"arxiv","version":3}},"canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"327d73e92d2cc3d924396778576dd9c64a726c250c9de72ad41dd5116c6d9e74","first_computed_at":"2026-05-18T01:24:04.247464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:04.247464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfMlMk36oyB+VckYN462TmC91iwIKLj1KJnTLX3B4429LkVS6Kh0rGTtVnbrycfvJroVgoNVCmdjYPvytC1KBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:04.248208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c5e2c3f47c8d0f4e5fe93a70060bd4dd36da803cdbc08d9dc0510265d9ca5f","sha256:ced74dd542e5c2ff9c42ccf284cbe4adcc2569026a2d9da6209e81f7a6f0b0f4"],"state_sha256":"dc47e05fcffd7baa103d27bb0242bbc954aaf4492fcfae1ca94c4e3c36c12e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRNYM8Wo+WTx33DjK7cuasES5/quu81HIrInm0awFerGoM8H3EcWwzQ6xOsmPj6vSL/UzGa8ZJxYXgQ6NdViAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:51:49.252772Z","bundle_sha256":"911d7cd23e88adc57352c3eeaeec5da0abef83670d90cec942c11cbc1dbca5f4"}}