{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BO3C6TXUF3JYYTEF5XI7VIUAW6","short_pith_number":"pith:BO3C6TXU","schema_version":"1.0","canonical_sha256":"0bb62f4ef42ed38c4c85edd1faa280b787662aae296724274f49189a52200454","source":{"kind":"arxiv","id":"1604.08147","version":1},"attestation_state":"computed","paper":{"title":"Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Fritz B\\\"okler, Petra Mutzel","submitted_at":"2016-04-27T17:11:09Z","abstract_excerpt":"In this paper, we re-evaluate the basic strategies for label correcting algorithms for the multiobjective shortest path (MOSP) problem, i.e., node and label selection. In contrast to common believe, we show that---when carefully implemented---the node-selection strategy usually beats the label-selection strategy. Moreover, we present a new pruning method which is easy to implement and performs very well on real-world road networks. In this study, we test our hypotheses on artificial MOSP instances from the literature with up to 15 objectives and real-world road networks with up to almost 160,0"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.08147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T17:11:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"092422cd76f525782debb729a9157651b59fd41857c9308df7974e9f00486af6","abstract_canon_sha256":"9f3da31b6adbabe58392868405414782b3ac0feade793ce214f466f9304831d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:07.977498Z","signature_b64":"IrLPDvtGDBNyzy1na8tRIuD+jmi1F9VFpOfZac5PQFVGK3Ridj5RUVmPGELIJaF1Gy+fkkoYi0dp4fBiLB3EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb62f4ef42ed38c4c85edd1faa280b787662aae296724274f49189a52200454","last_reissued_at":"2026-05-18T01:16:07.976789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:07.976789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Fritz B\\\"okler, Petra Mutzel","submitted_at":"2016-04-27T17:11:09Z","abstract_excerpt":"In this paper, we re-evaluate the basic strategies for label correcting algorithms for the multiobjective shortest path (MOSP) problem, i.e., node and label selection. In contrast to common believe, we show that---when carefully implemented---the node-selection strategy usually beats the label-selection strategy. Moreover, we present a new pruning method which is easy to implement and performs very well on real-world road networks. In this study, we test our hypotheses on artificial MOSP instances from the literature with up to 15 objectives and real-world road networks with up to almost 160,0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08147","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08147","created_at":"2026-05-18T01:16:07.976896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08147v1","created_at":"2026-05-18T01:16:07.976896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08147","created_at":"2026-05-18T01:16:07.976896+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO3C6TXUF3JY","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO3C6TXUF3JYYTEF","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO3C6TXU","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6","json":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6.json","graph_json":"https://pith.science/api/pith-number/BO3C6TXUF3JYYTEF5XI7VIUAW6/graph.json","events_json":"https://pith.science/api/pith-number/BO3C6TXUF3JYYTEF5XI7VIUAW6/events.json","paper":"https://pith.science/paper/BO3C6TXU"},"agent_actions":{"view_html":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6","download_json":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6.json","view_paper":"https://pith.science/paper/BO3C6TXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08147&json=true","fetch_graph":"https://pith.science/api/pith-number/BO3C6TXUF3JYYTEF5XI7VIUAW6/graph.json","fetch_events":"https://pith.science/api/pith-number/BO3C6TXUF3JYYTEF5XI7VIUAW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6/action/storage_attestation","attest_author":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6/action/author_attestation","sign_citation":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6/action/citation_signature","submit_replication":"https://pith.science/pith/BO3C6TXUF3JYYTEF5XI7VIUAW6/action/replication_record"}},"created_at":"2026-05-18T01:16:07.976896+00:00","updated_at":"2026-05-18T01:16:07.976896+00:00"}