{"as_of":"2026-08-04T04:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48ba947a6ef73040508f4e92af1224959624e66c2758ac8793deb7d8a8763fb1","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T13:33:22.947565Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2604.26209/citation-record","integrity":"/paper/2604.26209/integrity","json":"/paper/2604.26209/citation-record.json","paper":"/paper/2604.26209"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"InProceedings of the 2020 Con- ference on Empirical Methods in Natural Language Processing (EMNLP), pages 268–284","venue":null,"work_id":"40a83df7-1bb5-4625-b494-8e0dd190db37","year":2020},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:060c520eecccb5d002d27d079f301dc72e27e66e26a50543c554c4c5abc41910","observation_id":"c0e01740-9bd3-44f4-9b6a-29066a5e02fa","resolution":{"observed_at":"2026-05-27T05:38:38.538515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":"2307.08691","doi":"10.48550/arxiv.2307.08691","metadata_source":"pith","pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-07-10T20:07:33.508131Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","venue":"cs.LG","work_id":"fff3953b-5efb-4753-bee4-002f59995810","year":2023},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:42a94cf6b677d39b97755c12c55e7f661dd79bae044a4471e7c7ad829fb3e7f1","observation_id":"ee4bd050-b821-4bbd-826e-17e432af893f","resolution":{"observed_at":"2026-05-12T08:51:25.711704Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-13T15:50:18.243793+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T15:50:18.243793+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03952","last_updated":"2026-04-20T06:05:54Z","snapshot_observed_at":"2026-08-03T00:56:47.399756Z","submitted_at":"2024-03-06T18:56:36Z","title":"Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoders","version":2},"cited_work":{"arxiv_id":"2403.03952","doi":"10.1007/978-3-031-56060-6","metadata_source":"pith","pith_arxiv_id":"2403.03952","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoders","venue":"cs.IR","work_id":"357c2b19-af52-48bc-a55a-e34d2d84b8ff","year":2024},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"cited_paper":"/paper/2403.03952","citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:0c421d29cf73b5b04426975a5ca29f9aed1aeea019d4a263148dfe4af53799cd","observation_id":"ac8a0982-2697-4e45-9b84-e97fc8fcffaa","resolution":{"observed_at":"2026-05-12T08:51:25.717446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Yaniv Leviathan, Matan Kalman, and Yossi Matias","venue":null,"work_id":"07342095-abaa-41e4-9205-fb8410e5a8d0","year":null},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:748c56cdc6a277328304030e3ad2102471192e292e57e4b1ef579120944a01f8","observation_id":"ef7ee5bf-39bb-49df-8fee-8a889a56031b","resolution":{"observed_at":"2026-05-27T05:38:38.526570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06761","last_updated":"2024-01-12T18:50:36Z","snapshot_observed_at":"2026-07-06T17:14:53.706063Z","submitted_at":"2024-01-12T18:50:36Z","title":"APAR: LLMs Can Do Auto-Parallel Auto-Regressive Decoding","version":1},"cited_work":{"arxiv_id":"2401.06761","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.06761","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Apar: Llms can do auto-parallel auto-regressive decoding","venue":null,"work_id":"b067583c-0889-4208-8e98-41783b2ad806","year":2024},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"cited_paper":"/paper/2401.06761","citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:06c50532409684088f54c123f284f3f3913c84fced0c90a2903a927bd21b2dbe","observation_id":"85861b8f-65e1-4bb6-9607-8a27998040e9","resolution":{"observed_at":"2026-05-12T08:51:25.714733Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"InProceedings of the Fif- teenth ACM International Conference on Web Search and Data Mining, WSDM ’22, page 1256–1265","venue":null,"work_id":"66ee620c-2b30-454f-8a87-ab39faaea1cf","year":2009},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:2ed2ade54fa13e37a82392d2d5ad3275740842935295ee065aa815ef7cd90622","observation_id":"2cd16d52-7972-4e3d-92eb-fca274cd1103","resolution":{"observed_at":"2026-05-27T05:38:38.522739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"InProceedings of the 2020 Con- ference on Empirical Methods in Natural Language Processing (EMNLP), pages 2407–2417, Online","venue":null,"work_id":"984fa199-4249-41a7-850c-e7974f84c57f","year":2020},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:659371b405eacac070919ae50465937171359ee18c43a7b5b5fefab6b5f31dc6","observation_id":"3952ba9c-9208-45c8-b3fb-a7c830e55cd3","resolution":{"observed_at":"2026-05-27T05:38:38.531100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14294","last_updated":"2024-07-19T04:47:36Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T15:53:08Z","title":"A Survey on Efficient Inference for Large Language Models","version":3},"cited_work":{"arxiv_id":"2404.14294","doi":"10.48550/arxiv.2404.14294","metadata_source":"pith","pith_arxiv_id":"2404.14294","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"A Survey on Efficient Inference for Large Language Models","venue":"cs.CL","work_id":"4e58b7d0-2870-4ddb-955f-798b34deb447","year":2024},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"cited_paper":"/paper/2404.14294","citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:efff64ffdb10cfa0058a464848c1715d120fe6aa989580702ff7dca0098e1c23","observation_id":"b569ecd5-0c79-4571-b3de-c3ebf9beced2","resolution":{"observed_at":"2026-05-15T02:39:33.856027Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-05-24T00:53:38.535897+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T00:53:38.535897+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"correct\", CN=","venue":null,"work_id":"c1f84069-8037-4e7d-9b37-7dd4b326f412","year":2025},"citing_paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T13:33:22.947565Z"},"links":{"citing_paper":"/paper/2604.26209"},"observation_digest":"sha256:000c84c8383918196351303eca4bb9d438c5fdcd7c62f29c2c9c8bd315cf1ee9","observation_id":"dfd8173d-e87a-4326-bd0f-c186b611ab7c","resolution":{"observed_at":"2026-05-27T05:38:38.534654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.26209","last_updated":"2026-04-29T01:26:15Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T23:11:57.238808Z","submitted_at":"2026-04-29T01:26:15Z","title":"Breaking the Autoregressive Chain: Hyper-Parallel Decoding for Efficient LLM-Based Attribute Value Extraction"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":9},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2604.26209."}