{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JJ2XIF33TKGVDH3AP25PJ735BE","short_pith_number":"pith:JJ2XIF33","schema_version":"1.0","canonical_sha256":"4a7574177b9a8d519f607ebaf4ff7d090af130d38529f0d150c105c61f0f462e","source":{"kind":"arxiv","id":"1708.09013","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.09013","created_at":"2026-05-18T00:36:21.351027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09013v1","created_at":"2026-05-18T00:36:21.351027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09013","created_at":"2026-05-18T00:36:21.351027+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJ2XIF33TKGV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJ2XIF33TKGVDH3A","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJ2XIF33","created_at":"2026-05-18T12:31:24.725408+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/JJ2XIF33TKGVDH3AP25PJ735BE","json":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE.json","graph_json":"https://pith.science/api/pith-number/JJ2XIF33TKGVDH3AP25PJ735BE/graph.json","events_json":"https://pith.science/api/pith-number/JJ2XIF33TKGVDH3AP25PJ735BE/events.json","paper":"https://pith.science/paper/JJ2XIF33"},"agent_actions":{"view_html":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE","download_json":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE.json","view_paper":"https://pith.science/paper/JJ2XIF33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09013&json=true","fetch_graph":"https://pith.science/api/pith-number/JJ2XIF33TKGVDH3AP25PJ735BE/graph.json","fetch_events":"https://pith.science/api/pith-number/JJ2XIF33TKGVDH3AP25PJ735BE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/action/storage_attestation","attest_author":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/action/author_attestation","sign_citation":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/action/citation_signature","submit_replication":"https://pith.science/pith/JJ2XIF33TKGVDH3AP25PJ735BE/action/replication_record"}},"created_at":"2026-05-18T00:36:21.351027+00:00","updated_at":"2026-05-18T00:36:21.351027+00:00"}