{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:USINP3ILWCMXWPK3CNLUYVH7LL","short_pith_number":"pith:USINP3IL","canonical_record":{"source":{"id":"1905.08621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-21T13:30:37Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e6824cbdeb7d05e4e9207dd7f1c0118260948a8f257bc509a5ed28beee5da61e","abstract_canon_sha256":"3e7cebfe25efc696bbfda00d453fc8795c296e20188d78f526f7fec6dfd4aa19"},"schema_version":"1.0"},"canonical_sha256":"a490d7ed0bb0997b3d5b13574c54ff5afc1eb912aa05e76fd45c135924cd4398","source":{"kind":"arxiv","id":"1905.08621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08621","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08621v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08621","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"USINP3ILWCMX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USINP3ILWCMXWPK3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USINP3IL","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:USINP3ILWCMXWPK3CNLUYVH7LL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-21T13:30:37Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e6824cbdeb7d05e4e9207dd7f1c0118260948a8f257bc509a5ed28beee5da61e","abstract_canon_sha256":"3e7cebfe25efc696bbfda00d453fc8795c296e20188d78f526f7fec6dfd4aa19"},"schema_version":"1.0"},"canonical_sha256":"a490d7ed0bb0997b3d5b13574c54ff5afc1eb912aa05e76fd45c135924cd4398","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:42.618704Z","signature_b64":"rKTaSx4EhSKDaMSRYS0Km59Q75cknN0x7Eo1vphDpnBHyC4h7gsem81bK80/J1h/XX4Eqbm4Ni+h7x3JTIHaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a490d7ed0bb0997b3d5b13574c54ff5afc1eb912aa05e76fd45c135924cd4398","last_reissued_at":"2026-05-17T23:45:42.617978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:42.617978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08621","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-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8b1sP1rWR0GvCFEGfSHLJSegOufmU86othXYuLSoQNqrBMiIsrwTqTdVuzilTSnT7OPDSfnOhb1xqCSVdWOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:11.163580Z"},"content_sha256":"54089b8fe2cd2c85a6d9fb5b039092885d9bcf5fb4d83866bb75353719a5003c","schema_version":"1.0","event_id":"sha256:54089b8fe2cd2c85a6d9fb5b039092885d9bcf5fb4d83866bb75353719a5003c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:USINP3ILWCMXWPK3CNLUYVH7LL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest-Path-Preserving Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"David K\\\"ubel, Elmar Langetepe, Herman Haverkort","submitted_at":"2019-05-21T13:30:37Z","abstract_excerpt":"Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be preferable or even required. This raises the following question: given an undirected graph with non-negative real weights on the edges and an error threshold $\\varepsilon$, how efficiently can we decide whether we can round all weights such that shortest paths are maintained, and the change of weight of each shortest path is less than $\\varepsilon$? So far,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08621","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-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpXwc3dNu4p/KR3NI9WN1qTKLioiLT4TOWDvhYmpnn5pO1ZWOr10xDKUmEFD72WFrXCpdopBIiMWhWO2fhhrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:11.164447Z"},"content_sha256":"d3564dc8d9f756cb8bc72f698862dff47903197b877d9382170c69b7f2f9df3f","schema_version":"1.0","event_id":"sha256:d3564dc8d9f756cb8bc72f698862dff47903197b877d9382170c69b7f2f9df3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USINP3ILWCMXWPK3CNLUYVH7LL/bundle.json","state_url":"https://pith.science/pith/USINP3ILWCMXWPK3CNLUYVH7LL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USINP3ILWCMXWPK3CNLUYVH7LL/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-05T19:58:11Z","links":{"resolver":"https://pith.science/pith/USINP3ILWCMXWPK3CNLUYVH7LL","bundle":"https://pith.science/pith/USINP3ILWCMXWPK3CNLUYVH7LL/bundle.json","state":"https://pith.science/pith/USINP3ILWCMXWPK3CNLUYVH7LL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USINP3ILWCMXWPK3CNLUYVH7LL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:USINP3ILWCMXWPK3CNLUYVH7LL","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":"3e7cebfe25efc696bbfda00d453fc8795c296e20188d78f526f7fec6dfd4aa19","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-21T13:30:37Z","title_canon_sha256":"e6824cbdeb7d05e4e9207dd7f1c0118260948a8f257bc509a5ed28beee5da61e"},"schema_version":"1.0","source":{"id":"1905.08621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08621","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08621v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08621","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"USINP3ILWCMX","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USINP3ILWCMXWPK3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USINP3IL","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:d3564dc8d9f756cb8bc72f698862dff47903197b877d9382170c69b7f2f9df3f","target":"graph","created_at":"2026-05-17T23:45:42Z","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":"Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be preferable or even required. This raises the following question: given an undirected graph with non-negative real weights on the edges and an error threshold $\\varepsilon$, how efficiently can we decide whether we can round all weights such that shortest paths are maintained, and the change of weight of each shortest path is less than $\\varepsilon$? So far,","authors_text":"David K\\\"ubel, Elmar Langetepe, Herman Haverkort","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-21T13:30:37Z","title":"Shortest-Path-Preserving Rounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08621","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:54089b8fe2cd2c85a6d9fb5b039092885d9bcf5fb4d83866bb75353719a5003c","target":"record","created_at":"2026-05-17T23:45:42Z","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":"3e7cebfe25efc696bbfda00d453fc8795c296e20188d78f526f7fec6dfd4aa19","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-21T13:30:37Z","title_canon_sha256":"e6824cbdeb7d05e4e9207dd7f1c0118260948a8f257bc509a5ed28beee5da61e"},"schema_version":"1.0","source":{"id":"1905.08621","kind":"arxiv","version":1}},"canonical_sha256":"a490d7ed0bb0997b3d5b13574c54ff5afc1eb912aa05e76fd45c135924cd4398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a490d7ed0bb0997b3d5b13574c54ff5afc1eb912aa05e76fd45c135924cd4398","first_computed_at":"2026-05-17T23:45:42.617978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:42.617978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKTaSx4EhSKDaMSRYS0Km59Q75cknN0x7Eo1vphDpnBHyC4h7gsem81bK80/J1h/XX4Eqbm4Ni+h7x3JTIHaDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:42.618704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54089b8fe2cd2c85a6d9fb5b039092885d9bcf5fb4d83866bb75353719a5003c","sha256:d3564dc8d9f756cb8bc72f698862dff47903197b877d9382170c69b7f2f9df3f"],"state_sha256":"bd896bdca3473dc8a9e5960b018ac966028bb1b8e33472675fa77249e62f00eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpaDVJ+PsJ50oAW+scdlMXQG253Z04Xy5qe6TfXodW/cuq4zkepcFvY1O4pa1ekny8F8uaNFYE/d5nFZLQjBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:58:11.169504Z","bundle_sha256":"30c9afbcb2bf1ffd1ac504ebb61a48efffe2d778835134ab8276f0b336021fd9"}}