{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NUMZY6THLUAYSPJG6ZQ6PJV2PN","short_pith_number":"pith:NUMZY6TH","schema_version":"1.0","canonical_sha256":"6d199c7a675d01893d26f661e7a6ba7b51636245367eabdea8271153e1b7091e","source":{"kind":"arxiv","id":"1706.01508","version":1},"attestation_state":"computed","paper":{"title":"Time-dependent shortest paths in bounded treewidth graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Morgan Shirley","submitted_at":"2017-06-05T19:22:36Z","abstract_excerpt":"We present a proof that the number of breakpoints in the arrival function between two terminals in graphs of treewidth $w$ is $n^{O(\\log^2 w)}$ when the edge arrival functions are piecewise linear. This is an improvement on the bound of $n^{\\Theta(\\log n)}$ by Foschini, Hershberger, and Suri for graphs without any bound on treewidth. We provide an algorithm for calculating this arrival function using star-mesh transformations, a generalization of the wye-delta-wye transformations."},"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":"1706.01508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T19:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"7898b3d1d79d23601338dd1a3c6af70377ef8365cec47453d34dc129ed85acd4","abstract_canon_sha256":"252904881e08a2b0966d93c862756ce4763d0ee87992458754a85593ff8db678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:56.842479Z","signature_b64":"EZv6xxs7dPfzXZ7LSWt2U5XyT0FsfoDlJr6xD59rfOsp/YNfChgKRZJemOcj3Q2vKcsE4D2ylOi0lHcv662UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d199c7a675d01893d26f661e7a6ba7b51636245367eabdea8271153e1b7091e","last_reissued_at":"2026-05-18T00:42:56.841884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:56.841884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-dependent shortest paths in bounded treewidth graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Morgan Shirley","submitted_at":"2017-06-05T19:22:36Z","abstract_excerpt":"We present a proof that the number of breakpoints in the arrival function between two terminals in graphs of treewidth $w$ is $n^{O(\\log^2 w)}$ when the edge arrival functions are piecewise linear. This is an improvement on the bound of $n^{\\Theta(\\log n)}$ by Foschini, Hershberger, and Suri for graphs without any bound on treewidth. We provide an algorithm for calculating this arrival function using star-mesh transformations, a generalization of the wye-delta-wye transformations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01508","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":"1706.01508","created_at":"2026-05-18T00:42:56.841986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01508v1","created_at":"2026-05-18T00:42:56.841986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01508","created_at":"2026-05-18T00:42:56.841986+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUMZY6THLUAY","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUMZY6THLUAYSPJG","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUMZY6TH","created_at":"2026-05-18T12:31:34.259226+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/NUMZY6THLUAYSPJG6ZQ6PJV2PN","json":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN.json","graph_json":"https://pith.science/api/pith-number/NUMZY6THLUAYSPJG6ZQ6PJV2PN/graph.json","events_json":"https://pith.science/api/pith-number/NUMZY6THLUAYSPJG6ZQ6PJV2PN/events.json","paper":"https://pith.science/paper/NUMZY6TH"},"agent_actions":{"view_html":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN","download_json":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN.json","view_paper":"https://pith.science/paper/NUMZY6TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01508&json=true","fetch_graph":"https://pith.science/api/pith-number/NUMZY6THLUAYSPJG6ZQ6PJV2PN/graph.json","fetch_events":"https://pith.science/api/pith-number/NUMZY6THLUAYSPJG6ZQ6PJV2PN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN/action/storage_attestation","attest_author":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN/action/author_attestation","sign_citation":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN/action/citation_signature","submit_replication":"https://pith.science/pith/NUMZY6THLUAYSPJG6ZQ6PJV2PN/action/replication_record"}},"created_at":"2026-05-18T00:42:56.841986+00:00","updated_at":"2026-05-18T00:42:56.841986+00:00"}