{"as_of":"2026-08-11T18:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62bc09921429fe1778bc374b139ad236cca88b7e4a7aa1064ca269a6efe008f5","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:25:48.622037Z","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-06-29T11:53:24.187933Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00001","last_updated":"2024-06-11T09:08:15Z","snapshot_observed_at":"2026-07-06T17:23:14.388964Z","submitted_at":"2023-09-20T23:40:40Z","title":"Using binary string to prove the Collatz conjecture","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00001","snapshot_observed_at":"2026-08-05T15:25:48.622037Z","title":"Opitz, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19896","last_updated":"2025-08-27T13:53:04Z","snapshot_observed_at":"2026-08-08T10:55:18.269405Z","submitted_at":"2025-08-27T13:53:04Z","title":"NM-Hebb: Coupling Local Hebbian Plasticity with Metric Learning for More Accurate and Interpretable CNNs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T15:25:48.622037Z"},"links":{"cited_paper":"/paper/2402.00001","citing_paper":"/paper/2508.19896"},"observation_digest":"sha256:2d8ee8b0b40eb9e38b0903414494259933491383ab9dc70af3ec78e068049b28","observation_id":"cb97607b-e9d1-4f79-a94f-7df9593aa9cd","resolution":{"observed_at":"2026-08-05T15:25:48.622037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00001","last_updated":"2024-06-11T09:08:15Z","snapshot_observed_at":"2026-07-06T17:23:14.388964Z","submitted_at":"2023-09-20T23:40:40Z","title":"Using binary string to prove the Collatz conjecture","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00001","snapshot_observed_at":"2026-08-03T19:31:36.879217Z","title":"Wang et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.00319","last_updated":"2026-07-17T02:50:16Z","snapshot_observed_at":"2026-08-09T10:29:07.979986Z","submitted_at":"2025-11-29T04:47:14Z","title":"RL-Struct: A Lightweight Reinforcement Learning Framework for Reliable Structured Output in LLMs","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T19:31:36.879217Z"},"links":{"cited_paper":"/paper/2402.00001","citing_paper":"/paper/2512.00319"},"observation_digest":"sha256:17945be3bea5be25a22751d689b5fedb6c8d71aaf9ccd46a164f962774229904","observation_id":"ea1e1a49-f5c2-4868-9c85-a45b836fbc41","resolution":{"observed_at":"2026-08-03T19:31:36.879217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00001","last_updated":"2024-06-11T09:08:15Z","snapshot_observed_at":"2026-07-06T17:23:14.388964Z","submitted_at":"2023-09-20T23:40:40Z","title":"Using binary string to prove the Collatz conjecture","version":3},"cited_work":{"arxiv_id":"2402.00001","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00001","snapshot_observed_at":"2026-06-29T11:53:24.187933Z","title":"Mishra et al","venue":null,"work_id":"4fe6e56c-891c-4846-b227-8f95dc7021b8","year":2024},"citing_paper":{"arxiv_id":"2605.28607","last_updated":"2026-05-27T15:23:22Z","snapshot_observed_at":"2026-08-07T02:06:56.830080Z","submitted_at":"2026-05-27T15:23:22Z","title":"Adaptive Multimodal Agents-Based Framework for Automatic Workflow Execution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T11:47:02.193326Z"},"links":{"cited_paper":"/paper/2402.00001","citing_paper":"/paper/2605.28607"},"observation_digest":"sha256:7e29d2540e981868d56e6ddccffed9373b16fcd40dc627a56c242773f0ad54c4","observation_id":"d6dfa86e-44dd-45bf-83fb-f800833d29c0","resolution":{"observed_at":"2026-06-29T11:53:24.189389Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.00001/citation-record","integrity":"/paper/2402.00001/integrity","json":"/paper/2402.00001/citation-record.json","paper":"/paper/2402.00001"},"outbound":[],"paper":{"arxiv_id":"2402.00001","last_updated":"2024-06-11T09:08:15Z","latest_version":3,"primary_category":"math.GM","snapshot_observed_at":"2026-07-06T17:23:14.388964Z","submitted_at":"2023-09-20T23:40:40Z","title":"Using binary string to prove the Collatz conjecture"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.00001."}