{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3EKIPASZGQFC5UZBIGEGLHINAH","short_pith_number":"pith:3EKIPASZ","schema_version":"1.0","canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","source":{"kind":"arxiv","id":"1704.08122","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Sebastian Krinninger, Thomas Dueholm Hansen","submitted_at":"2017-04-26T13:55:02Z","abstract_excerpt":"We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time $ \\tilde O (m^{3/4} n^{3/2}) $, which gives the first improvement over Megiddo's $ \\tilde O (n^3) $ algorithm [JACM'83] for sparse "},"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":"1704.08122","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T13:55:02Z","cross_cats_sorted":[],"title_canon_sha256":"b99a87235316096a3c9f18acb018b2b9d630928b29a2b295bf4bd15e39b31420","abstract_canon_sha256":"118c50ced3f2dfe0e4c2a23e47df704980b8c5849ea8d5d43fcecf9f5d297a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.256108Z","signature_b64":"/dUdWeie6g18PEdaWTJxaCp0dQ18vWSvQnXJ4RzUKNUzDN8X5BLVlkyBFsWE0helJbJr/ClJWpTvyvYEnV6ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","last_reissued_at":"2026-05-18T00:22:16.255522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.255522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Sebastian Krinninger, Thomas Dueholm Hansen","submitted_at":"2017-04-26T13:55:02Z","abstract_excerpt":"We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in the context of quantitative verification. We focus on strongly polynomial algorithms to cover the use-case where the weights are relatively large compared to the size of the graph. Our main result is an algorithm with running time $ \\tilde O (m^{3/4} n^{3/2}) $, which gives the first improvement over Megiddo's $ \\tilde O (n^3) $ algorithm [JACM'83] for sparse "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08122","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":"1704.08122","created_at":"2026-05-18T00:22:16.255620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08122v1","created_at":"2026-05-18T00:22:16.255620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08122","created_at":"2026-05-18T00:22:16.255620+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EKIPASZGQFC","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EKIPASZGQFC5UZB","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EKIPASZ","created_at":"2026-05-18T12:30:58.224056+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/3EKIPASZGQFC5UZBIGEGLHINAH","json":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH.json","graph_json":"https://pith.science/api/pith-number/3EKIPASZGQFC5UZBIGEGLHINAH/graph.json","events_json":"https://pith.science/api/pith-number/3EKIPASZGQFC5UZBIGEGLHINAH/events.json","paper":"https://pith.science/paper/3EKIPASZ"},"agent_actions":{"view_html":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH","download_json":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH.json","view_paper":"https://pith.science/paper/3EKIPASZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08122&json=true","fetch_graph":"https://pith.science/api/pith-number/3EKIPASZGQFC5UZBIGEGLHINAH/graph.json","fetch_events":"https://pith.science/api/pith-number/3EKIPASZGQFC5UZBIGEGLHINAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/action/storage_attestation","attest_author":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/action/author_attestation","sign_citation":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/action/citation_signature","submit_replication":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/action/replication_record"}},"created_at":"2026-05-18T00:22:16.255620+00:00","updated_at":"2026-05-18T00:22:16.255620+00:00"}