{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GPX6QPA464QQL3FO5SGC6R2ASG","short_pith_number":"pith:GPX6QPA4","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"},"canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","source":{"kind":"arxiv","id":"1008.1048","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GPX6QPA464QQL3FO5SGC6R2ASG","target":"record","payload":{"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"},"canonical_sha256":"33efe83c1cf72105ecaeec8c2f474091824044912870edd79d5890ab0bf57a42","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"},"source_kind":"arxiv","source_id":"1008.1048","source_version":2,"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-18T04:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9WVt1cjrgOLy2AxU8afCB4VSMtXuompfq3G07AXQz1SFJt/9xOyo6P70VpBxuRGNZIrbIeoIiVRSCTheGjPLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:58:42.211441Z"},"content_sha256":"33acea156eb2af8a81e168b2d3469666474e59bd931abb5f8f3adcbdbb235e71","schema_version":"1.0","event_id":"sha256:33acea156eb2af8a81e168b2d3469666474e59bd931abb5f8f3adcbdbb235e71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GPX6QPA464QQL3FO5SGC6R2ASG","target":"graph","payload":{"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"},"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-18T04:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo9UgmQbRKFFI0G52KegS07aiDdiyF0l1uPxQgLLksFlyK3nXxFG0j2b/Q2x7fSjaECmfqmWoG/JQfq9jbWDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:58:42.211791Z"},"content_sha256":"9d9d65aa8cd3b4068e31725e66eedd0e30b14f1a9af44ec0557fbac490260ccc","schema_version":"1.0","event_id":"sha256:9d9d65aa8cd3b4068e31725e66eedd0e30b14f1a9af44ec0557fbac490260ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/bundle.json","state_url":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPX6QPA464QQL3FO5SGC6R2ASG/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-06-05T15:58:42Z","links":{"resolver":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG","bundle":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/bundle.json","state":"https://pith.science/pith/GPX6QPA464QQL3FO5SGC6R2ASG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPX6QPA464QQL3FO5SGC6R2ASG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxMRd5ttkJl8AWvM5Gw6/S58Mp0YdwtobjHxeYDzhEFSvUFKbIwJP7IkXhL3jEkx/KDQB4Ps1VjCbjV65h6nBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:58:42.213748Z","bundle_sha256":"270417a9040130d66d95e4334c1dbcdaac29040631abcb2c93a01844ec2860a1"}}