{"as_of":"2026-08-20T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70d16313a3a2ddd0eaaf6ca7d227b7505445933af4c958454ad4f9cc17599520","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:12:44.270712Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T00:46:23.565235Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-08-09T14:12:44.270712Z","title":"igraph enables fast and robust network analysis across programming languages.arXiv preprint arXiv:2311.10260v1, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01892","last_updated":"2025-06-12T03:37:06Z","snapshot_observed_at":"2026-08-14T06:48:09.568613Z","submitted_at":"2025-02-03T23:58:23Z","title":"Improving exponential-family random graph models for bipartite networks","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-09T14:12:44.270712Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2502.01892"},"observation_digest":"sha256:5df161daff1e0c8e4bab3734f161aca7f7f340897c1ebc30228f8f0cf58b4f9b","observation_id":"47e37ab4-3472-4a9e-96cd-42e754cd127d","resolution":{"observed_at":"2026-08-09T14:12:44.270712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-08-06T23:59:22.238198Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.15761","last_updated":"2025-06-18T15:31:26Z","snapshot_observed_at":"2026-08-17T23:37:15.578911Z","submitted_at":"2025-06-18T15:31:26Z","title":"Advancing Digital Precision Medicine for Chronic Fatigue Syndrome through Longitudinal Large-Scale Multi-Modal Biological Omics Modeling with Machine Learning and Artificial Intelligence","version":1},"reference_index":167,"source":"pdf_text","source_observed_at":"2026-08-06T23:59:22.238198Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2506.15761"},"observation_digest":"sha256:c6ee362d9b254eebcb4b086f3a0b5428c5bd4d3ecb6ebfcd7dd3c69a715812db","observation_id":"0c200370-9f0e-4ac6-8d01-b618eef4be53","resolution":{"observed_at":"2026-08-06T23:59:22.238198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-08-03T16:43:03.731133Z","title":"(2013), ‘Diversity in riverine metacommunities: a network perspective’, Aquatic Ecology 47(3), 365–377","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.12398","last_updated":"2026-05-22T21:31:25Z","snapshot_observed_at":"2026-08-19T04:51:42.813429Z","submitted_at":"2025-12-13T17:09:22Z","title":"Scalable Spatial Stream Network (S3N) Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T16:43:03.731133Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2512.12398"},"observation_digest":"sha256:fed903701a49b3f5bd60114e8983b38eb3f8bc883613e0911d756fc23f6fda20","observation_id":"9448f465-406e-48bb-a34e-946d92ff81d8","resolution":{"observed_at":"2026-08-03T16:43:03.731133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":"2311.10260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-07-02T00:46:23.565235Z","title":"arXiv preprint arXiv:2311.10260 , year =","venue":null,"work_id":"60a4121c-9419-418f-80bf-00f85aa8e54b","year":null},"citing_paper":{"arxiv_id":"2607.00317","last_updated":"2026-07-03T04:24:21Z","snapshot_observed_at":"2026-08-13T16:51:35.479964Z","submitted_at":"2026-07-01T01:33:41Z","title":"Economic Disparities and Their Relationship to Destructive Health Behaviors in Five Western U.S. States","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-02T00:44:30.271190Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2607.00317"},"observation_digest":"sha256:92143f2242f9a47e2347f736363e075bcb1144a3afc5cb26399703f226c80a08","observation_id":"1dd87594-cd7f-486d-bdf9-c0c90dc52c54","resolution":{"observed_at":"2026-07-02T00:46:23.567428Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-07-12T09:35:49.813215Z","title":"arXiv preprint arXiv:2311.10260 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.00317","last_updated":"2026-07-03T04:24:21Z","snapshot_observed_at":"2026-08-13T16:51:35.479964Z","submitted_at":"2026-07-01T01:33:41Z","title":"Economic Disparities and Their Relationship to Destructive Health Behaviors in Five Western U.S. States","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-12T09:35:49.813215Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2607.00317"},"observation_digest":"sha256:9b795f8dee3f417c99c54b32c4a4893aa472331022674b909d512ffa7079a4c4","observation_id":"9e51bc63-7961-41b8-b44e-c2301acbbfc0","resolution":{"observed_at":"2026-07-12T09:35:49.813215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-07-30T23:55:08.009139Z","title":"Antonov, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26690","last_updated":"2026-07-29T09:39:19Z","snapshot_observed_at":"2026-08-10T06:27:16.108225Z","submitted_at":"2026-07-29T09:39:19Z","title":"Tournaments determined by three and five voters","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T23:55:08.009139Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2607.26690"},"observation_digest":"sha256:5c03c5d95ced9aba6e5103c88d6c148153e5c9c4245f713d58b8321dd7176893","observation_id":"384ff3f9-6af2-49e2-bff7-8350914cd617","resolution":{"observed_at":"2026-07-30T23:55:08.009139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10260","snapshot_observed_at":"2026-08-08T15:08:28.677466Z","title":"F.; Zanini, F","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05336","last_updated":"2026-08-05T18:50:21Z","snapshot_observed_at":"2026-08-18T14:49:46.600235Z","submitted_at":"2026-08-05T18:50:21Z","title":"Physics-Based Molecular Fingerprints from Spectral Graph Theory Provide Efficient Geometry-Aware Measures of Chemical Similarity","version":1},"reference_index":1695,"source":"pdf_text","source_observed_at":"2026-08-08T15:08:28.677466Z"},"links":{"cited_paper":"/paper/2311.10260","citing_paper":"/paper/2608.05336"},"observation_digest":"sha256:93ce24b676fbc6b11bd1b29c2fa9a32edf1307dd21c2ad36d225a312ebbdb0d8","observation_id":"dee0713f-d88e-4b56-85e5-ddd7cd5c3d19","resolution":{"observed_at":"2026-08-08T15:08:28.677466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.10260/citation-record","integrity":"/paper/2311.10260/integrity","json":"/paper/2311.10260/citation-record.json","paper":"/paper/2311.10260"},"outbound":[],"paper":{"arxiv_id":"2311.10260","last_updated":"2023-11-17T01:05:13Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-16T14:42:31.706371Z","submitted_at":"2023-11-17T01:05:13Z","title":"igraph enables fast and robust network analysis across programming languages"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2311.10260."}