{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GGFDG5RX5Y23XG54JUSLH37KTP","short_pith_number":"pith:GGFDG5RX","schema_version":"1.0","canonical_sha256":"318a337637ee35bb9bbc4d24b3efea9bc3d7a0614b26350922043868038f1b44","source":{"kind":"arxiv","id":"2005.04268","version":1},"attestation_state":"computed","paper":{"title":"Extended Insertion Functions for Opacity Enforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Christoforos N. Hadjicostis, Xiaoyan Li, Zhiwu Li","submitted_at":"2020-05-08T19:26:51Z","abstract_excerpt":"Opacity is a confidentiality property that holds when certain secret strings of a given system cannot be revealed to an outside observer under any system activity. Opacity violations stimulate the study of opacity enforcement strategies. Among other methodologies, opacity has been enforced using insertion mechanisms, i.e., output obfuscation mechanisms that are allowed to insert fictitious output symbols before actual system outputs, in order to preserve opacity. This paper studies and analyzes more powerful extended insertion mechanisms, which can insert symbols before and after an actual sys"},"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":"2005.04268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-08T19:26:51Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"27580f1d79e9ba58dd32d70d3806151bdfd50ad5d7db312bc95f0a07a927c109","abstract_canon_sha256":"106dccb082d0f49f8300b1258d22ab5c47832246d6cf77fb5db1f8483c5419c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:42.314237Z","signature_b64":"oAOzVeXetacmjxmSzldsUj8QmoO32wqKvQFWwOXVGgTkEB0bKrRR7w4MNDwBywQrdZAceJqT2jOj12esUbXXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"318a337637ee35bb9bbc4d24b3efea9bc3d7a0614b26350922043868038f1b44","last_reissued_at":"2026-07-05T01:01:42.313734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:42.313734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Insertion Functions for Opacity Enforcement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Christoforos N. Hadjicostis, Xiaoyan Li, Zhiwu Li","submitted_at":"2020-05-08T19:26:51Z","abstract_excerpt":"Opacity is a confidentiality property that holds when certain secret strings of a given system cannot be revealed to an outside observer under any system activity. Opacity violations stimulate the study of opacity enforcement strategies. Among other methodologies, opacity has been enforced using insertion mechanisms, i.e., output obfuscation mechanisms that are allowed to insert fictitious output symbols before actual system outputs, in order to preserve opacity. This paper studies and analyzes more powerful extended insertion mechanisms, which can insert symbols before and after an actual sys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04268","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.04268/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.04268","created_at":"2026-07-05T01:01:42.313798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.04268v1","created_at":"2026-07-05T01:01:42.313798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04268","created_at":"2026-07-05T01:01:42.313798+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGFDG5RX5Y23","created_at":"2026-07-05T01:01:42.313798+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGFDG5RX5Y23XG54","created_at":"2026-07-05T01:01:42.313798+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGFDG5RX","created_at":"2026-07-05T01:01:42.313798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07855","citing_title":"Vision-Language Models for Edge Networks: A Comprehensive Survey","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP","json":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP.json","graph_json":"https://pith.science/api/pith-number/GGFDG5RX5Y23XG54JUSLH37KTP/graph.json","events_json":"https://pith.science/api/pith-number/GGFDG5RX5Y23XG54JUSLH37KTP/events.json","paper":"https://pith.science/paper/GGFDG5RX"},"agent_actions":{"view_html":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP","download_json":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP.json","view_paper":"https://pith.science/paper/GGFDG5RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.04268&json=true","fetch_graph":"https://pith.science/api/pith-number/GGFDG5RX5Y23XG54JUSLH37KTP/graph.json","fetch_events":"https://pith.science/api/pith-number/GGFDG5RX5Y23XG54JUSLH37KTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP/action/storage_attestation","attest_author":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP/action/author_attestation","sign_citation":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP/action/citation_signature","submit_replication":"https://pith.science/pith/GGFDG5RX5Y23XG54JUSLH37KTP/action/replication_record"}},"created_at":"2026-07-05T01:01:42.313798+00:00","updated_at":"2026-07-05T01:01:42.313798+00:00"}