{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2OZVBM2AAR26BRSU7BVS6IZXAF","short_pith_number":"pith:2OZVBM2A","schema_version":"1.0","canonical_sha256":"d3b350b3400475e0c654f86b2f233701796a746db08763eb3cd79a09d549ab89","source":{"kind":"arxiv","id":"1410.4617","version":2},"attestation_state":"computed","paper":{"title":"A Cut Principle for Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Joshua D. Guttman, Paul D. Rowe","submitted_at":"2014-10-17T02:44:36Z","abstract_excerpt":"We view a distributed system as a graph of active locations with unidirectional channels between them, through which they pass messages. In this context, the graph structure of a system constrains the propagation of information through it.\n  Suppose a set of channels is a cut set between an information source and a potential sink. We prove that, if there is no disclosure from the source to the cut set, then there can be no disclosure to the sink. We introduce a new formalization of partial disclosure, called *blur operators*, and show that the same cut property is preserved for disclosure to w"},"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":"1410.4617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-17T02:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"ee48a550e5c454afb026e0c394156515be6e78971e67e62475c85badae513740","abstract_canon_sha256":"68adc93b190b5161c79f78db7f8a996bb952a7fc9a13742ee923d02b5789700a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:32.268140Z","signature_b64":"ZFbwEpR+YZJ8477Mq2glLhsN442MBhhcuxB51dJg/WgXh8HSaFuZ3sdpvyO2+LQ49/jCjQ8RHm0Pw0M3Go61Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b350b3400475e0c654f86b2f233701796a746db08763eb3cd79a09d549ab89","last_reissued_at":"2026-05-18T00:18:32.267782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:32.267782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cut Principle for Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Joshua D. Guttman, Paul D. Rowe","submitted_at":"2014-10-17T02:44:36Z","abstract_excerpt":"We view a distributed system as a graph of active locations with unidirectional channels between them, through which they pass messages. In this context, the graph structure of a system constrains the propagation of information through it.\n  Suppose a set of channels is a cut set between an information source and a potential sink. We prove that, if there is no disclosure from the source to the cut set, then there can be no disclosure to the sink. We introduce a new formalization of partial disclosure, called *blur operators*, and show that the same cut property is preserved for disclosure to w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4617","kind":"arxiv","version":2},"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":"1410.4617","created_at":"2026-05-18T00:18:32.267834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4617v2","created_at":"2026-05-18T00:18:32.267834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4617","created_at":"2026-05-18T00:18:32.267834+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OZVBM2AAR26","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OZVBM2AAR26BRSU","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OZVBM2A","created_at":"2026-05-18T12:28:11.866339+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/2OZVBM2AAR26BRSU7BVS6IZXAF","json":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF.json","graph_json":"https://pith.science/api/pith-number/2OZVBM2AAR26BRSU7BVS6IZXAF/graph.json","events_json":"https://pith.science/api/pith-number/2OZVBM2AAR26BRSU7BVS6IZXAF/events.json","paper":"https://pith.science/paper/2OZVBM2A"},"agent_actions":{"view_html":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF","download_json":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF.json","view_paper":"https://pith.science/paper/2OZVBM2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4617&json=true","fetch_graph":"https://pith.science/api/pith-number/2OZVBM2AAR26BRSU7BVS6IZXAF/graph.json","fetch_events":"https://pith.science/api/pith-number/2OZVBM2AAR26BRSU7BVS6IZXAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF/action/storage_attestation","attest_author":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF/action/author_attestation","sign_citation":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF/action/citation_signature","submit_replication":"https://pith.science/pith/2OZVBM2AAR26BRSU7BVS6IZXAF/action/replication_record"}},"created_at":"2026-05-18T00:18:32.267834+00:00","updated_at":"2026-05-18T00:18:32.267834+00:00"}