{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:S6OXCO7FP6IQPHM6DZUNBXQQCP","short_pith_number":"pith:S6OXCO7F","schema_version":"1.0","canonical_sha256":"979d713be57f91079d9e1e68d0de1013c6202faf0f5da27ff615b81b1e524adb","source":{"kind":"arxiv","id":"1111.7251","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.7251","created_at":"2026-05-18T04:07:18.311993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.7251v1","created_at":"2026-05-18T04:07:18.311993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.7251","created_at":"2026-05-18T04:07:18.311993+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6OXCO7FP6IQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6OXCO7FP6IQPHM6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6OXCO7F","created_at":"2026-05-18T12:26:41.206345+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/S6OXCO7FP6IQPHM6DZUNBXQQCP","json":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP.json","graph_json":"https://pith.science/api/pith-number/S6OXCO7FP6IQPHM6DZUNBXQQCP/graph.json","events_json":"https://pith.science/api/pith-number/S6OXCO7FP6IQPHM6DZUNBXQQCP/events.json","paper":"https://pith.science/paper/S6OXCO7F"},"agent_actions":{"view_html":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP","download_json":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP.json","view_paper":"https://pith.science/paper/S6OXCO7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.7251&json=true","fetch_graph":"https://pith.science/api/pith-number/S6OXCO7FP6IQPHM6DZUNBXQQCP/graph.json","fetch_events":"https://pith.science/api/pith-number/S6OXCO7FP6IQPHM6DZUNBXQQCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/action/storage_attestation","attest_author":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/action/author_attestation","sign_citation":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/action/citation_signature","submit_replication":"https://pith.science/pith/S6OXCO7FP6IQPHM6DZUNBXQQCP/action/replication_record"}},"created_at":"2026-05-18T04:07:18.311993+00:00","updated_at":"2026-05-18T04:07:18.311993+00:00"}