{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XANLNOI7NPZTLNO2WJNCTZDM5Z","short_pith_number":"pith:XANLNOI7","schema_version":"1.0","canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","source":{"kind":"arxiv","id":"2411.16667","version":2},"attestation_state":"computed","paper":{"title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR","cs.DS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Adam Bienkowski, David Sidoti, Krishna Pattipati, Leo Gold, Omer Khan","submitted_at":"2024-11-25T18:53:49Z","abstract_excerpt":"The Multi-Objective Shortest-Path (MOS) problem finds a set of Pareto-optimal solutions from a start node to a destination node in a multi-attribute graph. The literature explores multi-objective A*-style algorithmic approaches to solving the NP-hard MOS problem. These approaches use consistent heuristics to compute an exact set of solutions for the goal node. A generalized MOS algorithm maintains a \"frontier\" of partial paths at each node and performs ordered processing to ensure that Pareto-optimal paths are generated to reach the goal node. The algorithm becomes computationally intractable "},"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":"2411.16667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-25T18:53:49Z","cross_cats_sorted":["cs.AI","cs.AR","cs.DS","cs.PF"],"title_canon_sha256":"a2b7e062beca5bcba58d4485adff6d642ad721430b9f8c9ea11e64d25a9a687d","abstract_canon_sha256":"89906b74f5f0a98f419461c7897d650664483eb8a1f30269cf2457d42be48cec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:11.373088Z","signature_b64":"cUb/6FjHdtsh4Wz30EsU/9gvSmISjhONKJP7FIXhAa44NXIwJcJwScE0crwYhsiSGHJEodlsotG9IX0JlnNyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","last_reissued_at":"2026-07-05T10:49:11.372671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:11.372671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.AR","cs.DS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Adam Bienkowski, David Sidoti, Krishna Pattipati, Leo Gold, Omer Khan","submitted_at":"2024-11-25T18:53:49Z","abstract_excerpt":"The Multi-Objective Shortest-Path (MOS) problem finds a set of Pareto-optimal solutions from a start node to a destination node in a multi-attribute graph. The literature explores multi-objective A*-style algorithmic approaches to solving the NP-hard MOS problem. These approaches use consistent heuristics to compute an exact set of solutions for the goal node. A generalized MOS algorithm maintains a \"frontier\" of partial paths at each node and performs ordered processing to ensure that Pareto-optimal paths are generated to reach the goal node. The algorithm becomes computationally intractable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16667","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/2411.16667/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":"2411.16667","created_at":"2026-07-05T10:49:11.372729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16667v2","created_at":"2026-07-05T10:49:11.372729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16667","created_at":"2026-07-05T10:49:11.372729+00:00"},{"alias_kind":"pith_short_12","alias_value":"XANLNOI7NPZT","created_at":"2026-07-05T10:49:11.372729+00:00"},{"alias_kind":"pith_short_16","alias_value":"XANLNOI7NPZTLNO2","created_at":"2026-07-05T10:49:11.372729+00:00"},{"alias_kind":"pith_short_8","alias_value":"XANLNOI7","created_at":"2026-07-05T10:49:11.372729+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/XANLNOI7NPZTLNO2WJNCTZDM5Z","json":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z.json","graph_json":"https://pith.science/api/pith-number/XANLNOI7NPZTLNO2WJNCTZDM5Z/graph.json","events_json":"https://pith.science/api/pith-number/XANLNOI7NPZTLNO2WJNCTZDM5Z/events.json","paper":"https://pith.science/paper/XANLNOI7"},"agent_actions":{"view_html":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z","download_json":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z.json","view_paper":"https://pith.science/paper/XANLNOI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16667&json=true","fetch_graph":"https://pith.science/api/pith-number/XANLNOI7NPZTLNO2WJNCTZDM5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/XANLNOI7NPZTLNO2WJNCTZDM5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/action/storage_attestation","attest_author":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/action/author_attestation","sign_citation":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/action/citation_signature","submit_replication":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/action/replication_record"}},"created_at":"2026-07-05T10:49:11.372729+00:00","updated_at":"2026-07-05T10:49:11.372729+00:00"}