{"as_of":"2026-08-09T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4dddfcab0008fd598c9974a880f0dbc50273d1fd1eeaabe877976df85a70517c","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:39:00.779828Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.13662/citation-record","integrity":"/paper/2607.13662/integrity","json":"/paper/2607.13662/citation-record.json","paper":"/paper/2607.13662"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:38:59.879393Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.879393Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:08db1727f77d50d6152da607d803ef0075d564a6be5e1ff609f0ecc33ea0a01f","observation_id":"22776145-d405-4a54-a66b-1f837916a9c6","resolution":{"observed_at":"2026-08-02T04:38:59.879393Z","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.1017/s0956796803004726","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Remarks on the equational theory of non-normalizing pure type systems","venue":"Journal of Functional Programming","work_id":"c5de9ea3-579f-4372-af03-10dcb33c70ae","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:57.989142Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:3a290f69f4091032582c650f26ad5243a743a6764e08cae8a24cfca5dbcdd5ce","observation_id":"f5722ac0-878c-4503-9926-e93af09fc2a6","resolution":{"observed_at":"2026-08-02T04:43:31.449863Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14064","last_updated":"2025-09-14T11:58:14Z","snapshot_observed_at":"2026-07-06T17:48:03.807374Z","submitted_at":"2024-03-21T01:22:52Z","title":"Lean4Lean: Verifying a Typechecker for Lean, in Lean","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14064","snapshot_observed_at":"2026-08-02T04:38:58.297023Z","title":"Mario Carneiro","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.297023Z"},"links":{"cited_paper":"/paper/2403.14064","citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7ab1ffba25a548e200e5f69a771144036b30cdb63a6cc5e2f506b66f1ecac8be","observation_id":"478af5cc-2df9-4e3d-bf45-72abf0fcd847","resolution":{"observed_at":"2026-08-02T04:38:58.297023Z","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.1145/3341711","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Implementing a Modal Dependent Type Theory","venue":"Proceedings of the ACM on Programming Languages","work_id":"a52cb39a-99b3-4763-97c0-af80a98758eb","year":2019},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.069975Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6d5153712f9a5d7b32f93a297f4d4dc21128eb15a2717eaa7c9196a201a6812a","observation_id":"a38c2b0d-1da4-4034-b169-76aa3ba33ca0","resolution":{"observed_at":"2026-08-02T04:43:30.940386Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:59.294196Z","title":"Iris from the ground up: A modular foundation for higher-order concurrent separation logic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.294196Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7706054dfb645be5bd725ff674a7cf705237cf1659c60474cebeddb268e97f82","observation_id":"c2f64109-3c6a-41b1-ba65-036b249200d3","resolution":{"observed_at":"2026-08-02T04:38:59.294196Z","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.1016/0890-5401(91)90068-d","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Using Information Systems to Solve Recursive Domain Equations","venue":"Information and Computation","work_id":"49265c51-6c0c-47a1-9fb1-fcb1dd1da779","year":2024},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.401242Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:617d7621ebe1c72a6e315512f7fcf572a51103fb01ac5081cd316855160570ad","observation_id":"0a42188b-aab8-46f9-86db-d30949228d2f","resolution":{"observed_at":"2026-08-02T04:43:30.780808Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3495528","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gradualizing the Calculus of In- ductive Constructions","venue":"ACM Transactions on Programming Languages and Systems","work_id":"971e5b07-4e14-4c8b-acc2-12f10218f5f5","year":2022},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.607383Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:d96c51d659686858b965cce3be726e028df8ab4201f57601cc365051087a560a","observation_id":"9b7b893d-90cc-4633-a0d5-1260fadbd489","resolution":{"observed_at":"2026-08-02T04:43:30.661299Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3776672","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Ap- proach","venue":"Proceedings of the ACM on Programming Languages","work_id":"c3b9d707-7931-46dc-9a2f-eeaabaa2da38","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.696691Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6d3597a9ea85a57f6929213f508dd02958c71926506b6122984ca98b329d5e48","observation_id":"dac59d07-4c0f-465b-9d89-9c36fd660991","resolution":{"observed_at":"2026-08-02T04:43:30.601682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:59.786452Z","title":"A theory of types","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.786452Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7ad9d8b50b02c4b9f7dd13b969a517d9520f8ce4fe7c64fe238d8a4f3ba4a23a","observation_id":"9b93cac4-9144-4a40-a843-b08b368f9fe7","resolution":{"observed_at":"2026-08-02T04:38:59.786452Z","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-02T04:38:59.988748Z","title":"”Type” is not a type","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.988748Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6fe3033b441ef4bb2af9b41ae8a0e674009dd73fa4fe64a38ec87e74f24b2b77","observation_id":"54ba11d5-68d3-45ef-a118-e7ebd8a17d0c","resolution":{"observed_at":"2026-08-02T04:38:59.988748Z","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-02T04:39:00.375856Z","title":"Correct and Complete Type Checking and Certified Erasure for Coq, in Coq","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.375856Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6eba76221bb0f556f9270b6d08a5e95df851ec02f3d2f81b344082fcd238abd1","observation_id":"03f9cbaf-5bc1-410f-bcd9-e617a06f5baf","resolution":{"observed_at":"2026-08-02T04:39:00.375856Z","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-02T04:39:00.460748Z","title":"Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.460748Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:87e58efc4b9bd11ae3fee2916406b5671e2bd8c5e0988a2b45b1b8249e882ca2","observation_id":"639ff2f7-d886-43b6-b37b-5ee06cf67d92","resolution":{"observed_at":"2026-08-02T04:39:00.460748Z","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-02T04:39:00.779828Z","title":"A Syntactic Approach to Type Soundness","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.779828Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:247067a44c34c5bd4f5dd7d85ca4aa687b2fc253c7b4c93a31727cf5cf8cd551","observation_id":"b4297b84-1b34-4d83-aacd-e14448877e5b","resolution":{"observed_at":"2026-08-02T04:39:00.779828Z","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-02T04:38:58.235044Z","title":"Luca Cardelli","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":125,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.235044Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:cc3786ec1edbc171b7aacd019ad837cf046bdf2491f878ae4c9f426d32227854","observation_id":"fcb4b1e0-5be4-4c09-9b4b-65d1fb1e324c","resolution":{"observed_at":"2026-08-02T04:38:58.235044Z","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-02T04:38:58.162884Z","title":"TheMathematicalLanguageAUTOMATH,ItsUsage,andSomeofItsExtensions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":260,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.162884Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:1dcb4fad4a4768ae86b62e44835d6c224d361517c4c09f7d3cff9eeb21e543d5","observation_id":"dcb3df8c-c044-4be7-a1e2-261917494157","resolution":{"observed_at":"2026-08-02T04:38:58.162884Z","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.4230/lipics.fscd.2025.27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"isbn: 978-3-95977- 374-4","venue":"ArXiv.org","work_id":"a6502514-17aa-445d-aeee-8c7f86f12af8","year":2025},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":337,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.535646Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6acae5ee044cc6284f1f7137a7f1cb89566a8fc788d6cb707e76ccbfaa1022b2","observation_id":"d0bf0073-e6b6-4827-9549-396dbaae5cdb","resolution":{"observed_at":"2026-08-02T04:43:30.736832Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:58.449747Z","title":"doi:10.1007/3-540-52335-9_47","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":417,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.449747Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:92f1584808def9a3904295222d4171dcf882aa57caf50f938eab0ac5e6f3f60a","observation_id":"cf9a0acf-d94c-42da-b1e8-2e30681945f1","resolution":{"observed_at":"2026-08-02T04:38:58.449747Z","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.2307/226","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:43:31.030342Z","title":"On the Axiom of Extensionality. Part I","venue":null,"work_id":"8abd09f9-b358-4537-8c81-6c8473488f5c","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1956,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.787530Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:c5c15288a46ea86be43dbd352947cf2de2c20b8a8e86e4e989275dd4dea10a8f","observation_id":"9715f5e7-548e-487b-bcef-6da6d88e27d0","resolution":{"observed_at":"2026-08-02T04:43:31.077669Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:39:00.642089Z","title":"Intensional interpretations of functionals of finite type I","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1967,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.642089Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:e6b802f96e74deb25c886f818d695ae285d9005f132a44769eb28362c220f76d","observation_id":"7c057aff-8f32-41c5-a3fe-780bbf9bd203","resolution":{"observed_at":"2026-08-02T04:39:00.642089Z","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-02T04:38:57.882338Z","title":"Some Extensional Term Models for Combinatory Logics and Lambda-Calculi","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1971,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:57.882338Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:646245249e7ee7026b6b50e450f813658489933cc92c4dc65ee8a98e3759e2f6","observation_id":"c3d006d5-5c56-417e-a13c-fe5ab1fe52cf","resolution":{"observed_at":"2026-08-02T04:38:57.882338Z","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.1137/0211062","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Category-Theoretic Solution of Recursive Domain Equations","venue":"SIAM Journal on Computing","work_id":"0d66ba89-345e-45fc-99b4-c035f8378649","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.296314Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7de2d406cb3eab5012d76dd8f6baaa224ad7509938b74daeb7c0ffe9c60ec555","observation_id":"0ded64eb-4378-4753-a83d-151985cf1013","resolution":{"observed_at":"2026-08-02T04:43:30.146607Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(86)90044-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The System F of Variable Types, Fifteen Years Later","venue":"Theoretical Computer Science","work_id":"6ef53d87-85e7-4de1-ba0c-a8d2f444405b","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.000266Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:747fa34164809338c62c341d2781744415fa132d9ccc280d4ccef13e27138163","observation_id":"cbd001ca-c6c2-4970-9ffc-23523b0130cf","resolution":{"observed_at":"2026-08-02T04:43:31.025622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:39:00.137873Z","title":"Typechecking is Undecidable when ‘Type’ is a Type","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.137873Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:682b0204ac56442114ab7358be3cd824aa5ca202de3151adc400808301cae316","observation_id":"1d3a621d-26c4-4f7a-8df1-b91abfcedc6b","resolution":{"observed_at":"2026-08-02T04:39:00.137873Z","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.1007/bfb0084217","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"First steps in synthetic domain theory","venue":"Lecture notes in mathematics","work_id":"572c63f7-dc22-425f-887c-22e35655ddd8","year":2026},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.237002Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7fd07bfae97c4208dde74e31bc74845f056c748a43997eaeb118ce4feb890967","observation_id":"1fd13add-f4ed-4a24-ba5e-b309e3511375","resolution":{"observed_at":"2026-08-02T04:43:30.881409Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:58.881608Z","title":"On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.881608Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:c70a41f18bf33fd24edea955d5c710a525e6a942b5ef6d51d3846ae2131b6215","observation_id":"6ed7bb23-c94a-424b-a82f-81f98ebfcc10","resolution":{"observed_at":"2026-08-02T04:38:58.881608Z","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-02T04:38:57.811883Z","title":"Cayenne—a language with dependent types","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:57.811883Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:d4486f109bd78597180a7e67ce4ded60269eefc836bd5ea6ea1dd3e2eefa6337","observation_id":"dc6da111-588d-42df-b7c3-ed41515a5189","resolution":{"observed_at":"2026-08-02T04:38:57.811883Z","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.2307/2586554","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory","venue":"Journal of Symbolic Logic","work_id":"df1f8603-79f3-4e30-941e-0959a0dec770","year":2000},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.528668Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:e61af28c542a229b356f0a08806920a1bad31eeb73c1837d23772395c27794e6","observation_id":"89e57531-c39f-4726-9333-3360349c9f17","resolution":{"observed_at":"2026-08-02T04:43:31.279525Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jlap.2004.03.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Origins of Structural Operational Semantics","venue":"The Journal of Logic and Algebraic Programming","work_id":"b83bcbdb-5e52-4351-b0cd-42b043137db3","year":2004},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.051603Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:d1fc3f80eff9cd604ff63dd97228168c0d0c78f8c13899b6855a789db4427c47","observation_id":"1548d0b4-97d1-4228-851d-8cb56c1188b9","resolution":{"observed_at":"2026-08-02T04:43:30.497450Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:59.148480Z","title":"On equivalence and canonical forms in the LF type theory","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.148480Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:90b930bb1cbec058a900af7836aebc7318a6696f132245e65a57af32a286c6dd","observation_id":"3c287773-79b0-46fe-8823-1f13d673ac43","resolution":{"observed_at":"2026-08-02T04:38:59.148480Z","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-02T04:38:57.704629Z","title":"Pure type systems with judgemental equality","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:57.704629Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:b05e8c6db6fae57e5b82a309a90f3f0953e289e0f044ef78f82eb9830cb52faf","observation_id":"69dbba1f-1d8f-4285-bd65-abf01ba61579","resolution":{"observed_at":"2026-08-02T04:38:57.704629Z","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.1017/s0956796812000044","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pure Type System conversion is always typable","venue":"Journal of Functional Programming","work_id":"1584fb15-a8f5-4f46-bd73-f28ff91fda2d","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.196321Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:73f4a5fb7ae48b3c099973c4adf554caca49ebe633d4afcb213e9943f3ff08ca","observation_id":"26f66d4b-5cbd-4a0c-9adf-1bcc893d050a","resolution":{"observed_at":"2026-08-02T04:43:30.356422Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:57.609169Z","title":"Normalization by Evaluation: Dependent Types and Impredicativity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:57.609169Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:29969b6e1cd9f98199ae158170eb5d1d582046669f2d98ccd471b3f73dd14b49","observation_id":"d3e0f42f-e43d-4e0f-9998-79e67c272fc7","resolution":{"observed_at":"2026-08-02T04:38:57.609169Z","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-02T04:39:00.723648Z","title":"A speci- fication for dependent types in Haskell","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.723648Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:2ce0979644315071d67950c9a2217ef3d71385216ff0b4e9fbb931816c77806b","observation_id":"3434241e-8b78-4fb1-9c90-3eff4b476b9e","resolution":{"observed_at":"2026-08-02T04:39:00.723648Z","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":"10.1007/s00224-018-9879-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Adequacy Theorem for Dependent Type Theory","venue":"Theory of Computing Systems","work_id":"2c12f4fd-842e-4b17-a7bb-d656cd7cf006","year":2018},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.379422Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:bbf070b6af0bcd7b45a53d140599960b297f80575fe7ea19c7494336a7a9d6ad","observation_id":"84ec8766-0258-47c3-b697-47618b677216","resolution":{"observed_at":"2026-08-02T04:43:31.363930Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:58.691896Z","title":"Approximate Normalization for Gradual Dependent Types","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.691896Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:c3367d4fed98d3186a589c979144a9e5b7936aa64bfee38b0f0780c28f3b2fe7","observation_id":"6cf7bf45-abba-448a-9250-8db103df3446","resolution":{"observed_at":"2026-08-02T04:38:58.691896Z","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-02T04:39:00.557509Z","title":"First Steps in Synthetic Tait Computability: The Objective Metatheory of Cubical Type Theory","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T04:39:00.557509Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:1a0050eddedde150e562c5894bec66f41fb981550bec692a44020ef1dbb8151a","observation_id":"ea53a41a-2ba7-44d4-a39c-97cff24ab5ce","resolution":{"observed_at":"2026-08-02T04:39:00.557509Z","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.1145/3547627","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Propositional equality for gradual dependently typed program- ming","venue":"Proceedings of the ACM on Programming Languages","work_id":"50db07cd-63ed-4c33-b263-ea8aa6ecb594","year":null},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.627147Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:6daceebef65d90b137362288be7222a1761ca7ebf503272b065fed3fa4a9b69d","observation_id":"5b6f6326-9653-49d9-9f3c-b3e276624d62","resolution":{"observed_at":"2026-08-02T04:43:31.188356Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-02T04:38:58.092821Z","title":"For the Metatheory of Type Theory, Internal Sconing Is Enough","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.092821Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:714e8b2d2967401a7d478aadc8b0bbc111ab8bb42ce97ba8be0edb585eef93dc","observation_id":"6deb2241-db68-4b17-9bc5-ebab1111e1cf","resolution":{"observed_at":"2026-08-02T04:38:58.092821Z","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-02T04:38:59.473382Z","title":"What Does It Take to Certify a Conversion Checker?","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:59.473382Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:8ee31d75ea5d74aa4bec6be174de2b58c34386655b83f6356e49d85554774d8c","observation_id":"122e02e6-96a1-41ed-8041-a1a9078fe5b5","resolution":{"observed_at":"2026-08-02T04:38:59.473382Z","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-02T04:38:58.749810Z","title":"Confluence Techniques for Dependent Type Theory with Typed Conver- sion","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T04:38:58.749810Z"},"links":{"citing_paper":"/paper/2607.13662"},"observation_digest":"sha256:7ddfac9cc41f124a252e0de4301f13f470d5e257a73d0b3be164ce3f3769ef74","observation_id":"509b9da9-314f-4a82-a969-99eb6e2861c3","resolution":{"observed_at":"2026-08-02T04:38:58.749810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13662","last_updated":"2026-07-15T10:06:45Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-02T20:36:59.492854Z","submitted_at":"2026-07-15T10:06:45Z","title":"Definitional Inversion, Without Normalisation"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":40},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.13662."}