{"as_of":"2026-08-19T04:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6854dd854dc6e7a5e069f5b50f2166ed96249b446e7faf6ed0ed2c5706457724","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:08:20.584265Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:33:10.187577Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-17T00:16:13.690415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"cited_work":{"arxiv_id":"2412.13571","doi":"10.48550/arxiv.2412.13571","metadata_source":"pith","pith_arxiv_id":"2412.13571","snapshot_observed_at":"2026-08-17T00:16:13.690415Z","title":"PowerMLP: An Efficient Version of KAN","venue":"cs.LG","work_id":"7f2d0a3d-a5a5-4810-8d37-c18985c08e17","year":2024},"citing_paper":{"arxiv_id":"2504.12580","last_updated":"2025-08-25T19:35:55Z","snapshot_observed_at":"2026-08-18T09:09:33.575928Z","submitted_at":"2025-04-17T01:53:28Z","title":"ChemKANs for Combustion Chemistry Modeling and Acceleration","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T12:33:10.187577Z"},"links":{"cited_paper":"/paper/2412.13571","citing_paper":"/paper/2504.12580"},"observation_digest":"sha256:ef109a9987ce58d3e29a848cfe9b2c8e34998eafd4e7c37a680333c16d4ce235","observation_id":"525558e0-8e72-4460-96e3-2658395f79ac","resolution":{"observed_at":"2026-08-16T12:33:10.232661Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.13571/citation-record","integrity":"/paper/2412.13571/integrity","json":"/paper/2412.13571/citation-record.json","paper":"/paper/2412.13571"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:08:20.425015Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.425015Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:ec361f9c51ed332a470342d4e6661163630c5bf77fcdfcc5fbf3439007e2097c","observation_id":"0bb52247-1235-4cbe-8c46-748decd9190c","resolution":{"observed_at":"2026-08-11T13:08:20.425015Z","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-11T13:08:20.430398Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.430398Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:855b27388ad7f7275d7280009b6eea61b807371a9f3e0588cb5c96ca67affe46","observation_id":"8bd589c7-4f55-48cc-8523-2d71e634c962","resolution":{"observed_at":"2026-08-11T13:08:20.430398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14495","last_updated":"2024-06-20T16:59:38Z","snapshot_observed_at":"2026-08-16T13:41:01.923825Z","submitted_at":"2024-06-20T16:59:38Z","title":"rKAN: Rational Kolmogorov-Arnold Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14495","snapshot_observed_at":"2026-08-11T13:08:20.435599Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.435599Z"},"links":{"cited_paper":"/paper/2406.14495","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:6608339570f35fd70e7dc3a9cc4f2d21cbc7ccc5a10adcd9d07ccea1ce8d562d","observation_id":"40a93436-7338-4017-9ccf-832275c3002a","resolution":{"observed_at":"2026-08-11T13:08:20.435599Z","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-11T13:08:21.141139Z","title":null,"venue":null,"work_id":"be780147-f52a-41f0-9543-f4ae283aac87","year":1996},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.440909Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:932f1935595ade13d24263feb83cac047962df5af68809cb7e0de3f9a316f41b","observation_id":"917ca1cf-698b-4e30-a180-e214e964e0c9","resolution":{"observed_at":"2026-08-11T13:08:21.145491Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12832","last_updated":"2024-05-27T15:12:55Z","snapshot_observed_at":"2026-08-18T09:10:54.733191Z","submitted_at":"2024-05-21T14:36:16Z","title":"Wav-KAN: Wavelet Kolmogorov-Arnold Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12832","snapshot_observed_at":"2026-08-11T13:08:20.445626Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.445626Z"},"links":{"cited_paper":"/paper/2405.12832","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:45c36b55767e5071200db9519a1c6cd8cf6b366d93fd5990176bdecba9b44c78","observation_id":"98920012-51b5-4dd6-817e-48eb2e0f598d","resolution":{"observed_at":"2026-08-11T13:08:20.445626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18354","last_updated":"2025-05-30T14:43:03Z","snapshot_observed_at":"2026-08-19T01:13:18.113235Z","submitted_at":"2024-06-26T13:54:59Z","title":"Kolmogorov-Arnold Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18354","snapshot_observed_at":"2026-08-11T13:08:20.450488Z","title":"D.; Mastropietro, A.; Anagnostopoulos, A.; and Aris","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.450488Z"},"links":{"cited_paper":"/paper/2406.18354","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:e710de4b32644bfc779a948810f9867d71ab4f5bccff5f55ff64b060a815ea63","observation_id":"e3417a22-350a-475e-8f01-d68d36e24611","resolution":{"observed_at":"2026-08-11T13:08:20.450488Z","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-11T13:08:21.126400Z","title":null,"venue":null,"work_id":"046d6a9d-0274-4ad1-ac9a-20b29a13d73f","year":1972},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.455767Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:2658d2281e7ef3717cc458b4e92f3aaf668e98218281808f5bea3acbc2ceb9e6","observation_id":"658ddf25-712e-426a-9e4e-827dd9fb83c7","resolution":{"observed_at":"2026-08-11T13:08:21.130809Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:21.110053Z","title":"B.; and Schoenberg, I","venue":null,"work_id":"9b75d613-b635-4f8b-8df1-efcaa0ce1ccb","year":1947},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.460441Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:4af4870470c124b732e6b12ff98393a540adce7078de6997ed04c359cab25610","observation_id":"cea151aa-845c-4454-812d-1157a30c3afe","resolution":{"observed_at":"2026-08-11T13:08:21.115604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15323","last_updated":"2022-10-11T07:00:07Z","snapshot_observed_at":"2026-08-16T17:38:14.867172Z","submitted_at":"2021-11-30T12:08:03Z","title":"The signature and cusp geometry of hyperbolic knots","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15323","snapshot_observed_at":"2026-08-11T13:08:20.465752Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.465752Z"},"links":{"cited_paper":"/paper/2111.15323","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:13fba6812ddcdab870d49dcbdbc9ef12b7a71b9fdaaa29b88d9d8c8fd57164bd","observation_id":"6c0a3a1b-8bef-435d-911b-26de024ba2d4","resolution":{"observed_at":"2026-08-11T13:08:20.465752Z","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-11T13:08:21.087786Z","title":null,"venue":null,"work_id":"9a1e636b-642f-41be-aedb-b2c41e9c28ab","year":2021},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.470874Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:ec5692a774bbe44b36fa6864d28404fe1600193a1bf3905d9b344c44dd2e7e1a","observation_id":"79fb63f8-f140-401f-926b-a64ceff16472","resolution":{"observed_at":"2026-08-11T13:08:21.092860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:21.070015Z","title":null,"venue":null,"work_id":"ad14aeee-7b16-4b9a-ad4e-0cb5c381ec2b","year":1978},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.475645Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:7387b955e83fbf90c752d5b136b774119d251f9ae76fba8772bb257fa76939a3","observation_id":"a8dc3cdc-9226-458f-83b7-c24ed32a9133","resolution":{"observed_at":"2026-08-11T13:08:21.075066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:21.044753Z","title":null,"venue":null,"work_id":"8f4411f0-c20d-4e91-b21e-be6f066a1d0c","year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.480724Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:e5f4ef68d16513a2bb34a5779e2f61ccfdacb38dcdd4bee637f4a669748ec37a","observation_id":"a08e53c0-6f51-479c-8931-db32932fb185","resolution":{"observed_at":"2026-08-11T13:08:21.057806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:21.027513Z","title":null,"venue":null,"work_id":"9e5ea62c-f668-4d76-87a2-2771a0bc9854","year":2011},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.484836Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:f1ae7c9cc5c41cd78ea9ead9f126e8072ac1c6ca276ec167211670d02de4a6a6","observation_id":"f299db06-35bb-4235-a2d3-f296fa650a9a","resolution":{"observed_at":"2026-08-11T13:08:21.031970Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:21.011344Z","title":"M.; Bringas, G","venue":null,"work_id":"6a333f98-94e8-4ca2-ac2b-ade8f1700fbb","year":2006},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.488762Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:3fd873a5997748142136ad29b5e3c075980f07163773a1f82c66f0a4c1a7fc5e","observation_id":"e93cc3e0-383f-4401-9982-0744477dad55","resolution":{"observed_at":"2026-08-11T13:08:21.016751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:20.980075Z","title":null,"venue":null,"work_id":"3bd2dae6-c62c-4da7-b050-f237d9dc6ca1","year":1969},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.492795Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:a31a9b5e130c0d37c871c611eca7e565833906873b5b4894a6bb06702baae46e","observation_id":"51bcfa05-3ce2-4844-be4c-4d86a43cf516","resolution":{"observed_at":"2026-08-11T13:08:20.994277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:20.964745Z","title":null,"venue":null,"work_id":"68ebf0e0-e700-4300-9590-8e032340f22e","year":1998},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.496862Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:e6c5a1f350fa9ae50d71437c4b7b514962a209014e39e923b22207ee23ed8d62","observation_id":"e57df350-facb-40fe-95a8-906a2c20643a","resolution":{"observed_at":"2026-08-11T13:08:20.969568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:20.501007Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.501007Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:430724e0b60984bb46d876d8e9c029077b0685a96e5d1f736ddf2a4014511fc9","observation_id":"57fdfe2b-3341-4ea8-ac05-6afd2b154546","resolution":{"observed_at":"2026-08-11T13:08:20.501007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-08-13T19:48:28.322536Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-11T13:08:20.505290Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.505290Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:903a35b071955d3698c0c1da8437518a571277b01249ee6c873d94f9d708d130","observation_id":"3efdbbcd-92cc-41f1-9497-4d627cd9b671","resolution":{"observed_at":"2026-08-11T13:08:20.505290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17890","last_updated":"2024-12-09T16:37:12Z","snapshot_observed_at":"2026-08-19T02:02:18.539586Z","submitted_at":"2024-06-25T18:58:39Z","title":"SigKAN: Signature-Weighted Kolmogorov-Arnold Networks for Time Series","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17890","snapshot_observed_at":"2026-08-11T13:08:20.510012Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.510012Z"},"links":{"cited_paper":"/paper/2406.17890","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:aa7ab48edcec859b596c215e5333d822a8800915e95baad4b40575e3dd1760a2","observation_id":"03b78273-eccb-4893-97db-c8a5ce60e6f8","resolution":{"observed_at":"2026-08-11T13:08:20.510012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06470","last_updated":"2024-06-10T17:09:38Z","snapshot_observed_at":"2026-08-18T00:53:23.152128Z","submitted_at":"2024-06-10T17:09:38Z","title":"GKAN: Graph Kolmogorov-Arnold Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06470","snapshot_observed_at":"2026-08-11T13:08:20.516027Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.516027Z"},"links":{"cited_paper":"/paper/2406.06470","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:794609b6226989ccada7b0034813c56287a44d948e7fdf953c5c8f350c14b543","observation_id":"9e87a773-052a-4104-9fee-199f30726a7a","resolution":{"observed_at":"2026-08-11T13:08:20.516027Z","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-11T13:08:20.520768Z","title":"S.; Henderson, D.; Howard, R","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.520768Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:0d5996bfeb9e4a726c1f38ec6182ca195fe9ed042eaf31426d71636b70fd2629","observation_id":"9576c7c5-a6ff-4027-a264-518e946946dd","resolution":{"observed_at":"2026-08-11T13:08:20.520768Z","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-11T13:08:20.524948Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.524948Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:3c25dd592b48b6ea78bc139a16d5734f04763dbc2327674fa7f4cf028f07e289","observation_id":"b51dcea2-e37e-4e46-855f-fb10dfdef5d7","resolution":{"observed_at":"2026-08-11T13:08:20.524948Z","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-11T13:08:20.914477Z","title":null,"venue":null,"work_id":"f8d6050a-fe2b-486b-9b7a-bdc75d23f784","year":2020},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.529109Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:6322b029bccd5d84e8bd6b8d443eceb6fa4e09db2656c095037dd4c0d85211ee","observation_id":"cb7b6072-98b9-43a5-aaa6-c1c58bb3a822","resolution":{"observed_at":"2026-08-11T13:08:20.920070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:20.893724Z","title":null,"venue":null,"work_id":"fc196d22-7fdb-4087-a8a2-d0027f50407f","year":2020},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.533452Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:fefbe455b20ea26999b40310d073d35760672b10fe6f97ffc31a00d6de3a1ac9","observation_id":"e0e497cc-30bf-4098-8ec8-1938e388b63e","resolution":{"observed_at":"2026-08-11T13:08:20.898185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.06721","last_updated":"2024-05-10T06:03:45Z","snapshot_observed_at":"2026-08-16T13:53:50.462759Z","submitted_at":"2024-05-10T06:03:45Z","title":"Kolmogorov-Arnold Networks are Radial Basis Function Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.06721","snapshot_observed_at":"2026-08-11T13:08:20.537830Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.537830Z"},"links":{"cited_paper":"/paper/2405.06721","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:7b27d7341f5a1d75a6e5fe5ab5beb2123d74103d254b77fac4a452d09fd9b6b6","observation_id":"6687df9f-49dc-438f-bb4e-81f8501c8b44","resolution":{"observed_at":"2026-08-11T13:08:20.537830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.19756","last_updated":"2025-02-09T21:09:09Z","snapshot_observed_at":"2026-08-15T02:33:31.807561Z","submitted_at":"2024-04-30T17:58:29Z","title":"KAN: Kolmogorov-Arnold Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.19756","snapshot_observed_at":"2026-08-11T13:08:20.542546Z","title":"Y.; and Tegmark, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.542546Z"},"links":{"cited_paper":"/paper/2404.19756","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:f9329a58764bfd653cdd960ebe2faf97a5f88c0c8660755f76c67dabd5dae23d","observation_id":"43edb597-b7bf-4a26-a40e-4c2ffd3849ed","resolution":{"observed_at":"2026-08-11T13:08:20.542546Z","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-11T13:08:20.878385Z","title":"L.; Hannun, A","venue":null,"work_id":"ba7250a0-8852-4738-b529-e071b21e6c85","year":2013},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.547630Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:52b234cb74ebd85e816085c2f1976e8eb2bbaa78a3ad5b5206f9b257ce17c821","observation_id":"562b9646-f1a1-4b44-a20b-9adcf2f9a880","resolution":{"observed_at":"2026-08-11T13:08:20.883148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T13:08:20.862951Z","title":null,"venue":null,"work_id":"7c4b8729-a83d-48e2-a7d2-d5de51e3e8e0","year":1993},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.552591Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:ce1db221181f951fa3fdd417f0cf1df8c71e33c1cab68d12e682ba3754c05f56","observation_id":"eb012d8d-d15d-4fcb-9a2a-e4fb6c029cc8","resolution":{"observed_at":"2026-08-11T13:08:20.867289Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06440","last_updated":"2017-06-08T19:53:26Z","snapshot_observed_at":"2026-08-14T21:29:36.502364Z","submitted_at":"2016-11-19T22:48:30Z","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06440","snapshot_observed_at":"2026-08-11T13:08:20.557399Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.557399Z"},"links":{"cited_paper":"/paper/1611.06440","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:9aa2e6f311e2f5d1fe8d4de9243d0b18deed2ac873eb2254f4552df7a075777b","observation_id":"bd1f5615-632d-486a-83dc-f5cd326953d9","resolution":{"observed_at":"2026-08-11T13:08:20.557399Z","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-11T13:08:20.562274Z","title":"Y.; et al","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.562274Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:aea83f975218599a4e8bf1165b8fb70f677ccd3547aa26ade4baaf862a7511cb","observation_id":"f46b262b-b70b-4670-9080-c7ed61c7ee04","resolution":{"observed_at":"2026-08-11T13:08:20.562274Z","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-11T13:08:20.836263Z","title":null,"venue":null,"work_id":"1a180679-80a2-4e18-9372-bfac478c86de","year":2003},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.566991Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:9da5c0dd55963136929b19f11eb620aad09a56563d0e184eb220c487c36d0ed5","observation_id":"d708146b-68d4-43db-90d0-9dd853ce739b","resolution":{"observed_at":"2026-08-11T13:08:20.842164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-08-17T01:19:18.409791Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-11T13:08:20.571138Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.571138Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:7b690ea335aeb325251635a7acb11a0f292ff2e37eff0ed3885c5f7ba39d292d","observation_id":"20a133b7-70a6-4c11-8cfa-b19053f0c9fe","resolution":{"observed_at":"2026-08-11T13:08:20.571138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02496","last_updated":"2024-06-04T17:14:31Z","snapshot_observed_at":"2026-08-18T09:13:08.293223Z","submitted_at":"2024-06-04T17:14:31Z","title":"Kolmogorov-Arnold Networks for Time Series: Bridging Predictive Power and Interpretability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02496","snapshot_observed_at":"2026-08-11T13:08:20.575502Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.575502Z"},"links":{"cited_paper":"/paper/2406.02496","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:083be75d6ee81bf1760977c918ffc6f29d5421da5f37a46a7e5cb0d1ef72bbca","observation_id":"98f35c52-87ae-4319-aa4b-0ed9044ecf76","resolution":{"observed_at":"2026-08-11T13:08:20.575502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16674","last_updated":"2024-08-17T15:20:31Z","snapshot_observed_at":"2026-08-18T11:15:01.687093Z","submitted_at":"2024-07-23T17:43:35Z","title":"KAN or MLP: A Fairer Comparison","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16674","snapshot_observed_at":"2026-08-11T13:08:20.579898Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.579898Z"},"links":{"cited_paper":"/paper/2407.16674","citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:cf99e2efe25edbb6516adce208de158e0dcf1ab0acb38afddf17349452adfcec","observation_id":"11791cd6-e10c-478e-9ef8-91912830a983","resolution":{"observed_at":"2026-08-11T13:08:20.579898Z","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-11T13:08:20.584265Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T13:08:20.584265Z"},"links":{"citing_paper":"/paper/2412.13571"},"observation_digest":"sha256:55b92c661258143ecb921ff534552a8bd7ebc4a87cd721b396aea5cc8ed0fa5c","observation_id":"2b2e7d71-6a7a-49ac-87fc-922668ce7d3c","resolution":{"observed_at":"2026-08-11T13:08:20.584265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.13571","last_updated":"2024-12-18T07:42:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T01:08:07.131719Z","submitted_at":"2024-12-18T07:42:34Z","title":"PowerMLP: An Efficient Version of KAN"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":35},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2412.13571."}