{"as_of":"2026-08-08T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58a59e5b38fc9a457affda1398f47956503ac87a6e07c10c1bcacbcf4d88c25c","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:26:04.888469Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.14485/citation-record","integrity":"/paper/2506.14485/integrity","json":"/paper/2506.14485/citation-record.json","paper":"/paper/2506.14485"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11754602_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains","venue":"Lecture notes in computer science","work_id":"3f3a2bbc-84d1-4234-8c1b-a8a33a147e6b","year":2005},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.495250Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:59699182ac5d11f821e76c2f9e2145024e6d548462a6c69da0f80b03b8df2acf","observation_id":"b71c4f9d-5a2b-4763-a70c-e2dcaedb0362","resolution":{"observed_at":"2026-08-07T00:26:07.390272Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"kuleuven.be/1653773","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:08.158085Z","title":null,"venue":null,"work_id":"81ee1ce3-5b70-4ca2-ac6f-843978ea9018","year":2006},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.579692Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:64ca82c3e0fcb97a3f1ec588229548959cc88278e7730027dbdfa4cd61f4a26f","observation_id":"dddd0150-045f-4d09-b618-08141990eb61","resolution":{"observed_at":"2026-08-07T00:26:08.270174Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/088395100117016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:07.187405Z","title":"University course timetabling using constraint handling rules.AAI, 14(4):311–325, April 2000.doi:10.1080/088395100117016","venue":null,"work_id":"5654aeca-c30d-48f9-aed7-e5a123722167","year":2000},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.688815Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:75392a9ea5a9c33e54af5d0b0aa639d6a23d40a069168f20965b54ea03eefecc","observation_id":"e40edd52-54f9-4cb3-aa30-1224b34339be","resolution":{"observed_at":"2026-08-07T00:26:07.247521Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45619-8_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Reasoning about Actions with CHRs and Finite Domain Constraints","venue":"Lecture notes in computer science","work_id":"fb17d277-b8a3-4a85-a986-1eb29c11ede2","year":2002},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.802900Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:1b2fd6ba68d2595648f719abacc8b244160050c2585567e95ca4c5e1d33c29af","observation_id":"3fc0716c-466f-4edb-b1f6-7af40c7fe4d6","resolution":{"observed_at":"2026-08-07T00:26:07.117136Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s1471068405002358","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:06.923520Z","title":"FLUX: A logic programming method for reasoning agents.TPLP, 5(4-5):533–565, July 2005.doi:10.1017/S1471068405002358","venue":null,"work_id":"fce49a43-be5d-475c-ad08-f95fceee578e","year":2005},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.910795Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:a5ac7f916a65df48d2e40a6938b6075c9b2018dbe00c5bd68ccada308af97e1f","observation_id":"e2c09ee5-4adc-451d-b2f0-e7befedf7c99","resolution":{"observed_at":"2026-08-07T00:26:06.970366Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:02.983219Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:02.983219Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:37ee21ae42c6c614bddaf8a2e946d30e487056bf851cf647e0ee323013bbb06b","observation_id":"dca5ba76-4190-47b9-93cb-8035ca6f8704","resolution":{"observed_at":"2026-08-07T00:26:02.983219Z","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/s1471068409990123","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:06.816493Z","title":"As time goes by: Constraint Handling Rules: A survey of CHR research from 1998 to 2007.TPLP, 10(1):1–47, January 2010.doi:10.1017/S1471068409990123","venue":null,"work_id":"f773c199-2cf1-41b5-9b32-4f822a54eaee","year":1998},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.094550Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:64e90b662aa68613977ef3b05f6d078f2f0339a207bbfaa446b804c54ced6b8b","observation_id":"a6e5c108-5329-427a-b0a9-44ff52a92f3c","resolution":{"observed_at":"2026-08-07T00:26:06.870794Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-21542-6_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":"Lecture notes in computer science","work_id":"35d3bd5d-eb6a-480c-9707-723b8a10e2e5","year":2015},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.204216Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:b7ec8a77c55a4117143aa9615d708b26a7ade3e8f777a3ddcd3f62a421040521","observation_id":"23b99f72-1cc0-4b19-8a56-ea27a35c04ea","resolution":{"observed_at":"2026-08-07T00:26:06.765134Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:09.504166Z","title":"Principles of Rule-Based Programming","venue":null,"work_id":"d8203594-aa2f-4ab3-a1d6-bac46c4a0704","year":2025},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.316068Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:8973ca2f4c48b33fdac883449c05dd6074b601f7e96c7b55794545c92b901173","observation_id":"1c28a8da-594c-4c85-994a-b55ca5a6d423","resolution":{"observed_at":"2026-08-07T00:26:09.652639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-61551-2_62","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"On confluence of Constraint Handling Rules","venue":"Lecture notes in computer science","work_id":"644a5c2c-8b6c-41eb-928b-b9e370573e18","year":1996},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.397159Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:fe651c0155943096369e44201b001717659947896de0ae89812bd5ec877d03b8","observation_id":"41ce1025-cd1c-44a7-8b45-4c999ff000e6","resolution":{"observed_at":"2026-08-07T00:26:06.637250Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-17822-6_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":"Lecture notes in computer science","work_id":"282a6239-0797-47a5-8cd8-3f6e0f6855f2","year":2015},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.518972Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:0e851ddaf2813a7ee752188cb0e478bcbdd0f83876bd269bc9b382d21425a178","observation_id":"7ded1d91-2244-403c-9637-86bfb91afb9d","resolution":{"observed_at":"2026-08-07T00:26:06.476038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-61252-2_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"A Decidable Confluence Test for Cognitive Models in ACT-R","venue":"Lecture notes in computer science","work_id":"6cc4bd26-302e-4305-9618-16ce7803ed4f","year":2017},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.601281Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:91611cfeb7b12d3ac9c65e64b76a7375dc9f9a74241c2379c71e22f2fec2a66a","observation_id":"b44bd9b2-df1b-4da0-80d5-01d0f35afe91","resolution":{"observed_at":"2026-08-07T00:26:06.298243Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:09.217593Z","title":null,"venue":null,"work_id":"a875e5e7-6899-4ff4-a3a1-73c3bbdaf632","year":2004},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.695252Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:b438f837c392a14bb51c1088c5490da785123ca01e661658a0f3c99ed3f0c1e1","observation_id":"b1edf54c-05de-457e-8fde-aa69d5450dea","resolution":{"observed_at":"2026-08-07T00:26:09.375038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:08.953022Z","title":"CCHR: The fastest CHR Implementation, in C","venue":null,"work_id":"230015f2-8596-4827-aa99-53e273a89aee","year":2007},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.804936Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:2c18d982f95bc52e259072046f9510257b8cdb17a1fcb7031004b3240013987b","observation_id":"fdb3c15a-9a4b-47a5-b876-2c5d86885e83","resolution":{"observed_at":"2026-08-07T00:26:09.076766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:03.911350Z","title":"CHR++: An efficient CHR system in C++ with don’t know non-determinism","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.911350Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:8aa58133be7faf76a647ecbd56082c044e7f0e7f0fb04c71e71e68e268f62772","observation_id":"446a3dbb-3d0d-4407-9ddf-361e224761a7","resolution":{"observed_at":"2026-08-07T00:26:03.911350Z","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-07T00:26:08.700697Z","title":null,"venue":null,"work_id":"759e262a-3247-465c-a6b0-b8dbb6ef8003","year":2008},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:03.992371Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:173387da1fdbe6fb88c0da8733e9435fd7b70ea6568b264bc2b416652d4b942a","observation_id":"38c56d4e-af53-4660-8525-89096eed27c2","resolution":{"observed_at":"2026-08-07T00:26:08.861665Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-99906-7_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"CHR.js: A CHR Implementation in JavaScript","venue":"Lecture notes in computer science","work_id":"f3c69385-cfe2-4e04-8a49-a606f9a1a0f1","year":2018},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.100552Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:0fd2f4928dee93a17f17f645feb5f53a7d48ad4bbf22eef48dfbcd029d39ae6f","observation_id":"fdfecc3c-5111-4e9a-ac54-7084028d72f3","resolution":{"observed_at":"2026-08-07T00:26:06.160000Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s1571-0661(04)80344-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:05.912412Z","title":"JACK: A Java Constraint Kit","venue":null,"work_id":"993c2001-1e4c-47fd-9c4c-11e5c95c15de","year":2002},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.179109Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:02804666bc7b28fa5e29f11955b1e03f55189bfc219b0ab8ca91efb91a3db794","observation_id":"1ae1e0a3-d80c-4caa-aabd-fc960a9d8e11","resolution":{"observed_at":"2026-08-07T00:26:05.985254Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"kuleuven.be/1654703","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:07.806004Z","title":"K.U.Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java","venue":null,"work_id":"f7fa83c9-81dd-41be-8d80-333b3a067ac9","year":2005},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.268716Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:77dc64703f3797481f1107e76047572504ed68fb546f0d105126635db278407d","observation_id":"b26c5b64-a87e-49cc-bfc6-3609576402f3","resolution":{"observed_at":"2026-08-07T00:26:07.854171Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1308.3939","last_updated":"2013-08-19T07:15:27Z","snapshot_observed_at":"2026-07-06T03:20:54.176389Z","submitted_at":"2013-08-19T07:15:27Z","title":"Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java","version":1},"cited_work":{"arxiv_id":"1308.3939","doi":"10.48550/arxiv.1308.3939","metadata_source":"pith","pith_arxiv_id":"1308.3939","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java","venue":"cs.PL","work_id":"0f5e24c0-cb8e-4446-86e4-7972baaf8da3","year":2013},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.332620Z"},"links":{"cited_paper":"/paper/1308.3939","citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:fa952c0ff53af37e29bcb2b788a2750f6e10dc84711fba27314a2b7bbc346b6b","observation_id":"f20955fc-6535-4c83-9b69-5b5154c69ddc","resolution":{"observed_at":"2026-08-07T00:26:05.805249Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:08.428246Z","title":"JavaCHR – A Modern CHR-Embedding in Java","venue":null,"work_id":"119858c3-2b6a-4e24-90be-f446efcd4acc","year":2022},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.405565Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:b1f7966e22c59b1304d1d93d8b908beda1659131d5d346ad60da30d9f82c447a","observation_id":"3ceaf78b-14f0-4e55-a5d2-6c01218b7b07","resolution":{"observed_at":"2026-08-07T00:26:08.568203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.68573","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:07.579908Z","title":null,"venue":null,"work_id":"5d062635-0dcb-4c13-976b-d5c295f969e7","year":1998},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.491225Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:ef9f2e206ba5bee490e1e1b095b37efa14cbf52255a35dbe507cc5796cc9dcb8","observation_id":"2724d72f-78d5-4031-b6f1-9eb371360714","resolution":{"observed_at":"2026-08-07T00:26:07.643127Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-73228-0_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Initial Algebra Semantics Is Enough! In Simona Ronchi Della Rocca, editor,TLCA 2007, Lecture Notes in Computer Science, pages 207–222, Berlin, Heidelberg, 2007","venue":"Lecture notes in computer science","work_id":"90453fd7-9fe4-4a6e-877a-9ca2f301cbc6","year":2007},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.577298Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:66f5d40d7831fbeeaee232f74ac540491d5ce7f5d1c1fd65247b8de27d843619","observation_id":"7b727f64-e1ee-4569-b35f-66bf410e01db","resolution":{"observed_at":"2026-08-07T00:26:05.630376Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s1471068425000043","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:05.395220Z","title":"FreeCHR – an algebraic framework for Constraint Handling Rules embeddings.Theory and Practice of Logic Programming, 25(3):340–373, May 2025.doi:10.1017/S1471068425000043","venue":null,"work_id":"522d5b43-2b50-46db-9e76-07f45a934154","year":2025},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.664685Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:3fd659b7697cd1c2928c070333449cc3ab814ffb6af8049f4df3e6ce548db4d5","observation_id":"db751af1-729b-4fd6-9c9e-d86504dab2b4","resolution":{"observed_at":"2026-08-07T00:26:05.459038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22155","last_updated":"2025-05-28T09:19:33Z","snapshot_observed_at":"2026-08-07T13:11:51.528303Z","submitted_at":"2025-05-28T09:19:33Z","title":"An instance of FreeCHR with refined operational semantics","version":1},"cited_work":{"arxiv_id":"2505.22155","doi":"10.48550/arxiv.2505.22155","metadata_source":"pith","pith_arxiv_id":"2505.22155","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"An instance of FreeCHR with refined operational semantics","venue":"cs.PL","work_id":"dd90d517-fd9d-4d42-8dc2-79ffa8011ce5","year":2025},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.751159Z"},"links":{"cited_paper":"/paper/2505.22155","citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:b47234c8684f6c87e22ba8f0523a797e44189f30bf60ade2204ca1eafeead9e4","observation_id":"f003dde4-5ee3-477f-87f5-ece5be7fff81","resolution":{"observed_at":"2026-08-07T00:26:05.310975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tkde.2009.208","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:05.083244Z","title":"Efficient Lazy Evaluation of Rule-Based Programs.IEEE Trans","venue":null,"work_id":"1031829f-d5be-47b6-8dd6-571a09e4698b","year":2010},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.815925Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:0de623bd8d8fe6698aa1d68913f2f2cbfcc0e1182bb1b4d7f04c7467e169c1f3","observation_id":"e6680f6b-eefa-4ab5-b0f6-7f8819b39dc9","resolution":{"observed_at":"2026-08-07T00:26:05.163077Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:04.888469Z","title":"zero\", [], [lambda x: x == 0], lambda _: True, lambda _: []), 4 rule(","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:04.888469Z"},"links":{"citing_paper":"/paper/2506.14485"},"observation_digest":"sha256:0aee8c83870476e8e42b33659fd49d6b742bfa356508f994413a8621f911a684","observation_id":"40a5e70d-0d77-4239-acf6-40e8d8adbc9d","resolution":{"observed_at":"2026-08-07T00:26:04.888469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.14485","last_updated":"2025-08-25T13:19:57Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-07T00:15:22.524845Z","submitted_at":"2025-06-17T13:07:30Z","title":"Optimized Execution of FreeCHR"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":18,"verified_fuzzy":3},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2506.14485."}