{"as_of":"2026-08-11T14:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc28538e562f3015c52328262a753f62debcb8b6b48fac25a017be6a84fa7861","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:37:30.734564Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2505.14895/citation-record","integrity":"/paper/2505.14895/integrity","json":"/paper/2505.14895/citation-record.json","paper":"/paper/2505.14895"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.07.037","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Termination of narrowing revisited","venue":"Theoretical Computer Science","work_id":"4cabc9fc-14a2-4e4b-8ee0-21eb35f1db90","year":2009},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.259197Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:c806c9f940cac35b0076cf8b1510ff2e152f554d3bcdd3cac30ea5dc95b07d9f","observation_id":"30ec7755-9f37-4521-beba-72ddfca42d1b","resolution":{"observed_at":"2026-08-07T15:37:34.923442Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:25.361344Z","title":"A needed narrowing strategy","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.361344Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:b8487ba608f545697832fb2355d87dd1c9171e55981191d8e2544f805271c3e3","observation_id":"0502ea8f-29bc-49f6-89ef-aa66d1fef035","resolution":{"observed_at":"2026-08-07T15:37:25.361344Z","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/j.tcs.2019.02.020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A formalisation of nominal α- equivalence with A, C, and AC function symbols","venue":"Theoretical Computer Science","work_id":"d10a0714-9d95-469c-b551-f755714dc096","year":2019},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.519438Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:1abf32ae026a2878d6d47a1dd3f355422fec2bb1da2ab40a6d5ee994c242a7bb","observation_id":"199ca68e-f4e4-44e3-8b8c-5aad33ef32b7","resolution":{"observed_at":"2026-08-07T15:37:34.699533Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0960129521000050","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Formalising nominal C-unification gener- alised with protected variables","venue":"Mathematical Structures in Computer Science","work_id":"5efcdd4e-1d7b-4da5-9a91-644224af5d1c","year":2021},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.656651Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:51e0afd08fc51ddae462f654135ed991f60e24484b2c989898fcfc12eaa74ee3","observation_id":"9dcff968-8d1f-430e-8c76-a095e3d23ec6","resolution":{"observed_at":"2026-08-07T15:37:34.537729Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fscd.2016.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Nominal narrowing, in: Kesner, D., Pientka, B","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"9736e888-4c3f-490d-80d4-814ec5948036","year":2016},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.770482Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:082834f8c226bc9ba13ee4aa940dc7ebaa824cf81420fc93762681fdd906edf3","observation_id":"b0ef0268-50b5-43de-9f1e-09d386cc5a4e","resolution":{"observed_at":"2026-08-07T15:37:34.313525Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.23638/lmcs-16(1:19)2020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On nom- inal syntax and permutation fixed points","venue":"Research Portal (King's College London)","work_id":"246b7520-1b1d-4ea3-b305-a6b22c642d7c","year":2020},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.786293Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:7ca5626ae0473f6ffe8203a0b452388f6a71815b2e16d70521945c5b5b313e11","observation_id":"d9754760-ecf6-4e97-8b58-a5b1a7e6406f","resolution":{"observed_at":"2026-08-07T15:37:34.118019Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-42753-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Nominal AC-matching, in: Dubois, C., Kerber, M","venue":"Lecture notes in computer science","work_id":"03cd6fa0-1448-4e40-a05f-97810594e7c1","year":2023},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.791349Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:1a97be0dfec4df1e36436a182e1c5273e163aaba8b42e7a0683e01bae9c68c72","observation_id":"5d4c5716-7d56-4586-8c5a-8e24686e5450","resolution":{"observed_at":"2026-08-07T15:37:33.920568Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10817-024-09714-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Certified first-order ac-unification and applications","venue":"Journal of Automated Reasoning","work_id":"a613c66d-4470-4920-9e8a-dd634cbf9077","year":2024},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.797363Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:29b81b6380000dd57ebbfca322a68914bc0ca6e3e7431d5133d047b80522c23d","observation_id":"908f7cd4-8298-45ce-813d-bbd698cc960a","resolution":{"observed_at":"2026-08-07T15:37:33.689927Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-07T18:18:05.592452+00:00","source":"paper_reference_links","state":"open"},"event_date":"2025-02-18","event_type":"correction","notice_doi":"10.1007/s10817-024-09715-4","provenance":{"observed_at":"2026-07-11T03:01:49.299854+00:00","source":"crossref","source_record_id":"10.1007/s10817-024-09715-4->10.1007/s10817-024-09714-5:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:39.850303Z","title":"Nominal equational rewriting and narrowing, in: Pre- proceedings of the 19th Logical and Semantic Frameworks with Appli- cations (LSF A 2024), pp","venue":null,"work_id":"beebc73d-92ff-4c63-8f11-10e8403b9032","year":2024},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:25.867339Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d3aa53d1688ae01877002a9a09af6057142d1ecedae328ba2d3d2a77c3a1718b","observation_id":"5c8ae7e0-3cbb-472c-bf0a-3d74570aa696","resolution":{"observed_at":"2026-08-07T15:37:39.962391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:39.623242Z","title":"Term rewriting and all that","venue":null,"work_id":"38c81e68-6e8b-4673-9d57-f9964a70dd2e","year":1998},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.010082Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d15e09ac0af2b0b341cbf69e16fb4174af23b7423884b199287e38ef3c63a2f2","observation_id":"feb38064-ea5f-426d-b16c-9953c088fe51","resolution":{"observed_at":"2026-08-07T15:37:39.732515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:26.097678Z","title":"Tamarin: Verifi- cation of large-scale, real-world, cryptographic protocols","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.097678Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:6b9a63337cbbfa9e4f04152c7e9f4f782804b3ec3318e2de7cd0cf75fd38d046","observation_id":"f6e7fc78-8ba1-4683-91f5-8a212a9acde1","resolution":{"observed_at":"2026-08-07T15:37:26.097678Z","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-07T15:37:26.186638Z","title":"Matching and alpha-equivalence check for nominal terms","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.186638Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:071b8275fb7cd4b1000b8ce4ac215810d564ebe718d7696bb3a50800fb799f10","observation_id":"5cc197d1-6e9b-428f-8757-53ff6124a383","resolution":{"observed_at":"2026-08-07T15:37:26.186638Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:26.304622Z","title":"The locally nameless representation","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.304622Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:0a9d2fcfb670b08292db1bd6edc3e236f27e10a1c405721fa7d258a82b9c725f","observation_id":"54f5611e-0d9c-4e82-9e13-934f1fbef845","resolution":{"observed_at":"2026-08-07T15:37:26.304622Z","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-07T15:37:39.421990Z","title":"The complexity of equivariant unification, in: D ´ ıaz, J., Karhum¨ aki, J., Lepist¨ o, A., Sannella, D","venue":null,"work_id":"1e864a7b-8b31-483b-910e-934b4d50a4b9","year":2004},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.435664Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:191b98d826b66643d29a8c3edaadd815c022a79a7178d825bfe754ddbacee973","observation_id":"f4b41d5b-be62-4e07-99f2-24be6f5d611c","resolution":{"observed_at":"2026-08-07T15:37:39.504323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7673.13876","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:36.823101Z","title":"Nominal logic programming","venue":null,"work_id":"e086a340-7970-4bcb-91ed-9b6ba52def13","year":2008},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.528669Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:4711c9d726db1b2acbe02c318a17424ae7171d36c2ccb8e9093e317944ad2333","observation_id":"3315ac67-9832-4028-99de-5852cf13240b","resolution":{"observed_at":"2026-08-07T15:37:36.941960Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/theoretics.24.4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Deepsec: Deciding equiv- alence properties for security protocols - improved theory and practice","venue":"TheoretiCS","work_id":"46a52c3f-6032-4018-9438-ef6030c6b756","year":2024},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.629140Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:96af9a50f416143ddae58b7bf948059ce79367979f75e40fdd1b7ef064642cc7","observation_id":"105b7605-2a76-4011-b9ba-b5b4e981eca0","resolution":{"observed_at":"2026-08-07T15:37:33.449627Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:26.704359Z","title":"Indistinguishability beyond diff- equivalence in proverif, in: 36th IEEE Computer Security Foundations Symposium, CSF 2023, Dubrovnik, Croatia, July 10-14, 2023, IEEE","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.704359Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:1909a35dc9e8d95efedba9b294ba4477e185cc250cef25cf6a1e907cf338cc9b","observation_id":"b759490b-3b28-4480-90b7-dc0f566c281f","resolution":{"observed_at":"2026-08-07T15:37:26.704359Z","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-07T15:37:39.221582Z","title":"The finite variant property: How to get rid of some algebraic properties, in: Giesl, J","venue":null,"work_id":"90ae1906-0e35-4d73-b7c6-846769631fdb","year":2005},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.780944Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:0ad7c375f8184e4e06952bc2bb8015c9d62010826c39ba58c1ebaccc2a21815c","observation_id":"ff6a147b-1e03-4eaa-806b-2ee5750ea1bc","resolution":{"observed_at":"2026-08-07T15:37:39.334566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12100","last_updated":"2020-03-26T18:33:27Z","snapshot_observed_at":"2026-07-06T09:07:40.397451Z","submitted_at":"2020-03-26T18:33:27Z","title":"Study of galaxy morphology and merging time of two interacting galaxies under different initial rotation and orientation configurations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12100","snapshot_observed_at":"2026-08-07T15:37:26.914169Z","title":"Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, in: 18th An- nual IEEE Symposium of Logic in Computer Science, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:26.914169Z"},"links":{"cited_paper":"/paper/2003.12100","citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:0709ca4897d40110a5dcbb14d609061bd1c7311960ca008946de2c78e9cfadaa","observation_id":"cbcdde4c-2d5a-4482-b7a3-d981ce6868ea","resolution":{"observed_at":"2026-08-07T15:37:26.914169Z","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-07T15:37:38.999256Z","title":"Equational programming","venue":null,"work_id":"1bad4714-3a31-4109-a7bd-972d3d7ae5dc","year":1988},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.029092Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:e05384103bde8fa30b959e5c8169d2734a84f0b7630e4faa5906e24d68209b60","observation_id":"3582a043-49d1-4a3b-865a-20178740b256","resolution":{"observed_at":"2026-08-07T15:37:39.106061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:38.852263Z","title":null,"venue":null,"work_id":"01a05731-6cc2-4fc7-a634-3444b720d1b1","year":1992},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.149173Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:acb184232cb33c76fa32459715627739321f69b0cdfca95c42f8083bb5aa5f72","observation_id":"1c527568-0ced-4079-af82-0f56b67e9818","resolution":{"observed_at":"2026-08-07T15:37:38.911175Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:38.612288Z","title":"Mathematical Logic","venue":null,"work_id":"3d924b01-fd16-44ae-8396-4758c544c1ef","year":1994},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.233757Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:bb58f3edf12532863a6ae08ab6ed641847dca9a9669d2131d188475ff2dcf767","observation_id":"81fa9e82-85dd-4744-b68f-ac8cebbd176c","resolution":{"observed_at":"2026-08-07T15:37:38.737952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2009.05.015","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Variant narrowing and equa- tional unification, in: Rosu, G","venue":"Electronic Notes in Theoretical Computer Science","work_id":"86f8e13c-52a2-413e-933e-f191312ed1fa","year":2008},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.312566Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d2376e87c60b9c45b1455b8161e4222ef97099423e4b41b9c5440e5236f4dc06","observation_id":"2603e18c-26f1-433e-991f-c51585aaf8da","resolution":{"observed_at":"2026-08-07T15:37:33.135081Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jlap.2012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:32.786720Z","title":"Folding variant narrowing and optimal variant termination","venue":null,"work_id":"71cd2365-3126-47bc-a956-2455f5a096a1","year":2012},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.420172Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:1832e86362faed6dc2d7400c0b0814450d0faadcebef056161410f9aab40b31e","observation_id":"2d274ee3-e3a9-4ffe-a607-100c47baa82c","resolution":{"observed_at":"2026-08-07T15:37:32.855685Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2006.12.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Nominal rewriting","venue":"Information and Computation","work_id":"d20a6feb-268a-4a6b-83ab-880a55b73606","year":2007},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.502618Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:e43c2e27433e07093609bd8ae6b3c9315a93c41b170f51193742ea99c12b650c","observation_id":"86efbac3-4621-486b-bf4f-17cecf7d0f68","resolution":{"observed_at":"2026-08-07T15:37:32.670695Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9774.10697","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:36.445091Z","title":"Nominal rewriting with name gen- eration: abstraction vs","venue":null,"work_id":"5b584e98-ba91-4c9a-a08c-3f328ce4d1ee","year":2005},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.632577Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:40bc3d41a198c3bc9734b486e0f4dc8a2675abb597c6207a010a742879ed2a5d","observation_id":"4f6c0194-26b1-4e02-87bc-6d111ad04ad4","resolution":{"observed_at":"2026-08-07T15:37:36.536259Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.34.5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Closed nominal rewriting and effi- ciently computable nominal algebra equality, in: Crary, K., Miculan, M","venue":"Electronic Proceedings in Theoretical Computer Science","work_id":"4a9cc7d8-7147-4b13-b2f4-4e250e430ea4","year":2010},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.736131Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d9bbafb9c59f2ea6a6857e0fe8170439d8cbf3d31c2740b918aa07d67dd70376","observation_id":"28ddb379-3f02-494c-92fa-208127834f17","resolution":{"observed_at":"2026-08-07T15:37:32.538406Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:38.469237Z","title":"A new approach to abstract syntax with variable binding","venue":null,"work_id":"a5eaa010-14d7-4b29-b3d0-a2584e83b394","year":2002},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.835031Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:54c78ec13362503e114227a5842ceba7b26141baecd7bd2a9a3c0a3e01b2dff3","observation_id":"ff047939-42da-4ac1-a5ca-066757656a0d","resolution":{"observed_at":"2026-08-07T15:37:38.547809Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0335.11403","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:36.241319Z","title":null,"venue":null,"work_id":"4251fa3e-cc7e-4efb-8bf6-8698f4201f4b","year":2006},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:27.924668Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:e1d8b94c4b72fbcb7781743fa0fbe1f946412c7796db95e5677be10376aac1f9","observation_id":"b53494a9-cc37-42a2-8e54-e249b9317a03","resolution":{"observed_at":"2026-08-07T15:37:36.307281Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0956796899003330","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Higher-order narrowing with definitional trees","venue":"Journal of Functional Programming","work_id":"ea231634-e958-42a8-9590-03a6bcb2ded9","year":1999},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.029153Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:f027d06ce84094638ef1c546d5229971b03dd2c48f6a535de38e15151cf7ea85","observation_id":"ede0f7d1-106d-485b-9afc-40c55e687d77","resolution":{"observed_at":"2026-08-07T15:37:32.399831Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-10009-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Canonical forms and unification, in: Bibel, W., Kowalski, R.A","venue":"Lecture notes in computer science","work_id":"6a0794d5-9058-4535-ae93-aed159eef716","year":1980},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.162553Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:473a0aac33a950620341701cfa712a58e949e72ca78cebbbece303915bce780f","observation_id":"e31c238f-8ddf-4ca7-b686-57dab570e61c","resolution":{"observed_at":"2026-08-07T15:37:32.306337Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:28.278932Z","title":"Confluent and coherent equational term rewriting systems: Application to proofs in abstract data types, in: Ausiello, G., Protasi, M","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.278932Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:85394e5ef9599dd0b041d6a7518a486d4257a5ec903f2c93d0e6e60ee16a877f","observation_id":"ff19d53f-26a4-40a2-aff9-7a8b08ce3c91","resolution":{"observed_at":"2026-08-07T15:37:28.278932Z","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/bfb0036921","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Incremental con- struction of unification algorithms in equational theories, in: D ´ ıaz, J","venue":"Lecture notes in computer science","work_id":"ff040a73-86dd-49b5-9e4c-618eaf3f17ce","year":1983},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.400694Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:70f36b4e346b8fa809e86673b44da8f7fe1d7385f66ab17f2c41d866449990a8","observation_id":"5f16ffea-0020-477d-bf41-dff6097a0bc1","resolution":{"observed_at":"2026-08-07T15:37:32.169081Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6330.36332","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:35.929880Z","title":"Matching, unification and complexity","venue":null,"work_id":"30660586-af2b-4714-9431-e5d8da08fa01","year":1987},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.515839Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:1d89250d7764cb97b02233f0c5ad7dfa70fdb846bf8dfec08109197a7f997391","observation_id":"0f90dc91-bb65-49a9-afd1-f8c601926a4f","resolution":{"observed_at":"2026-08-07T15:37:36.050761Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-68446-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Confluence and commutation for nom- inal rewriting systems with atom-variables, in: Fern´ andez, M","venue":"Lecture notes in computer science","work_id":"6109d9ef-84a7-42e3-b9ad-5e1b905cc436","year":2020},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.688636Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:01622194bf919d8095a894d4876a1a3c594b81656850236ab144f3c12275da5c","observation_id":"38a6299c-3fff-4820-a18b-01751230f85e","resolution":{"observed_at":"2026-08-07T15:37:31.967578Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2159531","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Nominal unification from a higher-order perspective","venue":"ACM Transactions on Computational Logic","work_id":"fba90a63-3368-4f4c-9da9-0b2318929068","year":2012},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:28.876286Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:0e90e5dce04879e7699f63209bf510830ae8baa825e63c1e2c46351a71f438bc","observation_id":"beff3581-2879-44e0-be3a-178528246b27","resolution":{"observed_at":"2026-08-07T15:37:31.801014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:38.306203Z","title":"Foundations of logic programming","venue":null,"work_id":"b65ef7dc-646c-45ed-8471-48a23bac255e","year":1984},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.014254Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:6bada3558234e574bec7e46817a5d86a715f9ac1da9c6852f43bf9a3ed3c7002","observation_id":"a16a82da-7ff3-477c-90aa-9149daed4564","resolution":{"observed_at":"2026-08-07T15:37:38.362254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.10089","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:35.712885Z","title":"An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis","venue":null,"work_id":"5693a61c-f6f4-42bf-bd1f-dcfb0f9e56fc","year":2023},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.124288Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:9726004443bbcda2f91d4026084b568efc0a00c970cc95dff7cefd94f3fafb06","observation_id":"09e86029-26ad-43c2-bbc3-bdb34ba78feb","resolution":{"observed_at":"2026-08-07T15:37:35.800610Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:38.161258Z","title":"Reasoning with higher-order abstract syntax in a logical framework","venue":null,"work_id":"c7aca00b-35dc-4d8f-8c3b-f366285db244","year":2002},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.275313Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:2ccfa964f4ae0f4511f3c4ab7ddce85307605a0c2e106bdc2d285caf855b2a51","observation_id":"9e7d2f05-41ac-427d-90aa-5d7d640eb997","resolution":{"observed_at":"2026-08-07T15:37:38.236467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2004.06.024","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Symbolic reachability analysis using narrowing and its application to verification of cryptographic proto- cols","venue":"Electronic Notes in Theoretical Computer Science","work_id":"d9437af9-c981-44b7-97ac-c068f44fd52c","year":2005},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.523358Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:b97a239f0e366a28143e88435e70ae1cc4549dc5be5da5fb34560f80e9500bde","observation_id":"e0cc3dd0-6d4a-44fb-9f7d-789e4fe94219","resolution":{"observed_at":"2026-08-07T15:37:31.641050Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:29.632907Z","title":"Completeness results for ba- sic narrowing","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.632907Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d9a1fc2c9931717e519dbca8a2069f49e5f70b77c1491bea723692a279d9bbc9","observation_id":"21f6c1e2-a9cb-4477-8ae7-4a2299c763fb","resolution":{"observed_at":"2026-08-07T15:37:29.632907Z","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-07T15:37:37.967571Z","title":"Semantic unification for convergent systems","venue":null,"work_id":"a6aad28d-e754-46f2-9e83-45269d69d372","year":1994},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.724384Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:f4483d3ef5843ffd3d9ee3f9eedc3554f33bdf7a6ab362854634bb4589e98fa0","observation_id":"8a05f69a-038b-4b6d-b880-43ee8fcf1834","resolution":{"observed_at":"2026-08-07T15:37:38.066160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0747-7171(89)80014-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Basic narrowing revisited","venue":"Journal of Symbolic Computation","work_id":"c1dc65a6-c7bb-4095-9a89-bcf56c900fc3","year":1989},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.826891Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:47cb5dc8ce1a7624a6c6e765e94d8609dc4562ee789ed299784a5e35be0d5d33","observation_id":"06103eab-469c-4c51-a79f-a06e0883e6a6","resolution":{"observed_at":"2026-08-07T15:37:31.442113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:37.776393Z","title":"Solving Higher-Order Equations: From Logic to Programming","venue":null,"work_id":"d38de882-ae8c-41fe-8ace-98d084ce7988","year":1998},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.970169Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:2779b90bbf9bf3dd160c11775a7af07c744a7acc7e62be981076d60e65290cdf","observation_id":"20cbc9e8-7f3b-4a07-a29f-a0f68b834129","resolution":{"observed_at":"2026-08-07T15:37:37.870581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:37.610198Z","title":"Nominal commu- tative narrowing (work in progress), in: Informal Proceedings of UNIF 2024: The 38th International Workshop on Unifica- tion, pp","venue":null,"work_id":"6f2dc23a-012e-41cf-9b4d-955ee20b405d","year":2024},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.109659Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:58db31d0220ff3db4b75f44ded4fce55a1df986101148bc7f10586cc11ecacd1","observation_id":"b8c4fda7-4a53-4650-a2c0-56d893e54837","resolution":{"observed_at":"2026-08-07T15:37:37.662458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:37.460916Z","title":null,"venue":null,"work_id":"ec0c968f-ff2e-4196-99bc-e52d8552609f","year":null},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.222473Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:d8f9b92fa231ad56f3fe188a23f75a29a957a1ff30d9d08613b1db8ded8449bf","observation_id":"66926fc7-54a8-4fa0-b7de-c8fd7635b35e","resolution":{"observed_at":"2026-08-07T15:37:37.538526Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2006.10.040","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Type-level computation using narrowing in Ωmega","venue":"Electronic Notes in Theoretical Computer Science","work_id":"90705e60-0b9a-4087-a70a-a28c94a1d137","year":2007},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.379793Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:5773c94d8a7153540b194fc6ebe328fdb5c85846ba2d56e813d74772038e4b44","observation_id":"34fab0c6-c327-4121-a261-12c1c81e43a0","resolution":{"observed_at":"2026-08-07T15:37:31.262140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4705.94472","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:35.359342Z","title":null,"venue":null,"work_id":"f6ad0fe2-54b0-4b27-8bd8-4f15c821d89c","year":2003},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.498646Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:a6098ecacd3d5bef43403f2ca7727ff735108b959f55f2c7269a13b61282939d","observation_id":"113ffef3-c777-45ac-bec2-5eeeaf7e2549","resolution":{"observed_at":"2026-08-07T15:37:35.464386Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2261.32226","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:35.087346Z","title":"A unification algorithm for associative-commutative functions","venue":null,"work_id":"4ebbf908-ddff-4fcc-90df-6ffb7af3221d","year":1981},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.569085Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:01fe498e9ab102ce699e62b97cbdf78f4d8e9613c602222cc92c31df31515c2e","observation_id":"08810c91-bc4e-4f87-8e58-b0e639fa6c13","resolution":{"observed_at":"2026-08-07T15:37:35.167302Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.06.016","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Nominal unification","venue":"Theoretical Computer Science","work_id":"476ea5aa-276d-4843-9cc4-dd69b2847a65","year":2004},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.637642Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:b7f3e004fb26453749346091bb40508efa288a4224277f624be55743972aaef7","observation_id":"cc7d537b-644d-4733-a6bf-f090eae0ac08","resolution":{"observed_at":"2026-08-07T15:37:31.100227Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45446-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"E-unifiability via narrowing, in: Restivo, A., Rocca, S.R.D., Roversi, L","venue":"Lecture notes in computer science","work_id":"84d4f1aa-4bfb-4945-a496-86359dbdb2c9","year":2001},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.734564Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:958cb3ab838e180820ef77b2859f0e6a24d550ac49e8c6c5a95630b0c3ba087e","observation_id":"950cd5de-eddd-4746-9c3a-486b4e710011","resolution":{"observed_at":"2026-08-07T15:37:30.926416Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T15:37:29.387174Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":136,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:29.387174Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:0eb51fbfe8c4115f4af6d6e233758ffd2c1e22d5896ea90a7030b981ad59532d","observation_id":"83df0126-edd8-41c9-a8d7-bbba4479bcaf","resolution":{"observed_at":"2026-08-07T15:37:29.387174Z","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-07T15:37:37.232532Z","title":null,"venue":null,"work_id":"52b2872d-c60d-4cd8-b772-ac0f2ff19ac8","year":null},"citing_paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:37:30.290450Z"},"links":{"citing_paper":"/paper/2505.14895"},"observation_digest":"sha256:ee9ba9492cfca0309e2fbd81e9f5b87920034f27cad4e72435ac36c99580987d","observation_id":"28839df6-38fd-4617-a995-928380e5a925","resolution":{"observed_at":"2026-08-07T15:37:37.357068Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14895","last_updated":"2025-05-20T20:40:55Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-07T15:25:40.727864Z","submitted_at":"2025-05-20T20:40:55Z","title":"Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":4,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":10,"verified_exact":23,"verified_fuzzy":11},"total_outbound_references":53},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2505.14895."}