{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AXCZEO7OFN6P35CFYMSS6ZJMFC","short_pith_number":"pith:AXCZEO7O","schema_version":"1.0","canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","source":{"kind":"arxiv","id":"1308.1204","version":1},"attestation_state":"computed","paper":{"title":"Complexity and Unwinding for Intransitive Noninterference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Henning Schnoor, Ron van der Meyden, Sebastian Eggert, Thomas Wilke","submitted_at":"2013-08-06T08:31:44Z","abstract_excerpt":"The paper considers several definitions of information flow security for intransitive policies from the point of view of the complexity of verifying whether a finite-state system is secure. The results are as follows. Checking (i) P-security (Goguen and Meseguer), (ii) IP-security (Haigh and Young), and (iii) TA-security (van der Meyden) are all in PTIME, while checking TO-security (van der Meyden) is undecidable, as is checking ITO-security (van der Meyden). The most important ingredients in the proofs of the PTIME upper bounds are new characterizations of the respective security notions, whi"},"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":"1308.1204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-08-06T08:31:44Z","cross_cats_sorted":[],"title_canon_sha256":"a6ef0243b62764ad198f84c2eb2ef67ffbdca121aadbe80a16e3e878aa7fd3b8","abstract_canon_sha256":"adea36a8147de28dbf840636e7fbf467865ea276cf027062bb091f1ef2f0cbdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:39.529671Z","signature_b64":"Ji4XmW7AN2RnwJMRTwh+M6muE1F7kGjscacBNIM5d5m9GIBrchX1H1+8YBjnDxz6S02+AD/RCklvYuW/6zGFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","last_reissued_at":"2026-05-18T03:16:39.528998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:39.528998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Unwinding for Intransitive Noninterference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Henning Schnoor, Ron van der Meyden, Sebastian Eggert, Thomas Wilke","submitted_at":"2013-08-06T08:31:44Z","abstract_excerpt":"The paper considers several definitions of information flow security for intransitive policies from the point of view of the complexity of verifying whether a finite-state system is secure. The results are as follows. Checking (i) P-security (Goguen and Meseguer), (ii) IP-security (Haigh and Young), and (iii) TA-security (van der Meyden) are all in PTIME, while checking TO-security (van der Meyden) is undecidable, as is checking ITO-security (van der Meyden). The most important ingredients in the proofs of the PTIME upper bounds are new characterizations of the respective security notions, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1204","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":"1308.1204","created_at":"2026-05-18T03:16:39.529118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1204v1","created_at":"2026-05-18T03:16:39.529118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1204","created_at":"2026-05-18T03:16:39.529118+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXCZEO7OFN6P","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXCZEO7OFN6P35CF","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXCZEO7O","created_at":"2026-05-18T12:27:38.830355+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/AXCZEO7OFN6P35CFYMSS6ZJMFC","json":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC.json","graph_json":"https://pith.science/api/pith-number/AXCZEO7OFN6P35CFYMSS6ZJMFC/graph.json","events_json":"https://pith.science/api/pith-number/AXCZEO7OFN6P35CFYMSS6ZJMFC/events.json","paper":"https://pith.science/paper/AXCZEO7O"},"agent_actions":{"view_html":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC","download_json":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC.json","view_paper":"https://pith.science/paper/AXCZEO7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1204&json=true","fetch_graph":"https://pith.science/api/pith-number/AXCZEO7OFN6P35CFYMSS6ZJMFC/graph.json","fetch_events":"https://pith.science/api/pith-number/AXCZEO7OFN6P35CFYMSS6ZJMFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/action/storage_attestation","attest_author":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/action/author_attestation","sign_citation":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/action/citation_signature","submit_replication":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/action/replication_record"}},"created_at":"2026-05-18T03:16:39.529118+00:00","updated_at":"2026-05-18T03:16:39.529118+00:00"}