{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OSDVZWZU2DICEA3KOEBPS2AK3X","short_pith_number":"pith:OSDVZWZU","schema_version":"1.0","canonical_sha256":"74875cdb34d0d022036a7102f9680addc8b14df9fddfc68afe70f93f47141c3e","source":{"kind":"arxiv","id":"1307.4475","version":1},"attestation_state":"computed","paper":{"title":"Slot Games for Detecting Timing Leaks of Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.GT"],"primary_cat":"cs.PL","authors_text":"Aleksandar S. Dimovski","submitted_at":"2013-07-17T01:42:37Z","abstract_excerpt":"In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert timing channels. That is, no two computations of a program that differ only on high-security inputs can be distinguished by low-security outputs and timing differences. We attack this problem by using slot-game semantics for a quantitative analysis of programs. We show how slot-games model can be used for performing a precise security analysis of programs, that takes into account both extensional and intensional prope"},"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":"1307.4475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-07-17T01:42:37Z","cross_cats_sorted":["cs.CR","cs.GT"],"title_canon_sha256":"a59870bb4ccae6974b07dfb5a3d90e061f67aed43c358872f0ce9e96072ea934","abstract_canon_sha256":"a8bd591527f9f936e6eb9a5574909696a64e0b49ebc53f3be70a773e6ab1182e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.848211Z","signature_b64":"ny4iHeEZffyH6Pm4lxwn9GU/dYm7pl72ItQ+5RbUSeecbOREZgBTlDQDXoL7jJ1U+GiGjSHeilBWD0eJlsi2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74875cdb34d0d022036a7102f9680addc8b14df9fddfc68afe70f93f47141c3e","last_reissued_at":"2026-05-18T03:18:17.847732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.847732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slot Games for Detecting Timing Leaks of Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.GT"],"primary_cat":"cs.PL","authors_text":"Aleksandar S. Dimovski","submitted_at":"2013-07-17T01:42:37Z","abstract_excerpt":"In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert timing channels. That is, no two computations of a program that differ only on high-security inputs can be distinguished by low-security outputs and timing differences. We attack this problem by using slot-game semantics for a quantitative analysis of programs. We show how slot-games model can be used for performing a precise security analysis of programs, that takes into account both extensional and intensional prope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4475","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":"1307.4475","created_at":"2026-05-18T03:18:17.847807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4475v1","created_at":"2026-05-18T03:18:17.847807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4475","created_at":"2026-05-18T03:18:17.847807+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSDVZWZU2DIC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSDVZWZU2DICEA3K","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSDVZWZU","created_at":"2026-05-18T12:27:54.935989+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/OSDVZWZU2DICEA3KOEBPS2AK3X","json":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X.json","graph_json":"https://pith.science/api/pith-number/OSDVZWZU2DICEA3KOEBPS2AK3X/graph.json","events_json":"https://pith.science/api/pith-number/OSDVZWZU2DICEA3KOEBPS2AK3X/events.json","paper":"https://pith.science/paper/OSDVZWZU"},"agent_actions":{"view_html":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X","download_json":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X.json","view_paper":"https://pith.science/paper/OSDVZWZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4475&json=true","fetch_graph":"https://pith.science/api/pith-number/OSDVZWZU2DICEA3KOEBPS2AK3X/graph.json","fetch_events":"https://pith.science/api/pith-number/OSDVZWZU2DICEA3KOEBPS2AK3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X/action/storage_attestation","attest_author":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X/action/author_attestation","sign_citation":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X/action/citation_signature","submit_replication":"https://pith.science/pith/OSDVZWZU2DICEA3KOEBPS2AK3X/action/replication_record"}},"created_at":"2026-05-18T03:18:17.847807+00:00","updated_at":"2026-05-18T03:18:17.847807+00:00"}