{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EVBKLNROD2RT64XIKOGZ7S56T6","short_pith_number":"pith:EVBKLNRO","canonical_record":{"source":{"id":"1410.0205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-01T12:45:16Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"451988c8ba5b1b2d89712dc37a92bad4fa2d12069da7fa0680c69a6f0a83eca2","abstract_canon_sha256":"7a001b0a615140bda62ed8b3df4b9ec4cf010e4654067ef04aab2fcdd597c647"},"schema_version":"1.0"},"canonical_sha256":"2542a5b62e1ea33f72e8538d9fcbbe9fa260c2d0d6185da64480f479e4ef58dd","source":{"kind":"arxiv","id":"1410.0205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0205","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0205v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0205","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"EVBKLNROD2RT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EVBKLNROD2RT64XI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EVBKLNRO","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EVBKLNROD2RT64XIKOGZ7S56T6","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-01T12:45:16Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"451988c8ba5b1b2d89712dc37a92bad4fa2d12069da7fa0680c69a6f0a83eca2","abstract_canon_sha256":"7a001b0a615140bda62ed8b3df4b9ec4cf010e4654067ef04aab2fcdd597c647"},"schema_version":"1.0"},"canonical_sha256":"2542a5b62e1ea33f72e8538d9fcbbe9fa260c2d0d6185da64480f479e4ef58dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.783377Z","signature_b64":"JoHHte/6//soeWPyBc8TbUsNwZ6blQLRFUBE3f0aloDNYiIRu4846Lzxq19THgQ5IQ3W3XxdMdIm4yFNnp+HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2542a5b62e1ea33f72e8538d9fcbbe9fa260c2d0d6185da64480f479e4ef58dd","last_reissued_at":"2026-05-18T02:41:17.782754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.782754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0205","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-18T02:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlqKxxj9pkddqS1aKgV7QK3NAtX4BcCCtiqlWME7oWKiHHSdnlpYCNtNzdm3yxbkO+zniaKCL4vWo5IvdNG4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:51:31.070506Z"},"content_sha256":"22e704e1c1ff668e759b7badb2d5d1008606dc10e1ca264cb54400ba33220c77","schema_version":"1.0","event_id":"sha256:22e704e1c1ff668e759b7badb2d5d1008606dc10e1ca264cb54400ba33220c77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EVBKLNROD2RT64XIKOGZ7S56T6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ParetoPrep: Fast computation of Path Skylines Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Gregor Joss\\'e, Matthias Schubert, Michael Shekelyan","submitted_at":"2014-10-01T12:45:16Z","abstract_excerpt":"Computing cost optimal paths in network data is a very important task in many application areas like transportation networks, computer networks or social graphs. In many cases, the cost of an edge can be described by various cost criteria. For example, in a road network possible cost criteria are distance, time, ascent, energy consumption or toll fees. In such a multicriteria network, a route or path skyline query computes the set of all paths having pareto optimal costs, i.e. each result path is optimal for different user preferences. In this paper, we propose a new method for computing route"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0205","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-18T02:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ra5nMgW7GFOP8K+j6czYCsyABp3SFMd2nfQteEswwiyIAucwP64ZLiV7rgRWxSAu5rhD/KEqqaMtZXg+yXRQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:51:31.070859Z"},"content_sha256":"addfe1891d72df955fc34c338261e3198e38e04f57125385c66d834cbd14f6c9","schema_version":"1.0","event_id":"sha256:addfe1891d72df955fc34c338261e3198e38e04f57125385c66d834cbd14f6c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVBKLNROD2RT64XIKOGZ7S56T6/bundle.json","state_url":"https://pith.science/pith/EVBKLNROD2RT64XIKOGZ7S56T6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVBKLNROD2RT64XIKOGZ7S56T6/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-05-27T20:51:31Z","links":{"resolver":"https://pith.science/pith/EVBKLNROD2RT64XIKOGZ7S56T6","bundle":"https://pith.science/pith/EVBKLNROD2RT64XIKOGZ7S56T6/bundle.json","state":"https://pith.science/pith/EVBKLNROD2RT64XIKOGZ7S56T6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVBKLNROD2RT64XIKOGZ7S56T6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EVBKLNROD2RT64XIKOGZ7S56T6","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":"7a001b0a615140bda62ed8b3df4b9ec4cf010e4654067ef04aab2fcdd597c647","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-01T12:45:16Z","title_canon_sha256":"451988c8ba5b1b2d89712dc37a92bad4fa2d12069da7fa0680c69a6f0a83eca2"},"schema_version":"1.0","source":{"id":"1410.0205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0205","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0205v1","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0205","created_at":"2026-05-18T02:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"EVBKLNROD2RT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EVBKLNROD2RT64XI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EVBKLNRO","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:addfe1891d72df955fc34c338261e3198e38e04f57125385c66d834cbd14f6c9","target":"graph","created_at":"2026-05-18T02:41:17Z","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":"Computing cost optimal paths in network data is a very important task in many application areas like transportation networks, computer networks or social graphs. In many cases, the cost of an edge can be described by various cost criteria. For example, in a road network possible cost criteria are distance, time, ascent, energy consumption or toll fees. In such a multicriteria network, a route or path skyline query computes the set of all paths having pareto optimal costs, i.e. each result path is optimal for different user preferences. In this paper, we propose a new method for computing route","authors_text":"Gregor Joss\\'e, Matthias Schubert, Michael Shekelyan","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-01T12:45:16Z","title":"ParetoPrep: Fast computation of Path Skylines Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0205","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:22e704e1c1ff668e759b7badb2d5d1008606dc10e1ca264cb54400ba33220c77","target":"record","created_at":"2026-05-18T02:41:17Z","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":"7a001b0a615140bda62ed8b3df4b9ec4cf010e4654067ef04aab2fcdd597c647","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-10-01T12:45:16Z","title_canon_sha256":"451988c8ba5b1b2d89712dc37a92bad4fa2d12069da7fa0680c69a6f0a83eca2"},"schema_version":"1.0","source":{"id":"1410.0205","kind":"arxiv","version":1}},"canonical_sha256":"2542a5b62e1ea33f72e8538d9fcbbe9fa260c2d0d6185da64480f479e4ef58dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2542a5b62e1ea33f72e8538d9fcbbe9fa260c2d0d6185da64480f479e4ef58dd","first_computed_at":"2026-05-18T02:41:17.782754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:17.782754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JoHHte/6//soeWPyBc8TbUsNwZ6blQLRFUBE3f0aloDNYiIRu4846Lzxq19THgQ5IQ3W3XxdMdIm4yFNnp+HDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:17.783377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22e704e1c1ff668e759b7badb2d5d1008606dc10e1ca264cb54400ba33220c77","sha256:addfe1891d72df955fc34c338261e3198e38e04f57125385c66d834cbd14f6c9"],"state_sha256":"2ca1c0aa7df1b8fb4c0edf371704504671bcc8b6355b9497c08e6ec8293e545b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa6jtFSePTYUIs7qHBEG4AKI9QxiyEoh3EMdcfIYyuER3OcJ+3fgqiSFKZzLvpjzJTkoIec2YqL16UFoMC93BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:51:31.073482Z","bundle_sha256":"c437585b7ca11bb099550d01e92b1d18a19e61865df1e063845bcd0df9e317b5"}}