{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:MEUV6DKBSX6S4QCFSAJN7QVDAL","short_pith_number":"pith:MEUV6DKB","canonical_record":{"source":{"id":"cs/0205041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:48:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c2acf87cc95bc912a9a0b08fc462b06a16138a2606fc901a8ead81f6e69cc0d7","abstract_canon_sha256":"d05a2056199df802124f0e15c71307242ce519813fa8ee65413e3e1f34707bc1"},"schema_version":"1.0"},"canonical_sha256":"61295f0d4195fd2e40459012dfc2a302c121957d4369f37cd647d09256df9024","source":{"kind":"arxiv","id":"cs/0205041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205041","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205041v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205041","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"MEUV6DKBSX6S","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"MEUV6DKBSX6S4QCF","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"MEUV6DKB","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:MEUV6DKBSX6S4QCFSAJN7QVDAL","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0205041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:48:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c2acf87cc95bc912a9a0b08fc462b06a16138a2606fc901a8ead81f6e69cc0d7","abstract_canon_sha256":"d05a2056199df802124f0e15c71307242ce519813fa8ee65413e3e1f34707bc1"},"schema_version":"1.0"},"canonical_sha256":"61295f0d4195fd2e40459012dfc2a302c121957d4369f37cd647d09256df9024","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.942787Z","signature_b64":"AljO4l72QbMVHd2214nc+Ldmf2icdx5nJmhNuuO4JSNQP5pj59oI6PurXpMATeq+8L/CFDqHQLU4JvNbq7omBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61295f0d4195fd2e40459012dfc2a302c121957d4369f37cd647d09256df9024","last_reissued_at":"2026-05-18T01:59:53.942325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.942325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0205041","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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siTkllzaalTLCZiIYHSUYNKbzGJKiOjc9ngJ5BunWFF5ZT6h4IiJqHIh1ubgdDwZNKAPm1CDmhDztOSnEz3WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:15.623254Z"},"content_sha256":"f69784b4296ebd51abfd6b4c71e6b1c80a26c222c6008b50df2b54994d4f2194","schema_version":"1.0","event_id":"sha256:f69784b4296ebd51abfd6b4c71e6b1c80a26c222c6008b50df2b54994d4f2194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:MEUV6DKBSX6S4QCFSAJN7QVDAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Parametric Shortest Path and Minimum Balance Algorithms","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"James Orlin, Neal Young, Robert Tarjan","submitted_at":"2002-05-18T15:48:56Z","abstract_excerpt":"The parametric shortest path problem is to find the shortest paths in graph where the edge costs are of the form w_ij+lambda where each w_ij is constant and lambda is a parameter that varies. The problem is to find shortest path trees for every possible value of lambda.\n  The minimum-balance problem is to find a ``weighting'' of the vertices so that adjusting the edge costs by the vertex weights yields a graph in which, for every cut, the minimum weight of any edge crossing the cut in one direction equals the minimum weight of any edge crossing the cut in the other direction.\n  The paper prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205041","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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxrghV6Xyf8vx7yuycsfcRrjSTr1nKZZ2l8FOqUHyxu6PyFHdkGq1np97Q8biEB+WtpalV1l/n9xo2Xiu+ofCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:15.623959Z"},"content_sha256":"e9766069962c3439cbef4e1545b879412c4d92b03881b76ed625d6a85978e7c7","schema_version":"1.0","event_id":"sha256:e9766069962c3439cbef4e1545b879412c4d92b03881b76ed625d6a85978e7c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/bundle.json","state_url":"https://pith.science/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/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-06T23:07:15Z","links":{"resolver":"https://pith.science/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL","bundle":"https://pith.science/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/bundle.json","state":"https://pith.science/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEUV6DKBSX6S4QCFSAJN7QVDAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:MEUV6DKBSX6S4QCFSAJN7QVDAL","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":"d05a2056199df802124f0e15c71307242ce519813fa8ee65413e3e1f34707bc1","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:48:56Z","title_canon_sha256":"c2acf87cc95bc912a9a0b08fc462b06a16138a2606fc901a8ead81f6e69cc0d7"},"schema_version":"1.0","source":{"id":"cs/0205041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205041","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205041v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205041","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"MEUV6DKBSX6S","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"MEUV6DKBSX6S4QCF","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"MEUV6DKB","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:e9766069962c3439cbef4e1545b879412c4d92b03881b76ed625d6a85978e7c7","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"The parametric shortest path problem is to find the shortest paths in graph where the edge costs are of the form w_ij+lambda where each w_ij is constant and lambda is a parameter that varies. The problem is to find shortest path trees for every possible value of lambda.\n  The minimum-balance problem is to find a ``weighting'' of the vertices so that adjusting the edge costs by the vertex weights yields a graph in which, for every cut, the minimum weight of any edge crossing the cut in one direction equals the minimum weight of any edge crossing the cut in the other direction.\n  The paper prese","authors_text":"James Orlin, Neal Young, Robert Tarjan","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:48:56Z","title":"Faster Parametric Shortest Path and Minimum Balance Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205041","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:f69784b4296ebd51abfd6b4c71e6b1c80a26c222c6008b50df2b54994d4f2194","target":"record","created_at":"2026-05-18T01:59:53Z","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":"d05a2056199df802124f0e15c71307242ce519813fa8ee65413e3e1f34707bc1","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:48:56Z","title_canon_sha256":"c2acf87cc95bc912a9a0b08fc462b06a16138a2606fc901a8ead81f6e69cc0d7"},"schema_version":"1.0","source":{"id":"cs/0205041","kind":"arxiv","version":1}},"canonical_sha256":"61295f0d4195fd2e40459012dfc2a302c121957d4369f37cd647d09256df9024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61295f0d4195fd2e40459012dfc2a302c121957d4369f37cd647d09256df9024","first_computed_at":"2026-05-18T01:59:53.942325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.942325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AljO4l72QbMVHd2214nc+Ldmf2icdx5nJmhNuuO4JSNQP5pj59oI6PurXpMATeq+8L/CFDqHQLU4JvNbq7omBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.942787Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f69784b4296ebd51abfd6b4c71e6b1c80a26c222c6008b50df2b54994d4f2194","sha256:e9766069962c3439cbef4e1545b879412c4d92b03881b76ed625d6a85978e7c7"],"state_sha256":"d315f6b0053e676b75a012fbf03f723df42c470666b2127497e296daa4338758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0njsxiAPnNSFtOi6SGrLZcoM0hTx7SJODiw+isWY2AqZKWvQJ0ZNyc/vKsf1W4+s+ygZyUr2hBhexXp0K60CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:07:15.627759Z","bundle_sha256":"941bc5dd348adc1311994e03c9bc6e8dc34d6b54750f85c15b1366fb443e1023"}}