{"as_of":"2026-08-08T10:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:401453f08600ff04636b843c4af953b5eafbb449b8782649b5462324db047e42","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-08T06:32:00.761636+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-02T22:28:39.901168Z","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-05-15T20:46:35.775649Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.04469","last_updated":"2024-09-03T19:50:57Z","snapshot_observed_at":"2026-07-06T19:11:40.618767Z","submitted_at":"2024-09-03T19:50:57Z","title":"Intensional FOL: Many-Sorted Extension","version":1},"cited_work":{"arxiv_id":"2409.04469","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.04469","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Intensional FOL: Many-Sorted Extension","venue":null,"work_id":"97468ffe-0356-4428-aaf3-07e22afcf623","year":2024},"citing_paper":{"arxiv_id":"2604.09567","last_updated":"2026-07-16T14:57:30Z","snapshot_observed_at":"2026-08-05T20:51:44.920398Z","submitted_at":"2026-02-18T21:57:15Z","title":"Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-15T20:45:16.240104Z"},"links":{"cited_paper":"/paper/2409.04469","citing_paper":"/paper/2604.09567"},"observation_digest":"sha256:ab4a5037c8596aa8a1062a08db4d468ce913e21a44936eae8e1fea68656ad9d3","observation_id":"76506a6b-ca77-45ac-b57a-2f2dc1a09b24","resolution":{"observed_at":"2026-05-15T20:46:35.777210Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04469","last_updated":"2024-09-03T19:50:57Z","snapshot_observed_at":"2026-07-06T19:11:40.618767Z","submitted_at":"2024-09-03T19:50:57Z","title":"Intensional FOL: Many-Sorted Extension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.04469","snapshot_observed_at":"2026-08-02T22:28:39.901168Z","title":": Intensional FOL: Many-Sorted Extension","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.09567","last_updated":"2026-07-16T14:57:30Z","snapshot_observed_at":"2026-08-05T20:51:44.920398Z","submitted_at":"2026-02-18T21:57:15Z","title":"Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T22:28:39.901168Z"},"links":{"cited_paper":"/paper/2409.04469","citing_paper":"/paper/2604.09567"},"observation_digest":"sha256:33430dc6b1a583a27ec4d8f74d93cee851a1f008bcf81c0aea8b77da1702c76a","observation_id":"d44ee662-5a95-402e-b067-e8dd24278d78","resolution":{"observed_at":"2026-08-02T22:28:39.901168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04469","last_updated":"2024-09-03T19:50:57Z","snapshot_observed_at":"2026-07-06T19:11:40.618767Z","submitted_at":"2024-09-03T19:50:57Z","title":"Intensional FOL: Many-Sorted Extension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.04469","snapshot_observed_at":"2026-08-02T07:13:23.838177Z","title":": Intensional FOL: Many-Sorted Extension","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13073","last_updated":"2026-07-20T17:51:43Z","snapshot_observed_at":"2026-08-07T14:15:35.725787Z","submitted_at":"2026-07-12T15:54:58Z","title":"Probabilistic Extension of Neuro-Symbolic AGI Robots based on Belnap's Typed Intensional FOL","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T07:13:23.838177Z"},"links":{"cited_paper":"/paper/2409.04469","citing_paper":"/paper/2607.13073"},"observation_digest":"sha256:5e5bddf7b3d51d9e4bad68761c1b81e17b90bf33beb34df493fe4c1c693512ef","observation_id":"ccaf5b56-500d-4078-9881-2d2ea60f79b7","resolution":{"observed_at":"2026-08-02T07:13:23.838177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.04469/citation-record","integrity":"/paper/2409.04469/integrity","json":"/paper/2409.04469/citation-record.json","paper":"/paper/2409.04469"},"outbound":[],"paper":{"arxiv_id":"2409.04469","last_updated":"2024-09-03T19:50:57Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T19:11:40.618767Z","submitted_at":"2024-09-03T19:50:57Z","title":"Intensional FOL: Many-Sorted Extension"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.04469."}