{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7RPRJ3QBAU2BVUUGHS2UJNYMLR","short_pith_number":"pith:7RPRJ3QB","canonical_record":{"source":{"id":"2506.03326","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-03T19:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"75f17e16cd3fa997830bf639522fcc39a13f7e386c5dd60c40c00c846f47497f","abstract_canon_sha256":"585342f299ac20fd93fc580598b1fc9f181b5ce0817e9e4f5dd4db119bb28598"},"schema_version":"1.0"},"canonical_sha256":"fc5f14ee0105341ad2863cb544b70c5c64a4c81650dead90349a28f650753d52","source":{"kind":"arxiv","id":"2506.03326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03326","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03326v1","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03326","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"7RPRJ3QBAU2B","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"7RPRJ3QBAU2BVUUG","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"7RPRJ3QB","created_at":"2026-07-05T11:15:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7RPRJ3QBAU2BVUUGHS2UJNYMLR","target":"record","payload":{"canonical_record":{"source":{"id":"2506.03326","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-03T19:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"75f17e16cd3fa997830bf639522fcc39a13f7e386c5dd60c40c00c846f47497f","abstract_canon_sha256":"585342f299ac20fd93fc580598b1fc9f181b5ce0817e9e4f5dd4db119bb28598"},"schema_version":"1.0"},"canonical_sha256":"fc5f14ee0105341ad2863cb544b70c5c64a4c81650dead90349a28f650753d52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:25.220746Z","signature_b64":"hHCCJgx35Dft62jwBbypvDljlxWU3jaFHdKmIFPbDt0qyUa02oA+m7zTbHTmmKvGeIX4PMxXVX+ZXU6kraQdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5f14ee0105341ad2863cb544b70c5c64a4c81650dead90349a28f650753d52","last_reissued_at":"2026-07-05T11:15:25.220275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:25.220275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.03326","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-07-05T11:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D06II2GDSbTUGBaAfAXZO8KlV/gsjOwWeLBHHMekHohzZaTQ706i0lie44WyW6bR6Pmxg/ceQnDc56vFg626AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:48:58.522899Z"},"content_sha256":"4b5b9927b88dbca6d9028db1fdb2ad42a15141e8cf54e837724a3758d119ba2d","schema_version":"1.0","event_id":"sha256:4b5b9927b88dbca6d9028db1fdb2ad42a15141e8cf54e837724a3758d119ba2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7RPRJ3QBAU2BVUUGHS2UJNYMLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Derek H. Smith, Roberto Montemanni","submitted_at":"2025-06-03T19:16:32Z","abstract_excerpt":"A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neither or both of the arcs are selected. This configures a set of soft-constraints. The problem, which can be used to model real applications, looks for a path from a given origin to a given destination that minimizes the cost of the arcs traversed plus the penalties incurred. In this paper, we consider a compact mixed integer linear program representing the problem and we solve it with the open-source solver CP-SAT, par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03326","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03326/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-05T11:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFQG4CVYF7g8CCeeRk0BLGZ9LPS0Eeft57xVATGNGzCGbGUR0qio9XXPpaGl5616x2x/NrrlDYLiZUxOBSZgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:48:58.523395Z"},"content_sha256":"1889812e626137babe479efddaf67978011d9c9c92717b70fb445213ada5ddb2","schema_version":"1.0","event_id":"sha256:1889812e626137babe479efddaf67978011d9c9c92717b70fb445213ada5ddb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/bundle.json","state_url":"https://pith.science/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/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-07T23:48:58Z","links":{"resolver":"https://pith.science/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR","bundle":"https://pith.science/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/bundle.json","state":"https://pith.science/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RPRJ3QBAU2BVUUGHS2UJNYMLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7RPRJ3QBAU2BVUUGHS2UJNYMLR","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":"585342f299ac20fd93fc580598b1fc9f181b5ce0817e9e4f5dd4db119bb28598","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-03T19:16:32Z","title_canon_sha256":"75f17e16cd3fa997830bf639522fcc39a13f7e386c5dd60c40c00c846f47497f"},"schema_version":"1.0","source":{"id":"2506.03326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03326","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03326v1","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03326","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"7RPRJ3QBAU2B","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"7RPRJ3QBAU2BVUUG","created_at":"2026-07-05T11:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"7RPRJ3QB","created_at":"2026-07-05T11:15:25Z"}],"graph_snapshots":[{"event_id":"sha256:1889812e626137babe479efddaf67978011d9c9c92717b70fb445213ada5ddb2","target":"graph","created_at":"2026-07-05T11:15:25Z","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/2506.03326/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neither or both of the arcs are selected. This configures a set of soft-constraints. The problem, which can be used to model real applications, looks for a path from a given origin to a given destination that minimizes the cost of the arcs traversed plus the penalties incurred. In this paper, we consider a compact mixed integer linear program representing the problem and we solve it with the open-source solver CP-SAT, par","authors_text":"Derek H. Smith, Roberto Montemanni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-03T19:16:32Z","title":"On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03326","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:4b5b9927b88dbca6d9028db1fdb2ad42a15141e8cf54e837724a3758d119ba2d","target":"record","created_at":"2026-07-05T11:15:25Z","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":"585342f299ac20fd93fc580598b1fc9f181b5ce0817e9e4f5dd4db119bb28598","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-03T19:16:32Z","title_canon_sha256":"75f17e16cd3fa997830bf639522fcc39a13f7e386c5dd60c40c00c846f47497f"},"schema_version":"1.0","source":{"id":"2506.03326","kind":"arxiv","version":1}},"canonical_sha256":"fc5f14ee0105341ad2863cb544b70c5c64a4c81650dead90349a28f650753d52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc5f14ee0105341ad2863cb544b70c5c64a4c81650dead90349a28f650753d52","first_computed_at":"2026-07-05T11:15:25.220275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:25.220275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hHCCJgx35Dft62jwBbypvDljlxWU3jaFHdKmIFPbDt0qyUa02oA+m7zTbHTmmKvGeIX4PMxXVX+ZXU6kraQdCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:25.220746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b5b9927b88dbca6d9028db1fdb2ad42a15141e8cf54e837724a3758d119ba2d","sha256:1889812e626137babe479efddaf67978011d9c9c92717b70fb445213ada5ddb2"],"state_sha256":"d934d60d49fc0c04398e47f66a8fa1add6298f1800ecbd89e52219d6ea842431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zuSSuzItiL7N0yMMEP6XxOEgl5LX+M4ajGZ5SLEp/k3NnjL364mJAJEtls/LldWjdMbLa2/8mnJxdIeIcfTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:48:58.528344Z","bundle_sha256":"7e69370cdaed7481d702d4ed12c51e3a80e6c68abfcb0b8ad7792219294a648a"}}