{"as_of":"2026-08-09T06:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:42e735e28bd42196607658ef16ead18f6bf3014c41e08cc290319710c3f96b37","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:31:24.858560Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.10925/citation-record","integrity":"/paper/2509.10925/integrity","json":"/paper/2509.10925/citation-record.json","paper":"/paper/2509.10925"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.02835","last_updated":"2025-06-11T06:45:18Z","snapshot_observed_at":"2026-07-06T19:45:21.541944Z","submitted_at":"2024-11-05T06:18:37Z","title":"Community detection with the Bethe-Hessian","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.02835","snapshot_observed_at":"2026-08-04T17:31:23.706500Z","title":"Community detection with the Bethe-Hessian,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.706500Z"},"links":{"cited_paper":"/paper/2411.02835","citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:e05fc2c595de72e799793b47cbf819ac4561d7c4b6113f5a8eb78d7137e3128d","observation_id":"6c68c431-6a00-4b46-a211-06f64cc02d8d","resolution":{"observed_at":"2026-08-04T17:31:23.706500Z","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-04T17:31:23.755360Z","title":"Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.755360Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:a8b02bb29a3a5d4c07bc2f7baaf275df02e09fc7e7040ed41c66721a581c2a51","observation_id":"50422694-d8c8-4429-a48a-293962e4a975","resolution":{"observed_at":"2026-08-04T17:31:23.755360Z","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-04T17:31:23.832010Z","title":"Sequential change‐point detection: Computation versus statistical performance,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.832010Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:6341af2ef2391312b11f476c78c7def35a7d3c023fa71787dd31ba9ff1331415","observation_id":"5fa6b0b9-8d95-4e76-b91c-73a42bd1af53","resolution":{"observed_at":"2026-08-04T17:31:23.832010Z","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-04T17:31:23.865306Z","title":"Sparse random hypergraphs: Non-backtracking spectra and community detection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.865306Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:a652ba11c827cdafe47a79b5fe632e5822a26ce908f3ce049df628e9a6c52e5d","observation_id":"8662d51b-409d-4f35-a467-55c23bd24b5c","resolution":{"observed_at":"2026-08-04T17:31:23.865306Z","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-04T17:31:23.927712Z","title":"A proof of the block model threshold conjecture,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.927712Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:b260f00e8e6ad06e9bd70c6b9691556f16cdfd9fbc12c4e7b7a933ce79b5dd13","observation_id":"50926180-8d9b-4681-9f61-319b199cd4b4","resolution":{"observed_at":"2026-08-04T17:31:23.927712Z","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-04T17:31:23.988195Z","title":"Statistical and computational thresholds for the planted k-densest sub-hypergraph problem,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:23.988195Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:90f7bd0be26b4ee67a226daf62ed03f8762e46adc4ef2f8eeb6f0f237578799a","observation_id":"e34190f3-bcfe-472d-bdce-bd0aa28b527f","resolution":{"observed_at":"2026-08-04T17:31:23.988195Z","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-04T17:31:24.045832Z","title":"Detection of Dense Subhypergraphs by Low‐ Degree Polynomials,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.045832Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:fe9ad35c53801eabef84b83252c5210ff615b1886f9361d8a6dc28f308deef72","observation_id":"638e7b22-7182-44b7-b7e4-3097d2cc2dbb","resolution":{"observed_at":"2026-08-04T17:31:24.045832Z","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-04T17:31:24.099540Z","title":"Online kernel CUSUM for change-point detection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.099540Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:e0b92afc2918226d7de504ad7fca3f5f32545a971b6a9274caa3f71d65899f43","observation_id":"bccfba1c-9485-4e27-8453-f66026ef7d7c","resolution":{"observed_at":"2026-08-04T17:31:24.099540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17312","last_updated":"2024-03-09T18:47:56Z","snapshot_observed_at":"2026-08-04T06:37:26.738723Z","submitted_at":"2022-10-31T16:47:11Z","title":"Neural network-based CUSUM for online change-point detection","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17312","snapshot_observed_at":"2026-08-04T17:31:24.178821Z","title":"Neural network-based CUSUM for online change- point detection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.178821Z"},"links":{"cited_paper":"/paper/2210.17312","citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:8bc275b3451688e1058392c93fc1077fcc2f0811df2e17e757ad7991186c5ac1","observation_id":"a32c5701-c192-4ea8-9e8f-ad0d09fc3965","resolution":{"observed_at":"2026-08-04T17:31:24.178821Z","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-04T17:31:24.236190Z","title":"Sequential change-point detection for mutually exciting point processes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.236190Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:c19e1f9edd21abb1374dbdb24d09dd3c7fbcb2eeee8223d79d6c7a6836381920","observation_id":"f494c9b5-d2f3-4a48-a743-4bca0e5eb5db","resolution":{"observed_at":"2026-08-04T17:31:24.236190Z","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-04T17:31:24.284991Z","title":"Graph anomaly detection with graph neural networks: Current status and challenges,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.284991Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:7766f5fcd7c13ae0cd96fb353de5f535b24b7557827cbb65868228095cc8cbfa","observation_id":"e54e78e7-4af4-48c7-b926-de197df871ad","resolution":{"observed_at":"2026-08-04T17:31:24.284991Z","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-04T17:31:24.346770Z","title":"Graph anomaly detection in time series: A survey,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.346770Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:1460ca1939039265f308a6827bf1a7985ec733826cd439a7d5e8dc93b3ef7bb9","observation_id":"875716f0-65f2-499a-9f5f-474e7db5c3b9","resolution":{"observed_at":"2026-08-04T17:31:24.346770Z","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-04T17:31:24.402750Z","title":"Deep graph anomaly detection: A survey and new perspectives,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.402750Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:b435102ef7c02d17c3ee989a37eacc84f564b96e6b39c5e9fc1e69a4cd787e4d","observation_id":"ed88387d-5fd7-4dcc-b571-5ae1d09f290b","resolution":{"observed_at":"2026-08-04T17:31:24.402750Z","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-04T17:31:24.460141Z","title":"Multi-view change point detection in dynamic networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.460141Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:a68ed5ae9bbe9e3a57d1e61a0f66668d773dfbe6d1bc8394872a9af21ef452fa","observation_id":"4ad47d76-b2b7-4ff3-b66f-e96c45c67a45","resolution":{"observed_at":"2026-08-04T17:31:24.460141Z","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-04T17:31:24.514559Z","title":"State-of-the-art in community detection in temporal networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.514559Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:373a92ffdccf4bda78cb1aa416dc123f7510efa67af4a52ab3cef5cc7de5a9e9","observation_id":"b00aceeb-0c76-4349-a4fa-3d805a1ef749","resolution":{"observed_at":"2026-08-04T17:31:24.514559Z","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-04T17:31:24.561373Z","title":"Laplacian change point detection for single and multi-view dynamic graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.561373Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:ce7b9ca6a5648748ad4e4523ef6b4ebfba998be248277e36d7571a19e461fa78","observation_id":"699b647a-c555-439b-929d-158b02e0360d","resolution":{"observed_at":"2026-08-04T17:31:24.561373Z","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-04T17:31:24.621193Z","title":"Spectra of some self-exciting and mutually exciting point processes,","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.621193Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:11c79190b61da335b4c16cc192a3077d80c8fde4c3914b2cdecc38688cc8c03e","observation_id":"c34befb0-593e-4633-994a-c5485edcfb13","resolution":{"observed_at":"2026-08-04T17:31:24.621193Z","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-04T17:31:24.664982Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.664982Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:f1d3040e31ab2c423d11750eef30e52dea87d8a1bbb6b24ad59ee1eda527113e","observation_id":"0c9beb7c-5863-4904-9860-281374ab8c8d","resolution":{"observed_at":"2026-08-04T17:31:24.664982Z","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-04T17:31:24.732363Z","title":"Continuous inspection schemes,","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.732363Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:c5b0f9b1e876c26ba1bc8a10d5b6214c44c57aec735d3e0fbcf9aaa3c5c37fd4","observation_id":"fe94e2a8-a507-4106-807e-2ea13a75da82","resolution":{"observed_at":"2026-08-04T17:31:24.732363Z","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-04T17:31:24.798093Z","title":"Optimal stopping times for detecting changes in distributions,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.798093Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:ff0ecf9622c8880ba063520440ec3732786d78099dd2eb751fc47faec1e67152","observation_id":"80aa835b-7ed4-4fbd-aa5a-190b5df4f61a","resolution":{"observed_at":"2026-08-04T17:31:24.798093Z","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-04T17:31:24.858560Z","title":"Robust Score- Based Quickest Change Detection,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T17:31:24.858560Z"},"links":{"citing_paper":"/paper/2509.10925"},"observation_digest":"sha256:c849c3cb672aaa0bf2c70ad9d9ed6ec4506195ebc17cf442f73f052ea36107f9","observation_id":"ca018738-b58c-4227-8d16-945441d7a746","resolution":{"observed_at":"2026-08-04T17:31:24.858560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10925","last_updated":"2025-09-13T17:58:23Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-09T01:56:29.041751Z","submitted_at":"2025-09-13T17:58:23Z","title":"Detectability Thresholds for Network Attacks on Static Graphs and Temporal Networks: Information-Theoretic Limits and Nearly-Optimal Tests"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2509.10925."}