{"as_of":"2026-08-08T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49692cf0f08790042f065b9d693c48c01a697c7ac5cd84b333c00058caa398dd","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T06:15:20.662763Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.22009/citation-record","integrity":"/paper/2607.22009/integrity","json":"/paper/2607.22009/citation-record.json","paper":"/paper/2607.22009"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.226406Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.226406Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:4ba6e48934d975b954f51fdb882ab3a2ae184203ce003cc0878a7395a9292dce","observation_id":"13f276de-66be-4938-89df-01dc383c29a7","resolution":{"observed_at":"2026-08-01T06:15:18.226406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:20.075249Z","title":"Cyber maintenance policy optimization via adap- tive learning","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:20.075249Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:19f6b48fa3c551b06f889563acbc66e9b218e6874b049c3b005acb72e2f1d166","observation_id":"5be9b628-0c25-40f5-a3b8-776d131e21f8","resolution":{"observed_at":"2026-08-01T06:15:20.075249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.645559Z","title":"Adaptive submodular maximization in bandit setting","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.645559Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:8945986b814ba6a2d29038beee822576363546425ba1a8d05d4518116071a3f1","observation_id":"f6fe182f-f97a-48f4-abf2-ae5121b0d488","resolution":{"observed_at":"2026-08-01T06:15:18.645559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.740632Z","title":"Optimal surveillance of covert net- works by minimizing inverse geodesic length","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.740632Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:602ec13abc20e757d60e0e28ab92da49d2b2067b18240db01dcc39a71427ac4c","observation_id":"349fcf67-2659-43cc-9871-92bd8225977b","resolution":{"observed_at":"2026-08-01T06:15:18.740632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.870609Z","title":"Limited Query Graph Connectivity Test","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.870609Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:41f622a87fb08adcbcb3b98b8bd00e06b4ab6ba4bd0409d9978864ebc58474c0","observation_id":"7b9315b4-c711-460e-9f26-ac6ec99ce88f","resolution":{"observed_at":"2026-08-01T06:15:18.870609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.937863Z","title":"Coalitional security games","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.937863Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:3bbb016c5e8279ac53aeeaaf520c3a121989e8ec6b05a4f97c51a5b92e4421dd","observation_id":"d3d04cda-c662-414e-a3c5-2288a7d8cdb2","resolution":{"observed_at":"2026-08-01T06:15:18.937863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.348793Z","title":"A Formal Model for Credential Hopping Attacks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.348793Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:61717888f192fc0d7e95faa53ca5514b393d96d46c2cfe322e8ba8eb1f520681","observation_id":"116db2db-92c0-4b6b-88d7-edb152883acc","resolution":{"observed_at":"2026-08-01T06:15:18.348793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.306421Z","title":"Ranking attack graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.306421Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:605dfe1f3a402ab6d74d94ddc3567eb4406008eb67c85f0432e613ecaf271e82","observation_id":"a21facb5-fa6e-460d-a14f-9eb71defd7f6","resolution":{"observed_at":"2026-08-01T06:15:19.306421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-07-06T04:37:00.543211Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-01T06:15:19.929385Z","title":"Hop-constrained st Simple Path Enumeration: Towards Bridging Theory and Practice","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.929385Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:9ef3eef2aca9a17d2e0cd259a3b23c88ba291640be18dc907e04f40af6b5fcac","observation_id":"ed8da456-1f79-44a5-bfdf-1093c9e75d77","resolution":{"observed_at":"2026-08-01T06:15:19.929385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:20.359643Z","title":"Jump- start reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:20.359643Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:ff5a1f689943b9d594992fa869b3d08a49bf6e7fcd5ae728ac4275c1e8f2f59f","observation_id":"f52f89ab-a0df-4180-a8d5-537b4d34f001","resolution":{"observed_at":"2026-08-01T06:15:20.359643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10261","last_updated":"2023-02-28T18:50:45Z","snapshot_observed_at":"2026-07-06T14:53:53.017634Z","submitted_at":"2023-02-20T19:47:25Z","title":"Deep Reinforcement Learning for Cost-Effective Medical Diagnosis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10261","snapshot_observed_at":"2026-08-01T06:15:20.495399Z","title":"Submodularity in data subset selec- tionandactivelearning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:20.495399Z"},"links":{"cited_paper":"/paper/2302.10261","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:f076b916e8d66dac2a8da5938c5265aa6961a2a7f1459be9b1d3827ff74b0f72","observation_id":"1d761895-812c-4c9f-a750-c50878ae8fe0","resolution":{"observed_at":"2026-08-01T06:15:20.495399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:20.226232Z","title":"Urban security: Game-theoretic resource allocation in networked domains","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:20.226232Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:9c3fbff7f2fb8833232fc0ecabb410fe2846a192b43d4d60cdd719e28829a599","observation_id":"9fb5c736-a2c6-4f14-91e2-47c3f3e1567a","resolution":{"observed_at":"2026-08-01T06:15:20.226232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.788067Z","title":"Optimizing cyber defense in dynamic active directories through reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.788067Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:1c189291a170b45a0dfe1da89acd794f881c8a47223a110f7c60c5d5cc83a845","observation_id":"b1a48ed1-fb7f-4e0d-80f3-493a671d9df1","resolution":{"observed_at":"2026-08-01T06:15:18.788067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.06180","last_updated":"2021-09-13T15:07:35Z","snapshot_observed_at":"2026-07-06T11:47:17.359803Z","submitted_at":"2021-09-13T15:07:35Z","title":"Deep Generative Models to Extend Active Directory Graphs with Honeypot Users","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.06180","snapshot_observed_at":"2026-08-01T06:15:19.164739Z","title":"Self-improving reactive agents based on reinforcement learning, planning and teaching","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.164739Z"},"links":{"cited_paper":"/paper/2109.06180","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:22934f376fc879e1bb42745c02167373850cd1c2ddf02e302f69eed18dcfc2b1","observation_id":"75874d5f-ddfe-4014-96cf-ee8af5c68717","resolution":{"observed_at":"2026-08-01T06:15:19.164739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.580169Z","title":"Curriculum learning for multilevel bud- geted combinatorial problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.580169Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:a3e16b7ec7b1bb6f9ecaa6d8f4a03f7d30053b8177a35796adacc82edca4f1c3","observation_id":"e7124a5e-54b8-4d3d-b797-4f5a1c29b4a5","resolution":{"observed_at":"2026-08-01T06:15:19.580169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.679661Z","title":"Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.679661Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:a4df5c9f9128aed991dc1f89b23bc134a4b33da156bd007cf487a0309dda2220","observation_id":"675e2e00-7b8c-4ceb-a433-41ff977fb2dd","resolution":{"observed_at":"2026-08-01T06:15:19.679661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14846","last_updated":"2022-06-29T18:17:28Z","snapshot_observed_at":"2026-08-07T18:48:25.156906Z","submitted_at":"2022-06-29T18:17:28Z","title":"Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.14846","snapshot_observed_at":"2026-08-01T06:15:18.990560Z","title":"Optimal interdiction of illegal network flow","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":167,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.990560Z"},"links":{"cited_paper":"/paper/2206.14846","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:0daecbdb2b8c5e6204503e92e433b9059df7a07351ccbd34070b84a0d47c9095","observation_id":"6636a9f9-1776-435c-b6ff-c1d2c613551c","resolution":{"observed_at":"2026-08-01T06:15:18.990560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.07207","last_updated":"2019-10-18T09:17:44Z","snapshot_observed_at":"2026-08-06T11:56:09.577967Z","submitted_at":"2019-10-16T08:11:08Z","title":"Soft Actor-Critic for Discrete Action Settings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.07207","snapshot_observed_at":"2026-08-01T06:15:18.525217Z","title":"Radial basis functions","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":345,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.525217Z"},"links":{"cited_paper":"/paper/1910.07207","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:4bc52df4fe6133f697be4d2ac50420b436996f8b0c390425c0c5bd19e5207ed2","observation_id":"406d8430-2d0c-4105-9d0e-a070b86eef4b","resolution":{"observed_at":"2026-08-01T06:15:18.525217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.807764Z","title":"Optimal ids sensor placement and alert pri- oritization using attack graphs","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":608,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.807764Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:60b1df8b519acd3c7a2f3f54e51fdea7714c26dc895370ba4b583aef754642da","observation_id":"429c454f-e648-4bbb-9cdb-8ca82b2ee3a0","resolution":{"observed_at":"2026-08-01T06:15:19.807764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.095347Z","title":"Cybersecurity Data Sources for Dynamic Network Re- search","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":690,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.095347Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:b29b393940fd4a567a259dd83e30112cadb3c528c2e725f194bc358c88f89122","observation_id":"5dab87f8-3d15-4b37-9bf4-102d7f0afa59","resolution":{"observed_at":"2026-08-01T06:15:19.095347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:20.662763Z","title":"Robust curriculum learning: from clean label detection to noisy label self-correction","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":1750,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:20.662763Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:24f30ec2387d9aa6e31782e079536cd00ba55fe35f982665b963ddd2b4891f18","observation_id":"b1af4496-68d4-474d-bf47-083b827be4c5","resolution":{"observed_at":"2026-08-01T06:15:20.662763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:19.426612Z","title":"Harnessing the power of deception in attack graph-based security games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:19.426612Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:8a8e3c7e4879fe4195f3f3c9bc59fc85baab75dece8a9940536f93ecee9e88e4","observation_id":"61b5daf5-b5fc-4fcd-a002-a0c4e70b8838","resolution":{"observed_at":"2026-08-01T06:15:19.426612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.284701Z","title":"To delay or not: temporal vaccinationgamesonnetworks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.284701Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:f01b6744aefd83a5d7b1245895fa90886dd31e4e1f71dabebdb8f6d4cd427a73","observation_id":"cb4c27f2-cbc0-4b13-a535-a7b7b6f76d9f","resolution":{"observed_at":"2026-08-01T06:15:18.284701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.588089Z","title":"Beyond adaptive submodularity: Approxi- mation guarantees of greedy policy with adaptive submodularity ratio","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":3252,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.588089Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:4a006c3d4f844ec632174512f5f84b818019794628f75870bdc7b91cac7224c3","observation_id":"75689532-4061-4bfb-8a74-a6e73a1ee0f3","resolution":{"observed_at":"2026-08-01T06:15:18.588089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:15:18.427270Z","title":"Resource-Limited Network Security Games with General Contagious Attacks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":5142,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.427270Z"},"links":{"citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:1d88a5cd8ef0e7f0a71213a13713fce37621baf7e424bac64e6113d55dbf21d2","observation_id":"950d8ad0-a759-4bec-b049-c93e81fceab3","resolution":{"observed_at":"2026-08-01T06:15:18.427270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.22009."}