{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AXCZEO7OFN6P35CFYMSS6ZJMFC","short_pith_number":"pith:AXCZEO7O","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"},"canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","source":{"kind":"arxiv","id":"1308.1204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1204","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1204v1","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1204","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"AXCZEO7OFN6P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AXCZEO7OFN6P35CF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AXCZEO7O","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AXCZEO7OFN6P35CFYMSS6ZJMFC","target":"record","payload":{"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"},"canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","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"},"source_kind":"arxiv","source_id":"1308.1204","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-18T03:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"111+9/HzYY/V+HY/ovESWzEpX5QqKrmRgezeuUMwXcgAkPINB6v5L8qDZrpd49QSK0xE9bB586prdvAfrKa2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:38:45.708013Z"},"content_sha256":"d4d471adb5339c5ed21145ee7cf4647f9750cd6ce4523c21657f386d77c5484f","schema_version":"1.0","event_id":"sha256:d4d471adb5339c5ed21145ee7cf4647f9750cd6ce4523c21657f386d77c5484f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AXCZEO7OFN6P35CFYMSS6ZJMFC","target":"graph","payload":{"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"},"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-18T03:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VQBf9RZMrtMiJg1jqz1EvHkgd4ZGzIaPO5tlN8nx3AZbXQFzteKpc7jjY0ugju1a6BSF5ATmYqp7HmnBnuDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:38:45.708775Z"},"content_sha256":"cbcfc69662a9c2b74c0ce7109b521d2d3e6b2f5076d87a60c11bba6814dffedf","schema_version":"1.0","event_id":"sha256:cbcfc69662a9c2b74c0ce7109b521d2d3e6b2f5076d87a60c11bba6814dffedf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/bundle.json","state_url":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/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-25T14:38:45Z","links":{"resolver":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC","bundle":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/bundle.json","state":"https://pith.science/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXCZEO7OFN6P35CFYMSS6ZJMFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AXCZEO7OFN6P35CFYMSS6ZJMFC","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":"adea36a8147de28dbf840636e7fbf467865ea276cf027062bb091f1ef2f0cbdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-08-06T08:31:44Z","title_canon_sha256":"a6ef0243b62764ad198f84c2eb2ef67ffbdca121aadbe80a16e3e878aa7fd3b8"},"schema_version":"1.0","source":{"id":"1308.1204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1204","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1204v1","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1204","created_at":"2026-05-18T03:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"AXCZEO7OFN6P","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AXCZEO7OFN6P35CF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AXCZEO7O","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:cbcfc69662a9c2b74c0ce7109b521d2d3e6b2f5076d87a60c11bba6814dffedf","target":"graph","created_at":"2026-05-18T03:16:39Z","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":"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","authors_text":"Henning Schnoor, Ron van der Meyden, Sebastian Eggert, Thomas Wilke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-08-06T08:31:44Z","title":"Complexity and Unwinding for Intransitive Noninterference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1204","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:d4d471adb5339c5ed21145ee7cf4647f9750cd6ce4523c21657f386d77c5484f","target":"record","created_at":"2026-05-18T03:16:39Z","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":"adea36a8147de28dbf840636e7fbf467865ea276cf027062bb091f1ef2f0cbdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-08-06T08:31:44Z","title_canon_sha256":"a6ef0243b62764ad198f84c2eb2ef67ffbdca121aadbe80a16e3e878aa7fd3b8"},"schema_version":"1.0","source":{"id":"1308.1204","kind":"arxiv","version":1}},"canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05c5923bee2b7cfdf445c3252f652c28ab72ffd6ab963d46bb7ec2fe229fcb25","first_computed_at":"2026-05-18T03:16:39.528998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:39.528998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ji4XmW7AN2RnwJMRTwh+M6muE1F7kGjscacBNIM5d5m9GIBrchX1H1+8YBjnDxz6S02+AD/RCklvYuW/6zGFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:39.529671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4d471adb5339c5ed21145ee7cf4647f9750cd6ce4523c21657f386d77c5484f","sha256:cbcfc69662a9c2b74c0ce7109b521d2d3e6b2f5076d87a60c11bba6814dffedf"],"state_sha256":"a858ea849b07eec387d9be3eae55683a95267356db654371e21d805c7ac018fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Erg5fz9odoTycATZ8q25cuY/OJTBKQ4LTvHuJ7oIVEowd779UXX5BQpZZaSW9tgpQcdFUxP7Z+oG6TMxqCHzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:38:45.712642Z","bundle_sha256":"7aa572bdb1fe1ed0126cf65ed02afa9edb38066c05262fb38c510d317f10f656"}}