{"as_of":"2026-08-15T22:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0cbbbf968ad4459d6b15e0930de324ea21ba4274cdb51e99f362f43d98f88d1","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:46:08.560118Z","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-30T20:35:02.891398Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-07T10:46:08.560118Z","title":"Asynchronous llm function calling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04477","last_updated":"2025-07-15T03:09:48Z","snapshot_observed_at":"2026-08-14T18:33:52.985799Z","submitted_at":"2025-06-04T21:51:03Z","title":"Neural Object Detection for 4D STEM: High-Throughput Sub-Pixel Electron Diffraction Pattern Recognition","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:46:08.560118Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2506.04477"},"observation_digest":"sha256:36dd01b479226fed345c6597fe8e457e6720a74caf43a6cc432e3424933d5074","observation_id":"675c07a9-b58d-4da3-9e00-7a74985b8053","resolution":{"observed_at":"2026-08-07T10:46:08.560118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-06T18:45:05.106051Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08877","last_updated":"2025-07-10T04:44:47Z","snapshot_observed_at":"2026-08-13T21:43:04.842316Z","submitted_at":"2025-07-10T04:44:47Z","title":"ODIA: Oriented Distillation for Inline Acceleration of LLM-based Function Calling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:45:05.106051Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2507.08877"},"observation_digest":"sha256:92fdeb37600ff8f35735e60cc1ff131e8acb8050af2acd44a7a1ca8a56b6370c","observation_id":"32d19d2f-13a5-417f-8f8f-bb368c7008d3","resolution":{"observed_at":"2026-08-06T18:45:05.106051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":"2412.07017","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-06-30T20:35:02.891398Z","title":"Asynchronous LLM function calling","venue":null,"work_id":"0bc8b609-f05c-44f9-976f-7440173d93a6","year":2024},"citing_paper":{"arxiv_id":"2511.02230","last_updated":"2026-05-25T23:34:23Z","snapshot_observed_at":"2026-08-04T00:19:14.332924Z","submitted_at":"2025-11-04T03:43:05Z","title":"Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T01:58:23.234348Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2511.02230"},"observation_digest":"sha256:9cb568516be774c2b297a0e0594f10341f0177dc566ad27068f4f22886de7b68","observation_id":"d21218ca-743b-45da-adb1-c34c266ff60e","resolution":{"observed_at":"2026-05-18T02:00:39.777660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-04T00:19:17.591311Z","title":"Asynchronous llm function calling.arXiv preprint arXiv:2412.07017, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02230","last_updated":"2026-05-25T23:34:23Z","snapshot_observed_at":"2026-08-04T00:19:14.332924Z","submitted_at":"2025-11-04T03:43:05Z","title":"Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live","version":6},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T00:19:17.591311Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2511.02230"},"observation_digest":"sha256:511939b4a8c3ee8c0335d44f9962fc9cd9ab91f4d106975cd14a14243c7201c2","observation_id":"84d02877-c1d8-4186-850d-e74e8123e69e","resolution":{"observed_at":"2026-08-04T00:19:17.591311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-03T18:43:29.008241Z","title":"Asynchronous llm function calling.arXiv preprint arXiv:2412.07017, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.04013","last_updated":"2026-07-10T15:00:48Z","snapshot_observed_at":"2026-08-08T06:32:13.288719Z","submitted_at":"2025-12-03T17:49:38Z","title":"AugServe: Adaptive Request Scheduling for Augmented Large Language Model Inference Serving","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T18:43:29.008241Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2512.04013"},"observation_digest":"sha256:0ba10dadbe524da4b4468ff6e7b9701bd98f3f2882a73a9f85f53e865aefe319","observation_id":"cd7e3ae0-b221-4779-996c-64e3fa541e64","resolution":{"observed_at":"2026-08-03T18:43:29.008241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-03T08:03:52.847227Z","title":"Asynchronous llm function calling.arXiv preprint arXiv:2412.07017, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.18381","last_updated":"2026-05-26T16:03:59Z","snapshot_observed_at":"2026-08-15T21:29:45.180582Z","submitted_at":"2026-01-26T11:31:00Z","title":"AI Agent for Reverse-Engineering Legacy Finite-Difference Code and Translating to Devito","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T08:03:52.847227Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2601.18381"},"observation_digest":"sha256:5e3b94f5d07531c30ade7950ad8895d534ae836473b2ddce9369eb49a3d323df","observation_id":"4554176c-194f-4aba-aa70-f59504e17e16","resolution":{"observed_at":"2026-08-03T08:03:52.847227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-08-02T23:06:03.311000Z","title":"URL https: //arxiv.org/abs/2412.07017","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.14849","last_updated":"2026-05-29T14:05:41Z","snapshot_observed_at":"2026-08-15T10:08:05.135434Z","submitted_at":"2026-02-16T15:46:19Z","title":"Atomix: Timely, Transactional Tool Use for Reliable Agentic Workflows","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T23:06:03.311000Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2602.14849"},"observation_digest":"sha256:187e7d9c2fc9ffd4bc2a23f911ea1b294e177df23eab03a4fcd9cbbc39e1951b","observation_id":"bda6a6bd-3050-4929-b182-227fd0b12375","resolution":{"observed_at":"2026-08-02T23:06:03.311000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":"2412.07017","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-06-30T20:35:02.891398Z","title":"Asynchronous LLM function calling","venue":null,"work_id":"0bc8b609-f05c-44f9-976f-7440173d93a6","year":2024},"citing_paper":{"arxiv_id":"2605.15077","last_updated":"2026-05-14T17:02:28Z","snapshot_observed_at":"2026-08-14T20:53:27.115446Z","submitted_at":"2026-05-14T17:02:28Z","title":"Concurrency without Model Changes: Future-based Asynchronous Function Calling for LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T20:27:52.720629Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2605.15077"},"observation_digest":"sha256:8a3e489400a3a77b27329c0c63747d6dab1fdf5a8134635bf049de355da35465","observation_id":"e2ecd7d1-fdfe-4e90-97b7-f16d2e062f92","resolution":{"observed_at":"2026-06-30T20:35:02.892843Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":"2412.07017","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-06-30T20:35:02.891398Z","title":"Asynchronous LLM function calling","venue":null,"work_id":"0bc8b609-f05c-44f9-976f-7440173d93a6","year":2024},"citing_paper":{"arxiv_id":"2605.22154","last_updated":"2026-05-21T08:25:17Z","snapshot_observed_at":"2026-08-15T09:16:41.795797Z","submitted_at":"2026-05-21T08:25:17Z","title":"IdleSpec: Exploiting Idle Time via Speculative Planning for LLM Agents","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T06:21:56.971204Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2605.22154"},"observation_digest":"sha256:2f83dbbe2b9cf1323580802666be52eb3d4bbba345508083afc233867827e867","observation_id":"57f2dcea-25b1-4baa-9286-07e3dba0e5ec","resolution":{"observed_at":"2026-05-22T06:24:40.478868Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling","version":1},"cited_work":{"arxiv_id":"2412.07017","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.07017","snapshot_observed_at":"2026-06-30T20:35:02.891398Z","title":"Asynchronous LLM function calling","venue":null,"work_id":"0bc8b609-f05c-44f9-976f-7440173d93a6","year":2024},"citing_paper":{"arxiv_id":"2605.22733","last_updated":"2026-05-21T17:03:44Z","snapshot_observed_at":"2026-08-13T11:37:14.432232Z","submitted_at":"2026-05-21T17:03:44Z","title":"HarnessAPI: A Skill-First Framework for Unified Streaming APIs and MCP Tools","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T05:21:46.992441Z"},"links":{"cited_paper":"/paper/2412.07017","citing_paper":"/paper/2605.22733"},"observation_digest":"sha256:fc97a297c42be4389120ca2fc353029b7e3a779626853228cff10289444e65d8","observation_id":"de3133ab-6b55-486a-b1ee-74375a2b14af","resolution":{"observed_at":"2026-05-22T05:24:38.246181Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.07017/citation-record","integrity":"/paper/2412.07017/integrity","json":"/paper/2412.07017/citation-record.json","paper":"/paper/2412.07017"},"outbound":[],"paper":{"arxiv_id":"2412.07017","last_updated":"2024-12-09T21:53:10Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-11T19:11:01.868140Z","submitted_at":"2024-12-09T21:53:10Z","title":"Asynchronous LLM Function Calling"},"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-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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2412.07017."}