{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZJEUGIFKTJTMZU73EQFZMSQQOF","short_pith_number":"pith:ZJEUGIFK","canonical_record":{"source":{"id":"1707.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-13T16:07:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"80af283fee38fef5ab5f5d364c167c26b262dc5a8ce704fa8dbc1c8eb931c32e","abstract_canon_sha256":"4817f1c9fffa5ee763e724ff9fd9acb0640bc170f2df6588aa911e58feae2986"},"schema_version":"1.0"},"canonical_sha256":"ca494320aa9a66ccd3fb240b964a10715ea555b79bef9d3063d766d867e2b859","source":{"kind":"arxiv","id":"1707.05383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05383","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05383v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05383","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZJEUGIFKTJTM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJEUGIFKTJTMZU73","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJEUGIFK","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZJEUGIFKTJTMZU73EQFZMSQQOF","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-13T16:07:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"80af283fee38fef5ab5f5d364c167c26b262dc5a8ce704fa8dbc1c8eb931c32e","abstract_canon_sha256":"4817f1c9fffa5ee763e724ff9fd9acb0640bc170f2df6588aa911e58feae2986"},"schema_version":"1.0"},"canonical_sha256":"ca494320aa9a66ccd3fb240b964a10715ea555b79bef9d3063d766d867e2b859","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.508805Z","signature_b64":"wkna+jIHNhNutUtOZ6WERQcGUXLEIR4SdiIxBNw0EY5nO/xuZ4TBhbuWfb1gxbUXxaKE6Lvoyz5S/oSDcG1nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca494320aa9a66ccd3fb240b964a10715ea555b79bef9d3063d766d867e2b859","last_reissued_at":"2026-05-18T00:40:02.508274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.508274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05383","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-05-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAxjPmtiuVCKBsXO+6Fx+VveZDPR/Xh7+kqG61j9c6gHaAyy+OTJcsNqq65xYO0bMzy77lbcdMJy3jlc7OPYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:28.855769Z"},"content_sha256":"d73e61655bb8099dd5005fc6d88b1a04773212f741a11141cb35fcf11db1b823","schema_version":"1.0","event_id":"sha256:d73e61655bb8099dd5005fc6d88b1a04773212f741a11141cb35fcf11db1b823"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZJEUGIFKTJTMZU73EQFZMSQQOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Flexible Approach for Finding Optimal Paths with Minimal Conflicts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.SE","authors_text":"Juliana Bowles, Marco B. Caminati","submitted_at":"2017-07-13T16:07:38Z","abstract_excerpt":"Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue that in some cases it is impossible to guarantee total consistency, and instead we want to find execution paths across such models with minimal conflicts with respect to a certain metric of interest. We present an efficient and scalable solution to fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05383","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"},"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-05-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXW0+e5rM7BVH1AjFE4X8Bf1Z5dXvmK5VEgFOZhyUh3sgDb50G4NdImwfr2L/OvKGxDaFTAKKcPC7dc907sqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:39:28.856473Z"},"content_sha256":"b50377f8f9efc3bdea1d4eef60c5817a5f9968b7383df8e37066d8ab05a2d009","schema_version":"1.0","event_id":"sha256:b50377f8f9efc3bdea1d4eef60c5817a5f9968b7383df8e37066d8ab05a2d009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/bundle.json","state_url":"https://pith.science/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/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-05-27T14:39:28Z","links":{"resolver":"https://pith.science/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF","bundle":"https://pith.science/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/bundle.json","state":"https://pith.science/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJEUGIFKTJTMZU73EQFZMSQQOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZJEUGIFKTJTMZU73EQFZMSQQOF","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":"4817f1c9fffa5ee763e724ff9fd9acb0640bc170f2df6588aa911e58feae2986","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-13T16:07:38Z","title_canon_sha256":"80af283fee38fef5ab5f5d364c167c26b262dc5a8ce704fa8dbc1c8eb931c32e"},"schema_version":"1.0","source":{"id":"1707.05383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05383","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05383v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05383","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZJEUGIFKTJTM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJEUGIFKTJTMZU73","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJEUGIFK","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:b50377f8f9efc3bdea1d4eef60c5817a5f9968b7383df8e37066d8ab05a2d009","target":"graph","created_at":"2026-05-18T00:40:02Z","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"},"paper":{"abstract_excerpt":"Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue that in some cases it is impossible to guarantee total consistency, and instead we want to find execution paths across such models with minimal conflicts with respect to a certain metric of interest. We present an efficient and scalable solution to fin","authors_text":"Juliana Bowles, Marco B. Caminati","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-13T16:07:38Z","title":"A Flexible Approach for Finding Optimal Paths with Minimal Conflicts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05383","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:d73e61655bb8099dd5005fc6d88b1a04773212f741a11141cb35fcf11db1b823","target":"record","created_at":"2026-05-18T00:40:02Z","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":"4817f1c9fffa5ee763e724ff9fd9acb0640bc170f2df6588aa911e58feae2986","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-07-13T16:07:38Z","title_canon_sha256":"80af283fee38fef5ab5f5d364c167c26b262dc5a8ce704fa8dbc1c8eb931c32e"},"schema_version":"1.0","source":{"id":"1707.05383","kind":"arxiv","version":1}},"canonical_sha256":"ca494320aa9a66ccd3fb240b964a10715ea555b79bef9d3063d766d867e2b859","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca494320aa9a66ccd3fb240b964a10715ea555b79bef9d3063d766d867e2b859","first_computed_at":"2026-05-18T00:40:02.508274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.508274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wkna+jIHNhNutUtOZ6WERQcGUXLEIR4SdiIxBNw0EY5nO/xuZ4TBhbuWfb1gxbUXxaKE6Lvoyz5S/oSDcG1nAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.508805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d73e61655bb8099dd5005fc6d88b1a04773212f741a11141cb35fcf11db1b823","sha256:b50377f8f9efc3bdea1d4eef60c5817a5f9968b7383df8e37066d8ab05a2d009"],"state_sha256":"01724126d62c59c185d969d3aa1573d50778f61ccd5fbdc6a4708228dce76eb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg3QQ/GCLAD0cTPB5qse+y38dTYQUDkGWvjPDfk/JbexbGrpsnlKxBQPH3GMmQ0fMakjSVMCDWMDB7wY80IgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:39:28.860342Z","bundle_sha256":"ea1a673a3a7474bd5ef4f94fac76c0b125638ecbdf0931c5c5a4c3c600035fa8"}}