{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JJ2XIF33TKGVDH3AP25PJ735BE","short_pith_number":"pith:JJ2XIF33","canonical_record":{"source":{"id":"1708.09013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-29T20:28:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"917ded11eaf014a85a580658a83f717d71c1a740794d50d33a5d10582371013e","abstract_canon_sha256":"6cb5297576d0c75a1fd1d0fd6126b8e4fe9b421e2beb56fac072752104f3f41e"},"schema_version":"1.0"},"canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","source":{"kind":"arxiv","id":"1708.09013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09013","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09013v1","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09013","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2XIF33TKGV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2XIF33TKGVDH3A","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2XIF33","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JJ2XIF33TKGVDH3AP25PJ735BE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-29T20:28:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"917ded11eaf014a85a580658a83f717d71c1a740794d50d33a5d10582371013e","abstract_canon_sha256":"6cb5297576d0c75a1fd1d0fd6126b8e4fe9b421e2beb56fac072752104f3f41e"},"schema_version":"1.0"},"canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:21.351618Z","signature_b64":"0mMvI14s/YxA+fe49an6aiBsJI6UdIMeysMfu5H4XME6WoF6w83jgV7RRrr8dyAtA/MPGs7Buu91ic2GZjOoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","last_reissued_at":"2026-05-18T00:36:21.350931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:21.350931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09013","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6io9tlqDE0enIcssRifJHbQEMVtx+fO8hEeOXKdoH5nT7DhrIlcovQGLNhhRArqZlGqDu0UilA9z72JtYpkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:01:14.962334Z"},"content_sha256":"f1e448729894a4d9dd714e1bcaa1547ac32dcfd02ac82245c73afdc134963b3f","schema_version":"1.0","event_id":"sha256:f1e448729894a4d9dd714e1bcaa1547ac32dcfd02ac82245c73afdc134963b3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JJ2XIF33TKGVDH3AP25PJ735BE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Security Policies in Multi-agent Workflows with Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Christian M\\\"uller, Eugen Z\\u{a}linescu, Helmut Seidl","submitted_at":"2017-08-29T20:28:13Z","abstract_excerpt":"We consider the automatic verification of information flow security policies of web-based workflows, such as conference submission systems like EasyChair. Our workflow description language allows for loops, non-deterministic choice, and an unbounded number of participating agents. The information flow policies are specified in a temporal logic for hyperproperties. We show that the verification problem can be reduced to the satisfiability of a formula of first-order linear-time temporal logic, and provide decidability results for relevant classes of workflows and specifications. We report on ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09013","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QQv3EYYjOpitpfXcwv1fHO8lETpS6aKfbptOSKzQ9Ojj8eojgFcB1biXXiWY3dCIESmm8SxpNxrVawoSxNRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:01:14.962676Z"},"content_sha256":"d283b9d7e74a818d40852b653aaacac6052949bd4df167c80899b4692a9d5120","schema_version":"1.0","event_id":"sha256:d283b9d7e74a818d40852b653aaacac6052949bd4df167c80899b4692a9d5120"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/bundle.json","state_url":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ2XIF33TKGVDH3AP25PJ735BE/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-06-25T23:01:14Z","links":{"resolver":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE","bundle":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/bundle.json","state":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ2XIF33TKGVDH3AP25PJ735BE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JJ2XIF33TKGVDH3AP25PJ735BE","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":"6cb5297576d0c75a1fd1d0fd6126b8e4fe9b421e2beb56fac072752104f3f41e","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-29T20:28:13Z","title_canon_sha256":"917ded11eaf014a85a580658a83f717d71c1a740794d50d33a5d10582371013e"},"schema_version":"1.0","source":{"id":"1708.09013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09013","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09013v1","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09013","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"JJ2XIF33TKGV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JJ2XIF33TKGVDH3A","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JJ2XIF33","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:d283b9d7e74a818d40852b653aaacac6052949bd4df167c80899b4692a9d5120","target":"graph","created_at":"2026-05-18T00:36:21Z","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":"We consider the automatic verification of information flow security policies of web-based workflows, such as conference submission systems like EasyChair. Our workflow description language allows for loops, non-deterministic choice, and an unbounded number of participating agents. The information flow policies are specified in a temporal logic for hyperproperties. We show that the verification problem can be reduced to the satisfiability of a formula of first-order linear-time temporal logic, and provide decidability results for relevant classes of workflows and specifications. We report on ex","authors_text":"Bernd Finkbeiner, Christian M\\\"uller, Eugen Z\\u{a}linescu, Helmut Seidl","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-29T20:28:13Z","title":"Verifying Security Policies in Multi-agent Workflows with Loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09013","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:f1e448729894a4d9dd714e1bcaa1547ac32dcfd02ac82245c73afdc134963b3f","target":"record","created_at":"2026-05-18T00:36:21Z","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":"6cb5297576d0c75a1fd1d0fd6126b8e4fe9b421e2beb56fac072752104f3f41e","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-29T20:28:13Z","title_canon_sha256":"917ded11eaf014a85a580658a83f717d71c1a740794d50d33a5d10582371013e"},"schema_version":"1.0","source":{"id":"1708.09013","kind":"arxiv","version":1}},"canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","first_computed_at":"2026-05-18T00:36:21.350931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:21.350931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0mMvI14s/YxA+fe49an6aiBsJI6UdIMeysMfu5H4XME6WoF6w83jgV7RRrr8dyAtA/MPGs7Buu91ic2GZjOoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:21.351618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1e448729894a4d9dd714e1bcaa1547ac32dcfd02ac82245c73afdc134963b3f","sha256:d283b9d7e74a818d40852b653aaacac6052949bd4df167c80899b4692a9d5120"],"state_sha256":"1eb0b66d955932497360d2d05bba41f9dd142ec709e82533ccba28267b80e05f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYKcu8K3izwt5A/TQjqFBodQ8klUgNrtCx+r6V5s0vUR5Izge5y/c74beAnPCwn/+Q1fw45gIvgP3jNTAfLQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:01:14.964789Z","bundle_sha256":"37f7e6c34afd19a69435862f9e45f97042e1e8c4f6ec844219e36b039f8b3f2e"}}