{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3EKIPASZGQFC5UZBIGEGLHINAH","short_pith_number":"pith:3EKIPASZ","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"},"canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","source":{"kind":"arxiv","id":"1704.08122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08122","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08122v1","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08122","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"3EKIPASZGQFC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3EKIPASZGQFC5UZB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3EKIPASZ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3EKIPASZGQFC5UZBIGEGLHINAH","target":"record","payload":{"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"},"canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","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"},"source_kind":"arxiv","source_id":"1704.08122","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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m31yPhwC1sXawncsP6x5wFJ+raHA468YVdXWAb9ov1XQ3nZz6r9Xx7fQjma0bvp9vgKPV7VAakX9+s5uhTQsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:26:56.369773Z"},"content_sha256":"ebc1c29b8e7b431e8754e7f89834377e52bd6d4f5a0f9e73fef2938c2355bcd9","schema_version":"1.0","event_id":"sha256:ebc1c29b8e7b431e8754e7f89834377e52bd6d4f5a0f9e73fef2938c2355bcd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3EKIPASZGQFC5UZBIGEGLHINAH","target":"graph","payload":{"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"},"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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tG1sAdfj4PGp8fURFGRA68JJgzjnbl/+bl/TkgSNvA76v/Zqdd+wYxDWfIhoYA5g6pX76CAHuztwWjGcPFFQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:26:56.370338Z"},"content_sha256":"46bab2c538a6e69881e7e4054d22d22303fbc399b40e420872db2525b1134cb8","schema_version":"1.0","event_id":"sha256:46bab2c538a6e69881e7e4054d22d22303fbc399b40e420872db2525b1134cb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/bundle.json","state_url":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EKIPASZGQFC5UZBIGEGLHINAH/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-05-28T15:26:56Z","links":{"resolver":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH","bundle":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/bundle.json","state":"https://pith.science/pith/3EKIPASZGQFC5UZBIGEGLHINAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EKIPASZGQFC5UZBIGEGLHINAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3EKIPASZGQFC5UZBIGEGLHINAH","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":"118c50ced3f2dfe0e4c2a23e47df704980b8c5849ea8d5d43fcecf9f5d297a87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T13:55:02Z","title_canon_sha256":"b99a87235316096a3c9f18acb018b2b9d630928b29a2b295bf4bd15e39b31420"},"schema_version":"1.0","source":{"id":"1704.08122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08122","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08122v1","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08122","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"3EKIPASZGQFC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3EKIPASZGQFC5UZB","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3EKIPASZ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:46bab2c538a6e69881e7e4054d22d22303fbc399b40e420872db2525b1134cb8","target":"graph","created_at":"2026-05-18T00:22:16Z","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 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 ","authors_text":"Karl Bringmann, Sebastian Krinninger, Thomas Dueholm Hansen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T13:55:02Z","title":"Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08122","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:ebc1c29b8e7b431e8754e7f89834377e52bd6d4f5a0f9e73fef2938c2355bcd9","target":"record","created_at":"2026-05-18T00:22:16Z","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":"118c50ced3f2dfe0e4c2a23e47df704980b8c5849ea8d5d43fcecf9f5d297a87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T13:55:02Z","title_canon_sha256":"b99a87235316096a3c9f18acb018b2b9d630928b29a2b295bf4bd15e39b31420"},"schema_version":"1.0","source":{"id":"1704.08122","kind":"arxiv","version":1}},"canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d914878259340a2ed3214188659d0d01c82a51e6bed03d62f95f0dc292b814ea","first_computed_at":"2026-05-18T00:22:16.255522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.255522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/dUdWeie6g18PEdaWTJxaCp0dQ18vWSvQnXJ4RzUKNUzDN8X5BLVlkyBFsWE0helJbJr/ClJWpTvyvYEnV6ZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.256108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebc1c29b8e7b431e8754e7f89834377e52bd6d4f5a0f9e73fef2938c2355bcd9","sha256:46bab2c538a6e69881e7e4054d22d22303fbc399b40e420872db2525b1134cb8"],"state_sha256":"17be3a6d986bf97f806d0a640204fe563eba83ba7ae4f25e488d36bf68bf9d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbH/RhEV53o+OuXqk+fnr5mhXhrmO+tlW6yqf7tw/2OtaRfdu5tw+F114jpk+sK/iEFRPR8N0WHwxfnzbnGUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:26:56.373156Z","bundle_sha256":"df19e21aafde6dd39819db4c6a3d66b62f65ad7dd9f298ddac5ea76121dede64"}}