{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AM3MQKCFJBWDV4KRI2F3332DCR","short_pith_number":"pith:AM3MQKCF","schema_version":"1.0","canonical_sha256":"0336c82845486c3af151468bbdef431466712deb882aee97ef1bddb4b693fade","source":{"kind":"arxiv","id":"1308.3472","version":1},"attestation_state":"computed","paper":{"title":"Security Type Systems as Recursive Predicates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Andrei Popescu","submitted_at":"2013-08-15T18:36:31Z","abstract_excerpt":"We show how security type systems from the literature of language-based noninterference can be represented more directly as predicates defined by structural recursion on the programs. In this context, we show how our uniform syntactic criteria from previous work cover several previous type-system soundness results."},"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.3472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-08-15T18:36:31Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"6a03c10255d046a43b1d6d9624182fda4a42296000ce62e2b8bd25206935b5bb","abstract_canon_sha256":"2d0cec79624a31be0d972d51b1a4ee7527401aeb0136553350587d65d0b85762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:45.786006Z","signature_b64":"4ho3G5Ff4jfSfeWysaGUZ5ZDLz8WUl2fjKWvSrDO/3qGgM+uwb4nM1uV7+KhB6zux3X2bQ7XsNmtexiwT82jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0336c82845486c3af151468bbdef431466712deb882aee97ef1bddb4b693fade","last_reissued_at":"2026-05-18T03:15:45.785138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:45.785138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Security Type Systems as Recursive Predicates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Andrei Popescu","submitted_at":"2013-08-15T18:36:31Z","abstract_excerpt":"We show how security type systems from the literature of language-based noninterference can be represented more directly as predicates defined by structural recursion on the programs. In this context, we show how our uniform syntactic criteria from previous work cover several previous type-system soundness results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3472","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.3472","created_at":"2026-05-18T03:15:45.785297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3472v1","created_at":"2026-05-18T03:15:45.785297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3472","created_at":"2026-05-18T03:15:45.785297+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM3MQKCFJBWD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM3MQKCFJBWDV4KR","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM3MQKCF","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/AM3MQKCFJBWDV4KRI2F3332DCR","json":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR.json","graph_json":"https://pith.science/api/pith-number/AM3MQKCFJBWDV4KRI2F3332DCR/graph.json","events_json":"https://pith.science/api/pith-number/AM3MQKCFJBWDV4KRI2F3332DCR/events.json","paper":"https://pith.science/paper/AM3MQKCF"},"agent_actions":{"view_html":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR","download_json":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR.json","view_paper":"https://pith.science/paper/AM3MQKCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3472&json=true","fetch_graph":"https://pith.science/api/pith-number/AM3MQKCFJBWDV4KRI2F3332DCR/graph.json","fetch_events":"https://pith.science/api/pith-number/AM3MQKCFJBWDV4KRI2F3332DCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR/action/storage_attestation","attest_author":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR/action/author_attestation","sign_citation":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR/action/citation_signature","submit_replication":"https://pith.science/pith/AM3MQKCFJBWDV4KRI2F3332DCR/action/replication_record"}},"created_at":"2026-05-18T03:15:45.785297+00:00","updated_at":"2026-05-18T03:15:45.785297+00:00"}