{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EH3EWGZMCZW6DFW3RXSGSVKIYG","short_pith_number":"pith:EH3EWGZM","schema_version":"1.0","canonical_sha256":"21f64b1b2c166de196db8de4695548c1b8f70c5b1a990d39ddac093bbdbf3eb8","source":{"kind":"arxiv","id":"1908.03929","version":1},"attestation_state":"computed","paper":{"title":"Secret Securing with Multiple Protections and Minimum Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Kai Cai, Shoma Matsui","submitted_at":"2019-08-11T16:02:24Z","abstract_excerpt":"In this paper we study a security problem of protecting secrets with multiple protections and minimum costs. The target system is modeled as a discrete-event system (DES) in which a few states are secrets, and there are multiple subsets of protectable events with different cost levels. We formulate the problem as to ensure that every string that reaches a secret state (from the initial state) contains a specified number of protectable events and the highest cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable"},"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":"1908.03929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-08-11T16:02:24Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"39394279ff61d3b5f8e351bec7dd8c22a325880dd445e8a43e5d5fe3e3b4a50b","abstract_canon_sha256":"fd24ee6614c330f0e504b4fe7f5f132d58ee3795dd07992c7c0682c867afb1dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:19.406691Z","signature_b64":"Lv9+X3Db0gOP12OXffzTtT7D3kmZmhC5IQxr3tNyeENnrMI6YHbsviP/8BabPgRZk4RK4z+foG3GbhQYZBOnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f64b1b2c166de196db8de4695548c1b8f70c5b1a990d39ddac093bbdbf3eb8","last_reissued_at":"2026-07-04T23:53:19.406333Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:19.406333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret Securing with Multiple Protections and Minimum Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Kai Cai, Shoma Matsui","submitted_at":"2019-08-11T16:02:24Z","abstract_excerpt":"In this paper we study a security problem of protecting secrets with multiple protections and minimum costs. The target system is modeled as a discrete-event system (DES) in which a few states are secrets, and there are multiple subsets of protectable events with different cost levels. We formulate the problem as to ensure that every string that reaches a secret state (from the initial state) contains a specified number of protectable events and the highest cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03929","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/1908.03929/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":"1908.03929","created_at":"2026-07-04T23:53:19.406391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03929v1","created_at":"2026-07-04T23:53:19.406391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03929","created_at":"2026-07-04T23:53:19.406391+00:00"},{"alias_kind":"pith_short_12","alias_value":"EH3EWGZMCZW6","created_at":"2026-07-04T23:53:19.406391+00:00"},{"alias_kind":"pith_short_16","alias_value":"EH3EWGZMCZW6DFW3","created_at":"2026-07-04T23:53:19.406391+00:00"},{"alias_kind":"pith_short_8","alias_value":"EH3EWGZM","created_at":"2026-07-04T23:53:19.406391+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/EH3EWGZMCZW6DFW3RXSGSVKIYG","json":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG.json","graph_json":"https://pith.science/api/pith-number/EH3EWGZMCZW6DFW3RXSGSVKIYG/graph.json","events_json":"https://pith.science/api/pith-number/EH3EWGZMCZW6DFW3RXSGSVKIYG/events.json","paper":"https://pith.science/paper/EH3EWGZM"},"agent_actions":{"view_html":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG","download_json":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG.json","view_paper":"https://pith.science/paper/EH3EWGZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03929&json=true","fetch_graph":"https://pith.science/api/pith-number/EH3EWGZMCZW6DFW3RXSGSVKIYG/graph.json","fetch_events":"https://pith.science/api/pith-number/EH3EWGZMCZW6DFW3RXSGSVKIYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG/action/storage_attestation","attest_author":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG/action/author_attestation","sign_citation":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG/action/citation_signature","submit_replication":"https://pith.science/pith/EH3EWGZMCZW6DFW3RXSGSVKIYG/action/replication_record"}},"created_at":"2026-07-04T23:53:19.406391+00:00","updated_at":"2026-07-04T23:53:19.406391+00:00"}