{"as_of":"2026-08-10T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6708871c4bb3f5c1a354a114bce6e710abeb9a6969e287ee4a044d73ef6e4cad","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T10:43:49.256303Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2501.16794/citation-record","integrity":"/paper/2501.16794/integrity","json":"/paper/2501.16794/citation-record.json","paper":"/paper/2501.16794"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.04366","last_updated":"2022-02-02T16:39:23Z","snapshot_observed_at":"2026-08-09T04:45:04.547249Z","submitted_at":"2021-10-08T20:22:26Z","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04366","snapshot_observed_at":"2026-08-10T10:43:49.203879Z","title":"Preprint, arXiv:2110.04366","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.203879Z"},"links":{"cited_paper":"/paper/2110.04366","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:d53d54ef697bd0385cf4309d5e0df1184e7358c4710f21a14b101a050540a154","observation_id":"075e8262-c93f-495f-9601-65a4715ba3db","resolution":{"observed_at":"2026-08-10T10:43:49.203879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.08340","last_updated":"2022-04-13T10:10:35Z","snapshot_observed_at":"2026-08-10T18:46:38.972542Z","submitted_at":"2021-12-15T18:45:14Z","title":"GenIE: Generative Information Extraction","version":3},"cited_work":{"arxiv_id":"2112.08340","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.08340","snapshot_observed_at":"2026-08-10T10:43:49.418028Z","title":"GenIE: Generative Information Extraction","venue":"cs.CL","work_id":"47fc19cf-4c11-4803-a3cc-ffcdd29d53d4","year":2021},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.219505Z"},"links":{"cited_paper":"/paper/2112.08340","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:7bf0462341436b5576a988b9a8946da99130bdfec8287bf6bd2f5e750b2d76c1","observation_id":"282f760c-2c35-4c9d-bc41-b5ec11e7d753","resolution":{"observed_at":"2026-08-10T10:43:49.422761Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00190","last_updated":"2021-01-01T08:00:36Z","snapshot_observed_at":"2026-07-06T10:29:18.734092Z","submitted_at":"2021-01-01T08:00:36Z","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00190","snapshot_observed_at":"2026-08-10T10:43:49.224768Z","title":"Preprint, arXiv:2101.00190","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.224768Z"},"links":{"cited_paper":"/paper/2101.00190","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:15a3f9779f47b64e4bac0509d1768ac809fe61ada4c3730d41a0f13974f92b60","observation_id":"fcb89dcf-11c9-4243-9108-ddb7456197c8","resolution":{"observed_at":"2026-08-10T10:43:49.224768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10385","last_updated":"2023-10-25T06:15:58Z","snapshot_observed_at":"2026-08-10T18:45:39.374133Z","submitted_at":"2021-03-18T17:13:50Z","title":"GPT Understands, Too","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10385","snapshot_observed_at":"2026-08-10T10:43:49.230377Z","title":"Preprint, arXiv:2103.10385","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.230377Z"},"links":{"cited_paper":"/paper/2103.10385","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:4f8c62a275537a1b8a469f717e5710c9d9eee8d8aec890251e295a9373ca1fab","observation_id":"0132b675-9373-4a42-b79f-ee839b5fd6de","resolution":{"observed_at":"2026-08-10T10:43:49.230377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.10687","last_updated":"2020-03-24T07:01:09Z","snapshot_observed_at":"2026-08-10T18:46:45.103941Z","submitted_at":"2020-03-24T07:01:09Z","title":"Felix: Flexible Text Editing Through Tagging and Insertion","version":1},"cited_work":{"arxiv_id":"2003.10687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.10687","snapshot_observed_at":"2026-08-10T10:43:49.364681Z","title":"Felix: Flexible Text Editing Through Tagging and Insertion","venue":"cs.CL","work_id":"760df65a-0d34-4ec5-b92c-da696645f128","year":2020},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.235438Z"},"links":{"cited_paper":"/paper/2003.10687","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:c426ae462fa8b47dc79f0c4d50a8a8a0394c83b64d828106f7ff56ba39f4f0ee","observation_id":"7b0f94cb-1259-4290-8751-0f9c7f765e8b","resolution":{"observed_at":"2026-08-10T10:43:49.370534Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.01187","last_updated":"2019-09-03T13:54:52Z","snapshot_observed_at":"2026-08-10T18:46:40.096373Z","submitted_at":"2019-09-03T13:54:52Z","title":"Encode, Tag, Realize: High-Precision Text Editing","version":1},"cited_work":{"arxiv_id":"1909.01187","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.01187","snapshot_observed_at":"2026-08-10T10:43:49.339696Z","title":"Encode, Tag, Realize: High-Precision Text Editing","venue":"cs.CL","work_id":"f60c8578-b642-4554-9735-81e03c2c7f14","year":2019},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.240648Z"},"links":{"cited_paper":"/paper/1909.01187","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:75188bb2e00c82f1afb2fd194e9aa253eaa370d8aca6b3004dbf9662d0e39ac0","observation_id":"20c788de-9215-4a6f-a072-05538fe4f04b","resolution":{"observed_at":"2026-08-10T10:43:49.347072Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10683","last_updated":"2023-09-19T15:14:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-23T17:37:36Z","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.10683","snapshot_observed_at":"2026-08-10T10:43:49.245673Z","title":"Preprint, arXiv:1910.10683","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.245673Z"},"links":{"cited_paper":"/paper/1910.10683","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:c6b6ae2b78f43c5c5aa1abe3e4f9ee7d6f0e7a7752c5fabecc831fbcf126c669","observation_id":"60ede25b-7a49-4941-9f3e-7733a0e50c36","resolution":{"observed_at":"2026-08-10T10:43:49.245673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05255","last_updated":"2019-04-10T15:52:13Z","snapshot_observed_at":"2026-08-03T07:22:24.476902Z","submitted_at":"2019-04-10T15:52:13Z","title":"Simple BERT Models for Relation Extraction and Semantic Role Labeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05255","snapshot_observed_at":"2026-08-10T10:43:49.250876Z","title":"Preprint, arXiv:1904.05255","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.250876Z"},"links":{"cited_paper":"/paper/1904.05255","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:f49873f1b1f6aedc0a747b649a545aad122da12233e50a15824227f6075e74c6","observation_id":"c5b4677c-ccad-4272-90c1-a3fe25e3e67e","resolution":{"observed_at":"2026-08-10T10:43:49.250876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.01652","last_updated":"2022-02-08T20:26:45Z","snapshot_observed_at":"2026-08-10T07:52:08.606999Z","submitted_at":"2021-09-03T17:55:52Z","title":"Finetuned Language Models Are Zero-Shot Learners","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.01652","snapshot_observed_at":"2026-08-10T10:43:49.256303Z","title":"Preprint, arXiv:2109.01652","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.256303Z"},"links":{"cited_paper":"/paper/2109.01652","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:a720ebf3b9caf9d556b80f260d909498fa6f6d094b8b5112e90913b2d0e54091","observation_id":"f1f82c3a-ec46-49f0-be8e-14dbeb3b92b6","resolution":{"observed_at":"2026-08-10T10:43:49.256303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00751","last_updated":"2019-06-13T17:48:30Z","snapshot_observed_at":"2026-07-06T07:30:44.870185Z","submitted_at":"2019-02-02T16:29:47Z","title":"Parameter-Efficient Transfer Learning for NLP","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.00751","snapshot_observed_at":"2026-08-10T10:43:49.208735Z","title":"Preprint, arXiv:1902.00751","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.208735Z"},"links":{"cited_paper":"/paper/1902.00751","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:91e770d716ebf724efb6bb693c80eb5a81b1f084eec7bb6c3f335dc32a806081","observation_id":"b4cde53e-0d92-4056-9585-89fd63adbd2f","resolution":{"observed_at":"2026-08-10T10:43:49.208735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-10T10:43:49.189138Z","title":"Preprint, arXiv:2005.14165","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.189138Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:503c80d0b8295ea7e715676b970562960ae5ba2bd55dcc3fca5ef5a15610bc34","observation_id":"1aca038c-3835-4c73-a9d3-bb20a9cc84c0","resolution":{"observed_at":"2026-08-10T10:43:49.189138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-10T10:43:49.214184Z","title":"Preprint, arXiv:2106.09685","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.214184Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:fa6d8273e93782309e13497d79cb57bdf52efd19bfc77a90819291eb1fe9d6ba","observation_id":"efef9b34-9353-42f0-a79c-20a4aca48e96","resolution":{"observed_at":"2026-08-10T10:43:49.214184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-07-06T14:08:18.855958Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-08-10T10:43:49.194401Z","title":"Preprint, arXiv:2210.11416","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.194401Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:836ea8ee91358dcc7aaf3a194f6c819fe2d16873d9938680df3c18e074648616","observation_id":"27fe1bc9-20f6-42e3-b991-1e479420adb5","resolution":{"observed_at":"2026-08-10T10:43:49.194401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14314","last_updated":"2023-05-23T17:50:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:50:33Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14314","snapshot_observed_at":"2026-08-10T10:43:49.199142Z","title":"Preprint, arXiv:2305.14314","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T10:43:49.199142Z"},"links":{"cited_paper":"/paper/2305.14314","citing_paper":"/paper/2501.16794"},"observation_digest":"sha256:6fbd3671e374e61c732731cb0410d9e37ce2883045eaec843fbce1086855b97f","observation_id":"4de871c6-b85a-47ee-b19f-502ba6f8f28b","resolution":{"observed_at":"2026-08-10T10:43:49.199142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.16794","last_updated":"2025-01-28T08:52:33Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T18:46:24.733814Z","submitted_at":"2025-01-28T08:52:33Z","title":"Algorithm for Automatic Legislative Text Consolidation"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":14},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2501.16794."}