{"as_of":"2026-08-10T18:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:237a8b9aee978408e5b3a8d4194c89091266bb857d488c0e94f2152e05b8d1c3","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-10T06:31:04.303077+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-09T18:11:46.649633Z","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-06T23:26:37.461293Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.06156","last_updated":"2024-06-12T05:17:10Z","snapshot_observed_at":"2026-08-10T06:28:02.240393Z","submitted_at":"2024-06-10T10:39:28Z","title":"Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06156","snapshot_observed_at":"2026-08-09T18:11:46.649633Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00677","last_updated":"2025-02-02T05:28:17Z","snapshot_observed_at":"2026-08-09T19:17:39.396140Z","submitted_at":"2025-02-02T05:28:17Z","title":"LLM-based event log analysis techniques: A survey","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-09T18:11:46.649633Z"},"links":{"cited_paper":"/paper/2406.06156","citing_paper":"/paper/2502.00677"},"observation_digest":"sha256:cfe7c83c8333b4601330ffad7a5bf16b51acd10fbd294ce8200eebf4d99993aa","observation_id":"dc2a8e64-8c2c-4e84-90ba-72447de8bab3","resolution":{"observed_at":"2026-08-09T18:11:46.649633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06156","last_updated":"2024-06-12T05:17:10Z","snapshot_observed_at":"2026-08-10T06:28:02.240393Z","submitted_at":"2024-06-10T10:39:28Z","title":"Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06156","snapshot_observed_at":"2026-08-07T11:55:41.850590Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01147","last_updated":"2025-06-01T20:00:00Z","snapshot_observed_at":"2026-08-10T16:33:41.636765Z","submitted_at":"2025-06-01T20:00:00Z","title":"A Word is Worth 4-bit: Efficient Log Parsing with Binary Coded Decimal Recognition","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T11:55:41.850590Z"},"links":{"cited_paper":"/paper/2406.06156","citing_paper":"/paper/2506.01147"},"observation_digest":"sha256:995f4bc99fa1f4c51ae0f0a37e948dfa49559dc88497aaa573aee304c60037e3","observation_id":"cefca704-beb0-4ddf-bc16-b66f2843b7b3","resolution":{"observed_at":"2026-08-07T11:55:41.850590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06156","last_updated":"2024-06-12T05:17:10Z","snapshot_observed_at":"2026-08-10T06:28:02.240393Z","submitted_at":"2024-06-10T10:39:28Z","title":"Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs","version":2},"cited_work":{"arxiv_id":"2406.06156","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06156","snapshot_observed_at":"2026-08-06T23:26:37.461293Z","title":"Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs","venue":"cs.SE","work_id":"d5953d95-7b06-4522-a430-694cd490d223","year":2024},"citing_paper":{"arxiv_id":"2507.12472","last_updated":"2025-06-23T02:40:16Z","snapshot_observed_at":"2026-08-08T12:19:02.219120Z","submitted_at":"2025-06-23T02:40:16Z","title":"A Survey of AIOps in the Era of Large Language Models","version":1},"reference_index":137,"source":"pdf_text","source_observed_at":"2026-08-06T23:26:37.002856Z"},"links":{"cited_paper":"/paper/2406.06156","citing_paper":"/paper/2507.12472"},"observation_digest":"sha256:7b6f221aadb3456ea69e105006d808e9fb9cee2b45e274da7c8a68e919a075c9","observation_id":"dda59dee-70a8-466b-bdd2-e3743ddd10a2","resolution":{"observed_at":"2026-08-06T23:26:37.465175Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.06156/citation-record","integrity":"/paper/2406.06156/integrity","json":"/paper/2406.06156/citation-record.json","paper":"/paper/2406.06156"},"outbound":[],"paper":{"arxiv_id":"2406.06156","last_updated":"2024-06-12T05:17:10Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-10T06:28:02.240393Z","submitted_at":"2024-06-10T10:39:28Z","title":"Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.06156."}