{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GPX6QPA464QQL3FO5SGC6R2ASG","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":"8ad6773e89c392847747066f73d5ca06153dc7665b7f94bc2615edd11f48127d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-05T19:37:06Z","title_canon_sha256":"5ca3bb43fa1dbb1a0f69e5e5777f55a86d610e54e29c36bc7dbfa51c62ce2b73"},"schema_version":"1.0","source":{"id":"1008.1048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1048","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1048v2","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1048","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"GPX6QPA464QQ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GPX6QPA464QQL3FO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GPX6QPA4","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:9d9d65aa8cd3b4068e31725e66eedd0e30b14f1a9af44ec0557fbac490260ccc","target":"graph","created_at":"2026-05-18T04:39:38Z","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":"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.","authors_text":"Christian Wulff-Nilsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-05T19:37:06Z","title":"Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1048","kind":"arxiv","version":2},"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:33acea156eb2af8a81e168b2d3469666474e59bd931abb5f8f3adcbdbb235e71","target":"record","created_at":"2026-05-18T04:39:38Z","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":"8ad6773e89c392847747066f73d5ca06153dc7665b7f94bc2615edd11f48127d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-08-05T19:37:06Z","title_canon_sha256":"5ca3bb43fa1dbb1a0f69e5e5777f55a86d610e54e29c36bc7dbfa51c62ce2b73"},"schema_version":"1.0","source":{"id":"1008.1048","kind":"arxiv","version":2}},"canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","first_computed_at":"2026-05-18T04:39:38.640464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:38.640464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZKVgzTKPiE/rPMpR/ssAFsIW6uLSHnXATImGs01iJqkZaz5CIDAo4B4dRZFHAGbp78vFSZyP+qlXgL0jZg5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:38.640935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33acea156eb2af8a81e168b2d3469666474e59bd931abb5f8f3adcbdbb235e71","sha256:9d9d65aa8cd3b4068e31725e66eedd0e30b14f1a9af44ec0557fbac490260ccc"],"state_sha256":"0d9b53dc12f469d55f8db67d56e913434f84c47bbb146af0a6f0095d23b05d62"}