{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XANLNOI7NPZTLNO2WJNCTZDM5Z","short_pith_number":"pith:XANLNOI7","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"},"canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","source":{"kind":"arxiv","id":"2411.16667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16667","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16667v2","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16667","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"XANLNOI7NPZT","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"XANLNOI7NPZTLNO2","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"XANLNOI7","created_at":"2026-07-05T10:49:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XANLNOI7NPZTLNO2WJNCTZDM5Z","target":"record","payload":{"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"},"canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","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"},"source_kind":"arxiv","source_id":"2411.16667","source_version":2,"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-07-05T10:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V70xblNA86jFR9Jcsxs1ULp2SCm7n1hHjvoKzz+ULxCl6SHT1wdBEun1I7Zxu+y1x5n57w6mVVnYIpc6KaOQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:53:58.357266Z"},"content_sha256":"f3db2aa3900f17c0fc3ce4384dfce6291e284e90adb2512fcdc92df19b5a041d","schema_version":"1.0","event_id":"sha256:f3db2aa3900f17c0fc3ce4384dfce6291e284e90adb2512fcdc92df19b5a041d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XANLNOI7NPZTLNO2WJNCTZDM5Z","target":"graph","payload":{"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"},"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-07-05T10:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ISWXzbXVud9YxL/fxI5pc79OV6J6zPgZY7zHUNXIwEhQ5peQja+VutaToAcgYbCuT3eqasCLcZEug0HB0MjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:53:58.357817Z"},"content_sha256":"7319a76c17c26139437912eb6937b4243d1194a30013e947eac57041bcc3f2f5","schema_version":"1.0","event_id":"sha256:7319a76c17c26139437912eb6937b4243d1194a30013e947eac57041bcc3f2f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/bundle.json","state_url":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/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-08-13T01:53:58Z","links":{"resolver":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z","bundle":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/bundle.json","state":"https://pith.science/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XANLNOI7NPZTLNO2WJNCTZDM5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XANLNOI7NPZTLNO2WJNCTZDM5Z","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":"89906b74f5f0a98f419461c7897d650664483eb8a1f30269cf2457d42be48cec","cross_cats_sorted":["cs.AI","cs.AR","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-25T18:53:49Z","title_canon_sha256":"a2b7e062beca5bcba58d4485adff6d642ad721430b9f8c9ea11e64d25a9a687d"},"schema_version":"1.0","source":{"id":"2411.16667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16667","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16667v2","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16667","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"XANLNOI7NPZT","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"XANLNOI7NPZTLNO2","created_at":"2026-07-05T10:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"XANLNOI7","created_at":"2026-07-05T10:49:11Z"}],"graph_snapshots":[{"event_id":"sha256:7319a76c17c26139437912eb6937b4243d1194a30013e947eac57041bcc3f2f5","target":"graph","created_at":"2026-07-05T10:49:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16667/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Adam Bienkowski, David Sidoti, Krishna Pattipati, Leo Gold, Omer Khan","cross_cats":["cs.AI","cs.AR","cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16667","kind":"arxiv","version":2},"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:f3db2aa3900f17c0fc3ce4384dfce6291e284e90adb2512fcdc92df19b5a041d","target":"record","created_at":"2026-07-05T10:49:11Z","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":"89906b74f5f0a98f419461c7897d650664483eb8a1f30269cf2457d42be48cec","cross_cats_sorted":["cs.AI","cs.AR","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-25T18:53:49Z","title_canon_sha256":"a2b7e062beca5bcba58d4485adff6d642ad721430b9f8c9ea11e64d25a9a687d"},"schema_version":"1.0","source":{"id":"2411.16667","kind":"arxiv","version":2}},"canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b81ab6b91f6bf335b5dab25a29e46cee497ab2060500881ad89d0a2f583beb1e","first_computed_at":"2026-07-05T10:49:11.372671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:11.372671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cUb/6FjHdtsh4Wz30EsU/9gvSmISjhONKJP7FIXhAa44NXIwJcJwScE0crwYhsiSGHJEodlsotG9IX0JlnNyDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:11.373088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3db2aa3900f17c0fc3ce4384dfce6291e284e90adb2512fcdc92df19b5a041d","sha256:7319a76c17c26139437912eb6937b4243d1194a30013e947eac57041bcc3f2f5"],"state_sha256":"2822d39e36cbc3a8feb54912f8bdc29a0c416e5f82ac19b682ed2eb45f96e03c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSWMDQ0DdfEaoTZsLSCUrqAyZR6kxj8EN3ytMMLECxZeLJ3EN9l3To1xkJ+AvaRF0wjS1Lw3zIuAHyb2woPdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:53:58.363270Z","bundle_sha256":"ff9ca2084e990b1e0fc68fa91d33a15ec337248aa8fef23afc24826cac54cbb6"}}