{"as_of":"2026-08-17T17:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ae3475ed8f55db89fd42c5324f5b2fda5014aa380b5507f7340e1c336b2c073","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:40:25.472112Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-07-13T06:35:40.030219Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"cited_work":{"arxiv_id":"2504.12464","doi":"10.48550/arxiv.2504.12464","metadata_source":"pith","pith_arxiv_id":"2504.12464","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","venue":"cs.PL","work_id":"04bd328f-623f-41f7-ae87-f0e241638bfc","year":2025},"citing_paper":{"arxiv_id":"2607.08154","last_updated":"2026-07-09T06:49:13Z","snapshot_observed_at":"2026-08-14T08:20:32.840261Z","submitted_at":"2026-07-09T06:49:13Z","title":"Directed proof-relevant logical relations in simplicial HoTT","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T12:13:16.684251Z"},"links":{"cited_paper":"/paper/2504.12464","citing_paper":"/paper/2607.08154"},"observation_digest":"sha256:1415c48fa4679395f3b971bfe6af5b0d5b74bdd724a0f2f912dbbdd9368d8aac","observation_id":"6273e97e-0d1a-42ac-aee1-4dc6b13283a2","resolution":{"observed_at":"2026-07-10T12:17:03.677421Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:51:22.426223+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:51:22.426223+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"cited_work":{"arxiv_id":"2504.12464","doi":"10.48550/arxiv.2504.12464","metadata_source":"pith","pith_arxiv_id":"2504.12464","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","venue":"cs.PL","work_id":"04bd328f-623f-41f7-ae87-f0e241638bfc","year":2025},"citing_paper":{"arxiv_id":"2607.08547","last_updated":"2026-07-10T16:39:41Z","snapshot_observed_at":"2026-08-13T06:03:23.309429Z","submitted_at":"2026-07-09T14:41:33Z","title":"Potential Functions as Types","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T05:34:59.964919Z"},"links":{"cited_paper":"/paper/2504.12464","citing_paper":"/paper/2607.08547"},"observation_digest":"sha256:2e0f05a49dcd42cfc8a7bcb72a6b5780ec418a3ea144c40de5e2bbe913bce2cd","observation_id":"5d7b0df1-a13d-4866-a9f1-17de992b2d5f","resolution":{"observed_at":"2026-07-10T05:36:48.299438Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:51:22.426223+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:51:22.426223+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.12464","snapshot_observed_at":"2026-07-13T06:35:40.030219Z","title":"https://doi.org/10.48550/arXiv.2504.12464 arXiv:2504.12464 [cs] Anton Lorenzen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08547","last_updated":"2026-07-10T16:39:41Z","snapshot_observed_at":"2026-08-13T06:03:23.309429Z","submitted_at":"2026-07-09T14:41:33Z","title":"Potential Functions as Types","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T06:35:40.030219Z"},"links":{"cited_paper":"/paper/2504.12464","citing_paper":"/paper/2607.08547"},"observation_digest":"sha256:35d1226441116d83291186707d1ed0d1443325a2f63aebe9699337e8355966d6","observation_id":"9a0baee7-646f-49d8-8693-210f2c726102","resolution":{"observed_at":"2026-07-13T06:35:40.030219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.12464/citation-record","integrity":"/paper/2504.12464/integrity","json":"/paper/2504.12464/citation-record.json","paper":"/paper/2504.12464"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.988499Z","title":"Reduction-free normalisation for system f","venue":null,"work_id":"c5c562b9-00ba-4674-b97b-99aba53e76fc","year":1996},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.132417Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:3f6241df1c0d3b673b90c0d9d155c4c94cd5b2ca1c44510d2d1bfc8979ad8a33","observation_id":"ab39f481-1c4d-4c3f-8dc0-162874a989c7","resolution":{"observed_at":"2026-08-16T12:40:26.993160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.csl.2016.23","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.688966Z","title":"Guarded Cubical Type Theory: Path Equality for Guarde d Recursion","venue":null,"work_id":"3080a951-9479-496c-94fa-d1c3974a687e","year":2016},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.139539Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:8f0d62809bd845c5049b55fda88f843a1598959c7e1c026e213ef8894f0ea3ea","observation_id":"2edc2748-bd51-496d-8489-4dcf06aa5c1b","resolution":{"observed_at":"2026-08-16T12:40:25.696568Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.145433Z","title":"Primit ive recursive dependent type the- ory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.145433Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:afde07cfcbc1dfdf059de43010ad1f766c02d4c8f8eba7dd7a0907b3a577bc33","observation_id":"8dda15c7-6f05-469c-821b-b78220c2ad80","resolution":{"observed_at":"2026-08-16T12:40:25.145433Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.972657Z","title":"Constable, Stuart F","venue":null,"work_id":"30e28373-6b83-4965-8a89-2d070a4a3b18","year":1986},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.151695Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:7cabbfbb7802af38a665bb065986f7ee110a845f9a07c87616b1e2de428306e3","observation_id":"f50d75cd-f529-4e8d-a0b1-8522ca1f81ed","resolution":{"observed_at":"2026-08-16T12:40:26.977176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.954120Z","title":"Canonicity and normalization for depe ndent type theory","venue":null,"work_id":"d1f87d1c-7fb2-418c-9476-a18fec453c04","year":2019},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.158905Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:9c497b42adbad70f30d8edb8b6d6708742b311346053949ea2aad48687c386ab","observation_id":"c25580f2-e1fa-430b-bace-153d05bedad9","resolution":{"observed_at":"2026-08-16T12:40:26.959993Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.936816Z","title":null,"venue":null,"work_id":"749a5af1-a31b-49cd-bdfc-e45155baadf9","year":1994},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.165484Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:b832d3356df55b621faccba9507cb7d1ffe3298e754fc1819f20166b87c6d901","observation_id":"76a19c7c-11b3-47b7-b8c2-ac33fb8c28d8","resolution":{"observed_at":"2026-08-16T12:40:26.942489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.917995Z","title":null,"venue":null,"work_id":"92360859-94c5-492d-a274-35158703b2da","year":2014},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.172534Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:f646dd94a6fffc35fc222d9171fdbb8ec02764e751fe331bb55bdf304de85bd7","observation_id":"54dbcc63-7b4b-4f40-a809-6dc43fae6409","resolution":{"observed_at":"2026-08-16T12:40:26.924805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.178980Z","title":"Semantic analysis of normalisation by ev aluation for typed lambda calculus","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.178980Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:a81de6d47f5c37e9f715e98138cbca9f9b04697a095143ddcae88d5201793645","observation_id":"3c8dcd9a-4c01-48b5-b4f3-32ba0ac8dde2","resolution":{"observed_at":"2026-08-16T12:40:25.178980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1130.35323","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.410422Z","title":"Normalization for multimodal type theo ry","venue":null,"work_id":"1250249c-afbb-4c0b-93df-15bd9d6c6f00","year":2022},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.184899Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:7cccb0ac246893d3ec8ef38e522135045f687966309714fc3a6eebe272a660d1","observation_id":"167f6bbd-59ba-4195-8824-85a3d8b4a64f","resolution":{"observed_at":"2026-08-16T12:40:26.418426Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.900776Z","title":"Syntax and semantics of modal type theo ry","venue":null,"work_id":"e493141b-e929-4f9c-8681-c24a4c9242de","year":2023},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.192099Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:e062cbadd1224900e9bfa8a7c2d1fadc94b1c4137c9e36f2e5da177a47de6b6e","observation_id":"0c22e651-dd15-4040-b03d-bd4fc07bf664","resolution":{"observed_at":"2026-08-16T12:40:26.906305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.10783","last_updated":"2021-03-09T21:20:52Z","snapshot_observed_at":"2026-08-16T18:57:16.075754Z","submitted_at":"2020-12-19T21:23:29Z","title":"Syntactic categories for dependent type theory: sketching and adequacy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.10783","snapshot_observed_at":"2026-08-16T12:40:25.199063Z","title":"Syntactic categ ories for dependent type theory: sketching and ade- quacy, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.199063Z"},"links":{"cited_paper":"/paper/2012.10783","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:8add60a0ad6afbf5251324ffe6bf18561a529671a0bbcdbeadb555dc73f39e11","observation_id":"0c2c90c7-70cb-4177-83ea-e6b7b7f044c6","resolution":{"observed_at":"2026-08-16T12:40:25.199063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.12012","last_updated":"2024-05-16T08:45:55Z","snapshot_observed_at":"2026-08-16T17:18:58.825161Z","submitted_at":"2022-02-24T10:49:31Z","title":"Strict universes for Grothendieck topoi","version":3},"cited_work":{"arxiv_id":"2202.12012","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.12012","snapshot_observed_at":"2026-08-16T12:40:26.313117Z","title":"Strict universes for Grothendieck topoi","venue":"math.CT","work_id":"8cfdd8e3-0020-4a49-8e33-e127bfbbabcb","year":2022},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.205842Z"},"links":{"cited_paper":"/paper/2202.12012","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:5c93b88fcdea4e6e99051d4a3e1f417cfaae23e90dd264e525b58da75f200be0","observation_id":"9892965c-05ee-4f18-bbab-f56d2023099b","resolution":{"observed_at":"2026-08-16T12:40:26.319728Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/en","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.669890Z","title":"Amortized Analysis via Coalgebra","venue":null,"work_id":"c1ef5654-c907-4866-9ca1-ccded65ddb06","year":2024},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.212966Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:5c7c478d84660b96c050a93805e0f9edf75679fc0dd96d62c9ce648ff257e0a2","observation_id":"af4b0029-31bc-4ef1-a0a0-45336bb557e8","resolution":{"observed_at":"2026-08-16T12:40:25.675811Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.219674Z","title":"Decalf: A Directed, Effectful Cost-A ware Logical Framework","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.219674Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:0bc1dd4d20c55b604a09ab34dc643ab149b7e9af22b2f37eef3c1a6945737440","observation_id":"34150673-eb6e-41ed-8740-a82e9d8a2262","resolution":{"observed_at":"2026-08-16T12:40:25.219674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.20496","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.285601Z","title":"Abstra ction functions as types, 2025","venue":null,"work_id":"b4323f83-b503-4186-a3fe-081893723a44","year":2025},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.227123Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:24eaf3e2f916fd7b83c7bba1518f6ac08552aee5c2f960af00dedf0b73aa67db","observation_id":"36df3fc5-e891-417a-9740-ac0be2ed6035","resolution":{"observed_at":"2026-08-16T12:40:26.294499Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01484","last_updated":"2021-06-02T21:50:56Z","snapshot_observed_at":"2026-08-16T18:20:07.471968Z","submitted_at":"2021-06-02T21:50:56Z","title":"An Equational Logical Framework for Type Theories","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01484","snapshot_observed_at":"2026-08-16T12:40:25.232862Z","title":"An equational logical framework for typ e theories, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.232862Z"},"links":{"cited_paper":"/paper/2106.01484","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:3e5c3ba959848c62386f0faf5dfe8a6dea2c61f4e017b5e580c3a64ffbb7d0f0","observation_id":"cb1efa3b-c4ca-48c6-8129-ca91749b22a2","resolution":{"observed_at":"2026-08-16T12:40:25.232862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.883594Z","title":"Call-by-push-value","venue":null,"work_id":"46bffdf0-111d-41a2-86fb-d4c7399983c8","year":2025},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.239722Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:c9ec93868dcb681bdae3defedb15adb9356cf19525c9f1fd93875d44f3c54690","observation_id":"d4d7733e-937c-4a6f-aac6-bddfb15dc0e5","resolution":{"observed_at":"2026-08-16T12:40:26.889246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.863825Z","title":"Cost effects and phases","venue":null,"work_id":"fc582243-001d-4bab-b406-ea83a7ec7b43","year":2025},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.246953Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:1ba95c79699005c9269451d6b90493f390984a94bf269e86acc2ec5d57e90075","observation_id":"a613d747-0bad-4e7b-afa6-34c2c1c4f832","resolution":{"observed_at":"2026-08-16T12:40:26.869005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.252835Z","title":"Mitchell, and Eugenio Moggi","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.252835Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:1f72c72067922a4c93b383314015e8142b545ecbdd8ea580d6397b6ebc60e1a9","observation_id":"616cdc78-5428-4c08-8325-82a5c25f9ad9","resolution":{"observed_at":"2026-08-16T12:40:25.252835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8027.13806","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.095601Z","title":"A fra mework for defining logics","venue":null,"work_id":"0e170291-bff7-450a-9a8c-3283292dcd92","year":1993},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.259391Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:1556bb2bc348ebfc6990dea875d39d8a51555e04469f5d6e7dc77c28dd92b163","observation_id":"8d6cc53a-e308-401f-a858-ac14806d987d","resolution":{"observed_at":"2026-08-16T12:40:26.105539Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.845674Z","title":"On the interpretation of type theory in locally cartesian closed categories","venue":null,"work_id":"3537a048-5a95-4575-8a06-d78eb12da380","year":1994},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.266109Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:c81d6d9ce20508a1e2a8972bce151e5f26aaeed824a8275c821be828ec2ee08d","observation_id":"b3e7c5b4-c96b-405f-8bb1-d8b868d568de","resolution":{"observed_at":"2026-08-16T12:40:26.852187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.272882Z","title":"Glu ing for type theory","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.272882Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:f4ac48d63cd755312409c83622b6a7c1db9a737bf457fad4b5f0a69a2832ebf7","observation_id":"414ad6f6-75d9-4fa3-af2b-5807f47cf3e8","resolution":{"observed_at":"2026-08-16T12:40:25.272882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.279841Z","title":"William Lawvere","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.279841Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:1dd46c2847164dbb39872d855a6b7c76cbdff0f6bb79b8dca41ee8953a6e349c","observation_id":"8797bed6-49bf-405c-acc8-81e3df926c95","resolution":{"observed_at":"2026-08-16T12:40:25.279841Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.828068Z","title":"Call-By-Push-V alue: A Functional/Imperative Synthesis","venue":null,"work_id":"ec65445d-5b67-4769-aee9-72519f6b67f2","year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.285912Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:4bbd72991cbf4b8646f8acb1dec03871d21aa1af094206631488732e7cc26fd3","observation_id":"68a5ea81-0561-4cf5-8149-3de40e734747","resolution":{"observed_at":"2026-08-16T12:40:26.833941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.809815Z","title":"A V erifi ed Cost Analysis of Joinable Red-Black Trees,","venue":null,"work_id":"79a64372-c127-43e1-99ec-7f4ebc3b5f95","year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.300266Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:3bc3d26cd6f6c084aeef2ed644d6e1d808c171946f9389ae94681f025932face","observation_id":"ae3cd43c-8057-492b-9858-0ec653ae0a01","resolution":{"observed_at":"2026-08-16T12:40:26.816209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1184/r1/28352006.v1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.606729Z","title":"Cost-sensitive programming, verification, an d semantics","venue":null,"work_id":"e67c8a61-f457-4e0f-97f3-b065e40f61c9","year":2024},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.313546Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:7f7f3c888def029fd0f5b87ce508313db3d55d95274725978d7a956598601cff","observation_id":"3099aac9-d1b7-45a4-93a7-7b4f01aa5a13","resolution":{"observed_at":"2026-08-16T12:40:25.613334Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.318924Z","title":"A metalanguage for cost-awar e denotational semantics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.318924Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:7c6840f1f9112646f7a4ca583526c1bb445fc088f633e5f13561767b05f8e72d","observation_id":"8ce6c29f-09b1-44c2-8a1b-448e21ee2ea8","resolution":{"observed_at":"2026-08-16T12:40:25.318924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.325615Z","title":"A Cost-A ware Logical Framework","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.325615Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:68d9da8c4df0acf2ad62a8eaa3d59105156bade876baa20cba80605404931641","observation_id":"04306c33-cf83-457d-9a89-43b00bcb04f3","resolution":{"observed_at":"2026-08-16T12:40:25.325615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/entics.14732","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.574869Z","title":"Cost-se nsitive computational adequacy of higher-order recursion in synthetic domain theory","venue":null,"work_id":"2d0c4bf9-dadc-4184-94a9-8faec2610e44","year":2024},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.331677Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:8ffabe79cfb8ecca00252bb34931352a4ba2e1200012438e31a60eec343d40be","observation_id":"5824d367-51a0-416b-9e41-fe5e7409bb46","resolution":{"observed_at":"2026-08-16T12:40:25.582950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.338366Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.338366Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:84de503ff76f92ac1330630935c6afdc85ec6c5369c67f140ce32fff2a41b2ba","observation_id":"dbfaa9e8-5c28-4c6b-9787-3f222ba4cddb","resolution":{"observed_at":"2026-08-16T12:40:25.338366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.792655Z","title":null,"venue":null,"work_id":"9b031b31-9594-44e0-b4fc-4456ff8ac1b5","year":1973},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.345541Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:63be008c07c19c403bee078d31dc0a018eab628a1c4f4c746e7e919ce03dd80f","observation_id":"e1fcde1d-a568-48ce-a72d-9e8d8f651dac","resolution":{"observed_at":"2026-08-16T12:40:26.798358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.351517Z","title":"The Fire Tr iangle: How to Mix Substitution, De- pendent Elimination, and Effects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.351517Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:2a8954e519054e77e931dd5e76b539d05de7fb055328b1bb47586e453d0aebcf","observation_id":"cf599365-7753-4223-9372-c1cd32d8dae5","resolution":{"observed_at":"2026-08-16T12:40:25.351517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.358588Z","title":"A type theory for synth etic ∞ -categories","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.358588Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:d28f085fe1a002267dbad53903a17d851a1dfa295900f28314cb0dd2de5d2f2b","observation_id":"0ee3c164-b8b4-4f54-8ebe-e1633b5ff19e","resolution":{"observed_at":"2026-08-16T12:40:25.358588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.774758Z","title":"Modal ities in homotopy type theory","venue":null,"work_id":"9836b389-53f0-4f8d-8f05-ea0e152201a9","year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.365502Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:0d4e8008ec44ad253a59ef536b38f0c2753f388a46e4879efe3734b98aa3da68","observation_id":"c705ed0c-d426-4c9b-90c8-f8e68ba10f6c","resolution":{"observed_at":"2026-08-16T12:40:26.780274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.757073Z","title":null,"venue":null,"work_id":"de2d5686-90b6-46e8-8003-1d24d770769d","year":1984},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.376505Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:8354b3260abf0231194d7d21d918d15fdf8e53da41586cbe89b270ed0d9cd164","observation_id":"a804d37e-d9fa-4cda-91fa-555f167dff9b","resolution":{"observed_at":"2026-08-16T12:40:26.762498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.740073Z","title":"First steps in synthetic Tait compu tability: The objective metatheory of cubical type theory, 2021","venue":null,"work_id":"5a67b886-905a-4a60-8478-e776aada28eb","year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.383482Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:aed2e3193597cd6294bf1e13983fec92a3c232004657589d27bd737170557ba4","observation_id":"57cbac1c-2508-4eea-a31b-3b65fb298f7d","resolution":{"observed_at":"2026-08-16T12:40:26.745532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.721699Z","title":"Na¨ ıve logical relations in synthe tic Tait computability, 2022","venue":null,"work_id":"1d2d2982-1834-4714-b462-bf2cbd7ff223","year":2022},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.390615Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:1515c15af2847b1252177a078506968cd68fd66654ba5acbb111d679795ff3a1","observation_id":"03d20b35-898d-4ed0-a4d7-31c0f18579c3","resolution":{"observed_at":"2026-08-16T12:40:26.727521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.397085Z","title":"Normalization fo r cubical type theory","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.397085Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:a189b128d5e545f020f19730061072774768016fcc297b2501a02c7edbdc37e0","observation_id":"da654961-32d1-47b0-8f4e-7a6895c4ea72","resolution":{"observed_at":"2026-08-16T12:40:25.397085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.404976Z","title":"Logical Relation s as Types: Proof-Relevant Parametricity for Program Modules","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.404976Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:4e8aba1db93f3fd02c6d95722fd32d6d20ea8e33cadb39ee7643d12b2a62c279","observation_id":"c0fecf0c-250a-40f5-9729-0bee2986a3a8","resolution":{"observed_at":"2026-08-16T12:40:25.404976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.703731Z","title":"A metalanguage fo r multi-phase modularity, 2021","venue":null,"work_id":"104633f1-5194-4a4c-bca2-9faa00d52cd7","year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.411325Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:20f3d3e8cc59b3d0c53495adcc5ae243e1bdbb355ec7f54b85adfd4777ae6bd7","observation_id":"414fc50f-6331-4df3-adb4-a41b40aa7840","resolution":{"observed_at":"2026-08-16T12:40:26.709764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.418383Z","title":"Sheaf Semantics o f Termination-Insensitive Noninterference","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.418383Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:2069f7e0a5af3137667f985ea67d3c985755430223ffb2624188b7ee4fa0b8c5","observation_id":"0387ac72-3149-4e93-a080-6d3e2c5fc5e5","resolution":{"observed_at":"2026-08-16T12:40:25.418383Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.08646","last_updated":"2018-09-23T17:54:12Z","snapshot_observed_at":"2026-08-16T10:41:48.567155Z","submitted_at":"2018-09-23T17:54:12Z","title":"Normalization by gluing for free {\\lambda}-theories","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.08646","snapshot_observed_at":"2026-08-16T12:40:25.424055Z","title":"Normalization by g luing for free λ -theories, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.424055Z"},"links":{"cited_paper":"/paper/1809.08646","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:db56e1b81b0ab264c03f9176499bb087104b79175904fef9e9ca99871ebf9515","observation_id":"76fb2395-6c92-438f-bea3-8b96564159e9","resolution":{"observed_at":"2026-08-16T12:40:25.424055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.683977Z","title":"Singleton kinds and singleto n types, 2000","venue":null,"work_id":"d8099c30-ad4d-428e-9a04-d9ff3f7ab71e","year":2000},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.431593Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:d860f5ed55a39f89a98cf3030f2dd63f0762e3347ae09ce3a71364d838d0f161","observation_id":"108a6cbf-6825-49b8-ba16-75ac8b9c5518","resolution":{"observed_at":"2026-08-16T12:40:26.690097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.438311Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.438311Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:948d0899fbc4cba368f699989f0e2d5cd898412a0a4558309cc3d972c2f7a0a5","observation_id":"1a7af01a-1037-478c-92a2-29a4f7d59793","resolution":{"observed_at":"2026-08-16T12:40:25.438311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:26.665975Z","title":"Abstract and concrete type theories, 20 21","venue":null,"work_id":"009a52a1-5713-41ab-a86b-8d039f6bb5e9","year":2021},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.444199Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:84b5307b2c07c9ea79a761113df1650c34d6a5439f4ddc6446de00e513a45eb5","observation_id":"398ae826-ace6-4b95-81e9-ff4a93174e57","resolution":{"observed_at":"2026-08-16T12:40:26.671583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.08009","last_updated":"2016-03-14T14:55:52Z","snapshot_observed_at":"2026-08-14T22:16:59.099357Z","submitted_at":"2015-12-25T15:29:30Z","title":"A Framework for Dependent Types and Effects","version":2},"cited_work":{"arxiv_id":"1512.08009","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.08009","snapshot_observed_at":"2026-08-16T12:40:25.716181Z","title":"A Framework for Dependent Types and Effects","venue":"cs.LO","work_id":"c7e6d6ad-e203-44f0-ace6-8fea72924c08","year":2015},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.451064Z"},"links":{"cited_paper":"/paper/1512.08009","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:df65eb164bf7ed8a09b2aa93b3391e384a342bf593f874f65d0339cf7d4a4d30","observation_id":"6d7251f7-2a8d-473b-b960-03b5d10adca8","resolution":{"observed_at":"2026-08-16T12:40:25.724726Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.648110Z","title":"In Search of Effectful Dependent Typ es, 2017","venue":null,"work_id":"20fef004-104a-485a-86ee-788d6cad2b92","year":2017},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.458699Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:7764b211e545283a8fc463fd956d787bb7f287a736b9403d95f1bca12a827d26","observation_id":"182f01cc-c4a5-4410-abec-4e34de19ee70","resolution":{"observed_at":"2026-08-16T12:40:26.653752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.629082Z","title":"Structure and Language of Higher-Order A lgebraic Effects, 2024","venue":null,"work_id":"4a3a4361-b02f-4edf-81ee-98411bd2e6a6","year":2024},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.464950Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:657c41084845825faee65e246045aa2298420dc38ffa54107a1d443c4309c760","observation_id":"ed65e1ff-9521-41fb-b1a6-251ebf1eda00","resolution":{"observed_at":"2026-08-16T12:40:26.635690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T12:40:26.610437Z","title":"Revisiting the logical framework for loc ally cartesian closed categories, 2025","venue":null,"work_id":"39d696ee-c753-4b75-bcc5-8f6dc84c11ae","year":2025},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.472112Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:b6f0520ab77367e44b8f3a2543e64d729088d5f3d521e2a16df1585832fb634f","observation_id":"2b92a7cb-8200-4aa7-ae04-017381f23c4e","resolution":{"observed_at":"2026-08-16T12:40:26.616735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.292733Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.292733Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:9fe0538fc4ee05e5044c6c6128682e28ea46a2d9c5091578414d12fcf4760d30","observation_id":"878874c0-f03b-44ba-93ff-1272d059dafa","resolution":{"observed_at":"2026-08-16T12:40:25.292733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:25.370502Z","title":"URL https://lmcs.episciences.org/6015/pdf","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.370502Z"},"links":{"citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:73a155d2880dd7e598d1588f6f77eabf4aecab6c782517afb85b872530fb72fb","observation_id":"c1546526-0fc3-4008-8a49-fc5aae36e572","resolution":{"observed_at":"2026-08-16T12:40:25.370502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.11056","last_updated":"2023-09-23T05:34:28Z","snapshot_observed_at":"2026-08-16T14:59:14.237582Z","submitted_at":"2023-09-20T04:29:05Z","title":"A Verified Cost Analysis of Joinable Red-Black Trees","version":2},"cited_work":{"arxiv_id":"2309.11056","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.11056","snapshot_observed_at":"2026-08-16T12:40:26.025168Z","title":"A Verified Cost Analysis of Joinable Red-Black Trees","venue":"cs.PL","work_id":"0829a9cc-137d-4394-9315-b64ebfc79b8f","year":2023},"citing_paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:25.306318Z"},"links":{"cited_paper":"/paper/2309.11056","citing_paper":"/paper/2504.12464"},"observation_digest":"sha256:3f00086b84a9df579a96b2b4c9b16b2c468a45c2e6798b55c6a8d7f659bf8a74","observation_id":"b6bf6fd2-ce80-4cf4-8e5f-b5df637f169e","resolution":{"observed_at":"2026-08-16T12:40:26.031440Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.12464","last_updated":"2025-04-16T19:56:15Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-16T12:28:52.811493Z","submitted_at":"2025-04-16T19:56:15Z","title":"Canonicity for Cost-Aware Logical Framework via Synthetic Tait Computability"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":5,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":21,"verified_exact":7,"verified_fuzzy":17},"total_outbound_references":52},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 3 inbound Pith citation observations for arXiv:2504.12464."}