{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W3O4AU5QJRFNKJZ3QE3TXRQXCM","short_pith_number":"pith:W3O4AU5Q","schema_version":"1.0","canonical_sha256":"b6ddc053b04c4ad5273b81373bc61713339cac9a3f1a844c4e2a3b37870b2ba9","source":{"kind":"arxiv","id":"1510.04316","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Opacity in Refinement-Based Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"B\\'eatrice B\\'erard, John Mullins, Mathieu Sassolas, Olga Kouchnarenko","submitted_at":"2015-10-14T21:04:31Z","abstract_excerpt":"Given a probabilistic transition system (PTS) $\\cal A$ partially observed by an attacker, and an $\\omega$-regular predicate $\\varphi$over the traces of $\\cal A$, measuring the disclosure of the secret $\\varphi$ in $\\cal A$ means computing the probability that an attacker who observes a run of $\\cal A$ can ascertain that its trace belongs to $\\varphi$. In the context of refinement, we consider specifications given as Interval-valued Discrete Time Markov Chains (IDTMCs), which are underspecified Markov chains where probabilities on edges are only required to belong to intervals. Scheduling an ID"},"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":"1510.04316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-10-14T21:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"001349ecf9f38b2e0ce1dbb9a55df8e3090f61267454f0d8a536108dd7ad2faf","abstract_canon_sha256":"58eb23e46cb811d678c2e732a017f9c1f28df4db685e35d41f9525175b964ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.494374Z","signature_b64":"My9TYW2khC8g9AYMw9dW5FCY1GXo39jeFz5kxJ8z7Ph7XcBGGX2UxuPQfNv2ciIs4pNm0c4/IcxM0OHJfhYJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ddc053b04c4ad5273b81373bc61713339cac9a3f1a844c4e2a3b37870b2ba9","last_reissued_at":"2026-05-18T01:30:07.493606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.493606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Opacity in Refinement-Based Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"B\\'eatrice B\\'erard, John Mullins, Mathieu Sassolas, Olga Kouchnarenko","submitted_at":"2015-10-14T21:04:31Z","abstract_excerpt":"Given a probabilistic transition system (PTS) $\\cal A$ partially observed by an attacker, and an $\\omega$-regular predicate $\\varphi$over the traces of $\\cal A$, measuring the disclosure of the secret $\\varphi$ in $\\cal A$ means computing the probability that an attacker who observes a run of $\\cal A$ can ascertain that its trace belongs to $\\varphi$. In the context of refinement, we consider specifications given as Interval-valued Discrete Time Markov Chains (IDTMCs), which are underspecified Markov chains where probabilities on edges are only required to belong to intervals. Scheduling an ID"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04316","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":"1510.04316","created_at":"2026-05-18T01:30:07.493732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04316v1","created_at":"2026-05-18T01:30:07.493732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04316","created_at":"2026-05-18T01:30:07.493732+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3O4AU5QJRFN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3O4AU5QJRFNKJZ3","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3O4AU5Q","created_at":"2026-05-18T12:29:47.479230+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/W3O4AU5QJRFNKJZ3QE3TXRQXCM","json":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM.json","graph_json":"https://pith.science/api/pith-number/W3O4AU5QJRFNKJZ3QE3TXRQXCM/graph.json","events_json":"https://pith.science/api/pith-number/W3O4AU5QJRFNKJZ3QE3TXRQXCM/events.json","paper":"https://pith.science/paper/W3O4AU5Q"},"agent_actions":{"view_html":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM","download_json":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM.json","view_paper":"https://pith.science/paper/W3O4AU5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04316&json=true","fetch_graph":"https://pith.science/api/pith-number/W3O4AU5QJRFNKJZ3QE3TXRQXCM/graph.json","fetch_events":"https://pith.science/api/pith-number/W3O4AU5QJRFNKJZ3QE3TXRQXCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM/action/storage_attestation","attest_author":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM/action/author_attestation","sign_citation":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM/action/citation_signature","submit_replication":"https://pith.science/pith/W3O4AU5QJRFNKJZ3QE3TXRQXCM/action/replication_record"}},"created_at":"2026-05-18T01:30:07.493732+00:00","updated_at":"2026-05-18T01:30:07.493732+00:00"}