{"as_of":"2026-08-15T21:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b87595f30b624a56e29177912a43a4181b73ce5410d49fcbd794887f18d368b","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-15T06:32:42.880941+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-08-13T04:13:20.465752Z","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-14T04:24:00.137795Z","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:6e5211feda6239ea47a85d75f3426583e323053aa40443d113e3337b539d3669","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-14T04:24:00.137795Z","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:706c2007f4926f74e16834b832e4cd2426f3db8a530060229f6abff6b3afd423","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-14T04:24:00.137795Z","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:96368750cbc916b2b5212baf3c443c855293c9c1e0f1be6e9146f58618a95375","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-14T04:24:00.137795Z","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:ce28cde0295f308e05f14ac8101095a6ea9406a0bd28f7b0d060030bdc3e35ce","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-14T04:24:00.137795Z","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:abfd33b5bbc5b250706a798b07594ebf837152caab1516b727772b5d1d9f7d85","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-14T04:24:00.137795Z","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:f7852d99a201469b4182e4bd5ad8d949b839f479ecd72ccee47ffc8ae4849199","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-14T04:24:00.137795Z","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:488a2fbfae7dc23dbc76bd40f7a940868c34beeb5b38a9af67858c74fd3afe84","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-14T04:24:00.137795Z","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:98d6d7859ac936329ab82a9c9bc7c95d57e83a7f89cfac329a2fe3a7154d9f1b","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-13T13:52:51.292610Z","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-14T04:24:00.137795Z","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:864b254243d4ae6d030d6b72dd1abf490e1e70f78c303da0c8797f0df92639ac","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-14T04:24:00.137795Z","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:56d801d13e3c7b76b3f0b5d2ccdabf9caa5643709e2361bf030ffb8eaa332f10","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-14T04:24:00.137795Z","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:e404f0b5f0ba50c366f7c910fa94f67fd17943f929f0e296791cb38766af15f8","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-14T04:24:00.137795Z","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:db9438c3b13244ee2a98b6c35ca72c26bdcb3bc880f6d34e12a1edc3e0e13921","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-14T04:24:00.137795Z","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:e03c2867cf27edb0ec2a0675ce2e701dc4f73014d1d0288ef5adb32de71c904b","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-14T04:24:00.137795Z","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:ab54b98203c8db8c57b730f208824b94ce7cf5b5be7cbeb803a20baf7e3f430a","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-14T04:24:00.137795Z","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:aee2380edce4aa6d5d3dcd715fae6563ac3e43714641929d9737b326b1664c21","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-14T04:24:00.137795Z","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:6f18d1bfcb1334d56349ce0db30e3e15412a9c8c52092a334da99c0c0498c6db","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-14T04:24:00.137795Z","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:361f11c181623590d6033aeb046d40102085740e449e2a1e4fcde273e487efc0","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-14T04:24:00.137795Z","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:ec2c865000bc26d10ca211a8a7d50dd4af99f9d20d788723231d4828de826cab","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-14T04:24:00.137795Z","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:51a952854157a0d8c0327d097bf26a6d4c350512bab8377c691f11db6af9b5fd","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-14T04:24:00.137795Z","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:38c5800fd4858ec1bb965ab3b71fdc52c2a86b2453be85ee3283895adf54354e","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-14T04:24:00.137795Z","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:3dfe128e8ef9bc7573e9435c06fe6ea75e4ec83e6b67d5002283f2205440f1f1","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-14T04:24:00.137795Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2509.10925."}