{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IIRAJBS7C4Q5ZEBYRBOJD7HX7U","short_pith_number":"pith:IIRAJBS7","schema_version":"1.0","canonical_sha256":"422204865f1721dc9038885c91fcf7fd1cbd6868b1e1d57dbeabd3a0587747ff","source":{"kind":"arxiv","id":"2006.10302","version":2},"attestation_state":"computed","paper":{"title":"Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Salzman","submitted_at":"2020-06-18T06:39:11Z","abstract_excerpt":"We consider the bi-criteria shortest-path problem where we want to compute shortest paths on a graph that simultaneously balance two cost functions. While this problem has numerous applications, there is usually no path minimizing both cost functions simultaneously. Thus, we typically consider the set of paths where no path is strictly better then the others in both cost functions, a set called the Pareto-optimal frontier. Unfortunately, the size of this set may be exponential in the number of graph vertices and the general problem is NP-hard. While existing schemes to approximate this set exi"},"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":"2006.10302","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-18T06:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"ebba9c89baff879be2153683553a92a3f2ea71051304adb29a383eca5af1d290","abstract_canon_sha256":"662974b582ee3eccf54d1581fa6f7078af195b31b23228ba3fd601148043c4d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:28.763447Z","signature_b64":"NeWYWOXGECd/cmAeaHb4zs2hSgJ6YzTWYG4SGiDCRVnKz6drRi0HMmvzH5N7vDujyv0MNwvTm+3HjS83YIXADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422204865f1721dc9038885c91fcf7fd1cbd6868b1e1d57dbeabd3a0587747ff","last_reissued_at":"2026-07-05T02:20:28.763092Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:28.763092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Oren Salzman","submitted_at":"2020-06-18T06:39:11Z","abstract_excerpt":"We consider the bi-criteria shortest-path problem where we want to compute shortest paths on a graph that simultaneously balance two cost functions. While this problem has numerous applications, there is usually no path minimizing both cost functions simultaneously. Thus, we typically consider the set of paths where no path is strictly better then the others in both cost functions, a set called the Pareto-optimal frontier. Unfortunately, the size of this set may be exponential in the number of graph vertices and the general problem is NP-hard. While existing schemes to approximate this set exi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.10302/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.10302","created_at":"2026-07-05T02:20:28.763146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.10302v2","created_at":"2026-07-05T02:20:28.763146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10302","created_at":"2026-07-05T02:20:28.763146+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIRAJBS7C4Q5","created_at":"2026-07-05T02:20:28.763146+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIRAJBS7C4Q5ZEBY","created_at":"2026-07-05T02:20:28.763146+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIRAJBS7","created_at":"2026-07-05T02:20:28.763146+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/IIRAJBS7C4Q5ZEBYRBOJD7HX7U","json":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U.json","graph_json":"https://pith.science/api/pith-number/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/graph.json","events_json":"https://pith.science/api/pith-number/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/events.json","paper":"https://pith.science/paper/IIRAJBS7"},"agent_actions":{"view_html":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U","download_json":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U.json","view_paper":"https://pith.science/paper/IIRAJBS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.10302&json=true","fetch_graph":"https://pith.science/api/pith-number/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/graph.json","fetch_events":"https://pith.science/api/pith-number/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/action/storage_attestation","attest_author":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/action/author_attestation","sign_citation":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/action/citation_signature","submit_replication":"https://pith.science/pith/IIRAJBS7C4Q5ZEBYRBOJD7HX7U/action/replication_record"}},"created_at":"2026-07-05T02:20:28.763146+00:00","updated_at":"2026-07-05T02:20:28.763146+00:00"}