{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:S6OXCO7FP6IQPHM6DZUNBXQQCP","short_pith_number":"pith:S6OXCO7F","canonical_record":{"source":{"id":"1111.7251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"2a65eeb007d9b10556081f2e01fdc971a139d502c859b3bdaa4cc798731f6066","abstract_canon_sha256":"e08e29a80944e72b2174de4d374ddc207fa3040da9e6b86c58cc5188649534ca"},"schema_version":"1.0"},"canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","source":{"kind":"arxiv","id":"1111.7251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.7251","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.7251v1","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7251","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"S6OXCO7FP6IQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S6OXCO7FP6IQPHM6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S6OXCO7F","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:S6OXCO7FP6IQPHM6DZUNBXQQCP","target":"record","payload":{"canonical_record":{"source":{"id":"1111.7251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"2a65eeb007d9b10556081f2e01fdc971a139d502c859b3bdaa4cc798731f6066","abstract_canon_sha256":"e08e29a80944e72b2174de4d374ddc207fa3040da9e6b86c58cc5188649534ca"},"schema_version":"1.0"},"canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:18.312617Z","signature_b64":"faXV1AYdn/eeI/aj4FxTyjG9tSZ7n3UFBTok/a157+hEuvvwEjRIiV2azTEr5i+TQxe83d/xdnEDS/j8AFFMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","last_reissued_at":"2026-05-18T04:07:18.311882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:18.311882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.7251","source_version":1,"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-18T04:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9vdEE/2ekcg5/4zpiD3DIwfCPLdh6O4OiS/WhY0VAMoLYRMj4gigxuj3HxVrX40CtVsbb6mKxf08TKnxvbVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:07:08.837338Z"},"content_sha256":"eeba2dffd4ab302e868600340b705d398896a13875788d5778e93cfb9962b04e","schema_version":"1.0","event_id":"sha256:eeba2dffd4ab302e868600340b705d398896a13875788d5778e93cfb9962b04e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:S6OXCO7FP6IQPHM6DZUNBXQQCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The rank of a divisor on a finite graph: geometry and computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Madhusudan Manjunath","submitted_at":"2011-11-30T17:54:07Z","abstract_excerpt":"We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists of two parts: the first part is an algorithm whose running time is polynomial for a multigraph with a fixed number of vertices. More precisely, our algorithm has running time O(2^{n \\log n})poly(size(G)), where n+1 is the number of vertices of the graph G. The second part consists of a new proof of the fact that testing if rank of a divisor is non-negative "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7251","kind":"arxiv","version":1},"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-18T04:07:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/Lhgvt4C4Yk0wQ7hl0qZJ4U7hen9DX0N3bBHS6jM22B8LdYiztxl/MNIt+PaKlaaiu6s//9+YqXMVWkkg3qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:07:08.837691Z"},"content_sha256":"97fbd9f21e3efc97d448674749ce9a898419fce2dff88503dfa1a062f4017b8a","schema_version":"1.0","event_id":"sha256:97fbd9f21e3efc97d448674749ce9a898419fce2dff88503dfa1a062f4017b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/bundle.json","state_url":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/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-19T23:07:08Z","links":{"resolver":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP","bundle":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/bundle.json","state":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:S6OXCO7FP6IQPHM6DZUNBXQQCP","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":"e08e29a80944e72b2174de4d374ddc207fa3040da9e6b86c58cc5188649534ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:54:07Z","title_canon_sha256":"2a65eeb007d9b10556081f2e01fdc971a139d502c859b3bdaa4cc798731f6066"},"schema_version":"1.0","source":{"id":"1111.7251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.7251","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.7251v1","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7251","created_at":"2026-05-18T04:07:18Z"},{"alias_kind":"pith_short_12","alias_value":"S6OXCO7FP6IQ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S6OXCO7FP6IQPHM6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S6OXCO7F","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:97fbd9f21e3efc97d448674749ce9a898419fce2dff88503dfa1a062f4017b8a","target":"graph","created_at":"2026-05-18T04:07:18Z","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":"We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists of two parts: the first part is an algorithm whose running time is polynomial for a multigraph with a fixed number of vertices. More precisely, our algorithm has running time O(2^{n \\log n})poly(size(G)), where n+1 is the number of vertices of the graph G. The second part consists of a new proof of the fact that testing if rank of a divisor is non-negative ","authors_text":"Madhusudan Manjunath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:54:07Z","title":"The rank of a divisor on a finite graph: geometry and computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.7251","kind":"arxiv","version":1},"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:eeba2dffd4ab302e868600340b705d398896a13875788d5778e93cfb9962b04e","target":"record","created_at":"2026-05-18T04:07:18Z","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":"e08e29a80944e72b2174de4d374ddc207fa3040da9e6b86c58cc5188649534ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-30T17:54:07Z","title_canon_sha256":"2a65eeb007d9b10556081f2e01fdc971a139d502c859b3bdaa4cc798731f6066"},"schema_version":"1.0","source":{"id":"1111.7251","kind":"arxiv","version":1}},"canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","first_computed_at":"2026-05-18T04:07:18.311882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:18.311882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"faXV1AYdn/eeI/aj4FxTyjG9tSZ7n3UFBTok/a157+hEuvvwEjRIiV2azTEr5i+TQxe83d/xdnEDS/j8AFFMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:18.312617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.7251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeba2dffd4ab302e868600340b705d398896a13875788d5778e93cfb9962b04e","sha256:97fbd9f21e3efc97d448674749ce9a898419fce2dff88503dfa1a062f4017b8a"],"state_sha256":"86f6bf8df96c3081c6bc6ff2b52670ed5acb9aa91ea9196f79342cff963b0167"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pec50yYwKlFBwko9K5AO1oA46oKAhBGqCNuz9/oTUN4hs7mQFjBLg19BwA8tlyRcMg4XU3/HghSn9c556oKqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:07:08.840239Z","bundle_sha256":"033ffc13a8be3f37018f026314055194e84dfce94125bbd6b27c11fe44f47e67"}}