{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GPX6QPA464QQL3FO5SGC6R2ASG","short_pith_number":"pith:GPX6QPA4","schema_version":"1.0","canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","source":{"kind":"arxiv","id":"1008.1048","version":2},"attestation_state":"computed","paper":{"title":"Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2010-08-05T19:37:06Z","abstract_excerpt":"Let $H$ be a fixed graph and let $G$ be an $H$-minor free $n$-vertex graph with integer edge weights and no negative weight cycles reachable from a given vertex $s$. We present an algorithm that computes a shortest path tree in $G$ rooted at $s$ in $\\tilde{O}(n^{4/3}\\log L)$ time, where $L$ is the absolute value of the smallest edge weight. The previous best bound was $\\tilde{O}(n^{\\sqrt{11.5}-2}\\log L) = O(n^{1.392}\\log L)$. Our running time matches an earlier bound for planar graphs by Henzinger et al."},"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":"1008.1048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-05T19:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"5ca3bb43fa1dbb1a0f69e5e5777f55a86d610e54e29c36bc7dbfa51c62ce2b73","abstract_canon_sha256":"8ad6773e89c392847747066f73d5ca06153dc7665b7f94bc2615edd11f48127d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:38.640935Z","signature_b64":"7ZKVgzTKPiE/rPMpR/ssAFsIW6uLSHnXATImGs01iJqkZaz5CIDAo4B4dRZFHAGbp78vFSZyP+qlXgL0jZg5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","last_reissued_at":"2026-05-18T04:39:38.640464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:38.640464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2010-08-05T19:37:06Z","abstract_excerpt":"Let $H$ be a fixed graph and let $G$ be an $H$-minor free $n$-vertex graph with integer edge weights and no negative weight cycles reachable from a given vertex $s$. We present an algorithm that computes a shortest path tree in $G$ rooted at $s$ in $\\tilde{O}(n^{4/3}\\log L)$ time, where $L$ is the absolute value of the smallest edge weight. The previous best bound was $\\tilde{O}(n^{\\sqrt{11.5}-2}\\log L) = O(n^{1.392}\\log L)$. Our running time matches an earlier bound for planar graphs by Henzinger et al."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1048","kind":"arxiv","version":2},"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":"1008.1048","created_at":"2026-05-18T04:39:38.640531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1048v2","created_at":"2026-05-18T04:39:38.640531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1048","created_at":"2026-05-18T04:39:38.640531+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPX6QPA464QQ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPX6QPA464QQL3FO","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPX6QPA4","created_at":"2026-05-18T12:26:07.630475+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/GPX6QPA464QQL3FO5SGC6R2ASG","json":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG.json","graph_json":"https://pith.science/api/pith-number/GPX6QPA464QQL3FO5SGC6R2ASG/graph.json","events_json":"https://pith.science/api/pith-number/GPX6QPA464QQL3FO5SGC6R2ASG/events.json","paper":"https://pith.science/paper/GPX6QPA4"},"agent_actions":{"view_html":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG","download_json":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG.json","view_paper":"https://pith.science/paper/GPX6QPA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1048&json=true","fetch_graph":"https://pith.science/api/pith-number/GPX6QPA464QQL3FO5SGC6R2ASG/graph.json","fetch_events":"https://pith.science/api/pith-number/GPX6QPA464QQL3FO5SGC6R2ASG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/action/storage_attestation","attest_author":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/action/author_attestation","sign_citation":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/action/citation_signature","submit_replication":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/action/replication_record"}},"created_at":"2026-05-18T04:39:38.640531+00:00","updated_at":"2026-05-18T04:39:38.640531+00:00"}