{"as_of":"2026-08-15T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7cdae186df5857969ed2c8003872bb4328a82a490de6e139f8a74043fd62bfc9","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:24:11.799152Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T16:40:37.054664Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17438","last_updated":"2024-05-07T18:55:50Z","snapshot_observed_at":"2026-08-14T17:09:27.735239Z","submitted_at":"2024-05-07T18:55:50Z","title":"An LLM-Tool Compiler for Fused Parallel Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17438","snapshot_observed_at":"2026-08-12T14:24:11.799152Z","title":"An llm-tool compiler for fused parallel function calling,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15399","last_updated":"2024-11-23T00:51:09Z","snapshot_observed_at":"2026-08-14T12:58:20.383033Z","submitted_at":"2024-11-23T00:51:09Z","title":"Less is More: Optimizing Function Calling for LLM Execution on Edge Devices","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:24:11.799152Z"},"links":{"cited_paper":"/paper/2405.17438","citing_paper":"/paper/2411.15399"},"observation_digest":"sha256:c7497c236f29d7766a2f660538c3141f1d439d95aac8eecdbb05efeb56b2ace9","observation_id":"432161f8-3806-4356-b44f-f3c74e7d0c70","resolution":{"observed_at":"2026-08-12T14:24:11.799152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17438","last_updated":"2024-05-07T18:55:50Z","snapshot_observed_at":"2026-08-14T17:09:27.735239Z","submitted_at":"2024-05-07T18:55:50Z","title":"An LLM-Tool Compiler for Fused Parallel Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17438","snapshot_observed_at":"2026-08-11T18:19:00.774480Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12152","last_updated":"2024-12-11T06:12:52Z","snapshot_observed_at":"2026-08-14T18:27:12.476848Z","submitted_at":"2024-12-11T06:12:52Z","title":"GraphTool-Instruction: Revolutionizing Graph Reasoning in LLMs through Decomposed Subtask Instruction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:19:00.774480Z"},"links":{"cited_paper":"/paper/2405.17438","citing_paper":"/paper/2412.12152"},"observation_digest":"sha256:80b9cee2a8fa2cdd5c35ecc29ca4a32cbd14cb800b7833775224dae1f3aadb13","observation_id":"9786a918-0968-4808-ab70-3bdf682bef23","resolution":{"observed_at":"2026-08-11T18:19:00.774480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17438","last_updated":"2024-05-07T18:55:50Z","snapshot_observed_at":"2026-08-14T17:09:27.735239Z","submitted_at":"2024-05-07T18:55:50Z","title":"An LLM-Tool Compiler for Fused Parallel Function Calling","version":1},"cited_work":{"arxiv_id":"2405.17438","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17438","snapshot_observed_at":"2026-08-10T16:40:37.054664Z","title":"An LLM-Tool Compiler for Fused Parallel Function Calling","venue":"cs.PL","work_id":"09a626c0-ada2-40f8-bcf0-eab4f6101add","year":2024},"citing_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-08-12T08:20:39.042893Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:36.754307Z"},"links":{"cited_paper":"/paper/2405.17438","citing_paper":"/paper/2501.12959"},"observation_digest":"sha256:8b21793ed5bb17f4966fa72ada43391f7dbe5ec87cee447e1ec881a9f435770b","observation_id":"d78eb8f5-56af-4918-9217-8889d7f01b70","resolution":{"observed_at":"2026-08-10T16:40:37.062189Z","resolver_source":"local_arxiv","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":"2405.17438","last_updated":"2024-05-07T18:55:50Z","snapshot_observed_at":"2026-08-14T17:09:27.735239Z","submitted_at":"2024-05-07T18:55:50Z","title":"An LLM-Tool Compiler for Fused Parallel Function Calling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17438","snapshot_observed_at":"2026-08-03T09:21:41.723312Z","title":"An llm-tool compiler for fused parallel function calling, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.14192","last_updated":"2026-07-03T11:26:58Z","snapshot_observed_at":"2026-08-13T05:52:46.252093Z","submitted_at":"2026-01-20T17:51:56Z","title":"Toward Efficient Agents: Memory, Tool learning, and Planning","version":2},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-08-03T09:21:41.723312Z"},"links":{"cited_paper":"/paper/2405.17438","citing_paper":"/paper/2601.14192"},"observation_digest":"sha256:61bfd09b4e4a129266f1b4cbd6465fc0e3ad88e8836b61972281f59d2606454f","observation_id":"05c5ebdd-218d-42a5-89ab-9bf99dea807f","resolution":{"observed_at":"2026-08-03T09:21:41.723312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.17438/citation-record","integrity":"/paper/2405.17438/integrity","json":"/paper/2405.17438/citation-record.json","paper":"/paper/2405.17438"},"outbound":[],"paper":{"arxiv_id":"2405.17438","last_updated":"2024-05-07T18:55:50Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-14T17:09:27.735239Z","submitted_at":"2024-05-07T18:55:50Z","title":"An LLM-Tool Compiler for Fused Parallel 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 4 inbound Pith citation observations for arXiv:2405.17438."}