{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JM42HD5DVQEQRXM3DQAMBCVIBJ","short_pith_number":"pith:JM42HD5D","schema_version":"1.0","canonical_sha256":"4b39a38fa3ac0908dd9b1c00c08aa80a45e7a73ab1f256e964e7ad94171e60d8","source":{"kind":"arxiv","id":"2007.13981","version":2},"attestation_state":"computed","paper":{"title":"Farsighted Risk Mitigation of Lateral Movement Using Dynamic Cognitive Honeypots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Linan Huang, Quanyan Zhu","submitted_at":"2020-07-28T04:13:43Z","abstract_excerpt":"Lateral movement of advanced persistent threats has posed a severe security challenge. Due to the stealthy and persistent nature of the lateral movement, defenders need to consider time and spatial locations holistically to discover latent attack paths across a large time-scale and achieve long-term security for the target assets. In this work, we propose a time-expanded random network to model the stochastic service links in the user-host enterprise network and the adversarial lateral movement. We design cognitive honeypots at idle production nodes and disguise honey links as service links to"},"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":"2007.13981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-07-28T04:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"d5daca139e15d28b609d118549c2a56e2859aa12d140d66f369a8d5b8f76f2b6","abstract_canon_sha256":"4fe28b3e7c91aee95ec3438058e4da39887201717f78ecaeb6a307a28ee57d7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:36.725613Z","signature_b64":"TN1Uehe4wCYY1zPVxumxWxUs6Qb++5RYA73a7bbE4mf1HtZ+5SDEfzyD47Ibmvkpcj84WCD4wgj1wcQTDF90DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b39a38fa3ac0908dd9b1c00c08aa80a45e7a73ab1f256e964e7ad94171e60d8","last_reissued_at":"2026-07-05T01:40:36.725206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:36.725206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Farsighted Risk Mitigation of Lateral Movement Using Dynamic Cognitive Honeypots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Linan Huang, Quanyan Zhu","submitted_at":"2020-07-28T04:13:43Z","abstract_excerpt":"Lateral movement of advanced persistent threats has posed a severe security challenge. Due to the stealthy and persistent nature of the lateral movement, defenders need to consider time and spatial locations holistically to discover latent attack paths across a large time-scale and achieve long-term security for the target assets. In this work, we propose a time-expanded random network to model the stochastic service links in the user-host enterprise network and the adversarial lateral movement. We design cognitive honeypots at idle production nodes and disguise honey links as service links to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13981","kind":"arxiv","version":2},"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/2007.13981/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":"2007.13981","created_at":"2026-07-05T01:40:36.725263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.13981v2","created_at":"2026-07-05T01:40:36.725263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13981","created_at":"2026-07-05T01:40:36.725263+00:00"},{"alias_kind":"pith_short_12","alias_value":"JM42HD5DVQEQ","created_at":"2026-07-05T01:40:36.725263+00:00"},{"alias_kind":"pith_short_16","alias_value":"JM42HD5DVQEQRXM3","created_at":"2026-07-05T01:40:36.725263+00:00"},{"alias_kind":"pith_short_8","alias_value":"JM42HD5D","created_at":"2026-07-05T01:40:36.725263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19837","citing_title":"Multi-Agent Reinforcement Learning in Cybersecurity: From Fundamentals to Applications","ref_index":72,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ","json":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ.json","graph_json":"https://pith.science/api/pith-number/JM42HD5DVQEQRXM3DQAMBCVIBJ/graph.json","events_json":"https://pith.science/api/pith-number/JM42HD5DVQEQRXM3DQAMBCVIBJ/events.json","paper":"https://pith.science/paper/JM42HD5D"},"agent_actions":{"view_html":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ","download_json":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ.json","view_paper":"https://pith.science/paper/JM42HD5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.13981&json=true","fetch_graph":"https://pith.science/api/pith-number/JM42HD5DVQEQRXM3DQAMBCVIBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JM42HD5DVQEQRXM3DQAMBCVIBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ/action/storage_attestation","attest_author":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ/action/author_attestation","sign_citation":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ/action/citation_signature","submit_replication":"https://pith.science/pith/JM42HD5DVQEQRXM3DQAMBCVIBJ/action/replication_record"}},"created_at":"2026-07-05T01:40:36.725263+00:00","updated_at":"2026-07-05T01:40:36.725263+00:00"}