{"as_of":"2026-08-14T01:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2a47b4b26f1a4c5586b56a4eba29a3a1a640ea771deed2538f96d47b9468fa7","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":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/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-11T19:00:36.294444Z","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:95a6185c0a259b7668c851a21a5201f1f917a7ac335d0e08e57a31a54aa57e8e","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-11T19:00:36.294444Z","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:e5a69cd40538b01b0d1305e0717a25ac292f6e3225eedb0a3541c11bbbe59dfe","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-12T23:38:11.705524Z","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-11T19:00:36.294444Z","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:19066e2ffd7e05e06002b4bee34739b414818de16404dc03002d771dae88abd5","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-11T19:00:36.294444Z","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:b1e63c1faf7b8c9d83ad8bcbbfd84760a6f111aae429c4982cac6b3750bbf56d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T00:02:55.681025Z","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-11T19:00:36.294444Z","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:975eabc62a1f9477d6fd125c250dd471732afa3d654838282b30950f4820f85b","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-12T23:34:28.218166Z","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-11T19:00:36.294444Z","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:349150e38f7b54189ec49e1a2b2533659216d6db72bcf0b9722a5b721535a3b5","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-11T19:00:36.294444Z","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:4fb18aa55aa5bc12120401a8fdae632adc129aa210abde78d965467a798f2069","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:ee7535b8856ea09394e1b094a1bf8c6722c8761247c5063260ce0484a88d066f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T17:24:50.798640Z","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-11T19:00:36.294444Z","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:605bbc2b5cd8fe7f46c88db0497e90d499fa5594aea379ef719649b22a236b5b","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-11T19:00:36.294444Z","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:f704759876691bb64bcee08a25364a700ad2910cdcc0551d4673d5d9d04ae6b7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:1ef2321b77a0bd665d6bc103c40823833f846ee6ff6542eb8fe95f5d228ad5ad","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:cd432509f19ece4b0dece9194e0eaeb145230c2c6c17f8b090e3dfff84bf97c5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:18ea76f52f9f5b596272234cc67a5ace5d5a8998d7326c20b03c46b5727e84ab","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:06c7524d8f05aa619bf444031a41c9f17b616c3fdf27840a2a189d65a9a14dbf","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:de217b8d493199c3d7d60b054759674d90d81e72d72e5e919d25e2741b6634ae","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:da490061f31f9af9650df8be0b57c28f0123e8991d437466af893f8cc118f7f9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:9046a8f9e92f3d54b029e9d95e308a47711ffe4554470580debb76b8754cec18","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-11T19:00:36.294444Z","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:846d713aef985cbb427fc1a1fbbdf4486ed03eb6e68bca1e7034f7180f99a2b0","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-12T23:34:59.638832Z","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-11T19:00:36.294444Z","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:e8e67aa7a33c3840b3963f3421fc6e1a88df1805b39977d62aaa29c00b3fece4","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-12T23:46:15.071452Z","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-11T19:00:36.294444Z","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:05fd8ea751afcccd7d3144bc017585dfd62fc03946cadc1bb72b0691f6aab4a0","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-11T19:00:36.294444Z","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:be59bc253a4b3fadc67ea486b2facdc09bff880bb857e44d13874ceea23dd060","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-11T19:00:36.294444Z","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:760fb15a8b1fd8c0b52344b7c9c74d3def9a00407ec978a9c2a93144acaa982d","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-11T19:00:36.294444Z","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:950728c60bfc4f64815caa5ffd18e3ea153c3487bd0362d94f5a307c8fc07cb2","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:6f47e7b8309a89b39fe76220af8b401f85a7e8cf66ccbde49423e93537226c09","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T00:10:29.802895Z","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-11T19:00:36.294444Z","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:5426f442c67d921c6108eeddbd7e107e41141008a6cbc9fbffdedd697cf84504","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-07-06T18:07:47.744531Z","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-11T19:00:36.294444Z","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:35e4825d9d03a496dd4dbeae6b64ac182f58ed8370254bf0844a3d9609f8b242","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-11T19:00:36.294444Z","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:c1438bc1693fdfcfda88186099b6cd9967a76f8966a4a022af698e740416c56d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T19:00:36.294444Z","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:58dd3d37bf5e59b5f849527c1232601052972b762fb1740add1ea5339cb792a7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T07:29:29.524604Z","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-11T19:00:36.294444Z","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:36f140b873ad9ff585b4ab0e2c3e9e28efd3e1501d312b43e1a25e7126637c1a","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-11T19:00:36.294444Z","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:ca4aa0c809755c731a57e96c1514e75e44a8970afd8c856a204d442da58b574e","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-11T19:00:36.294444Z","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:d26079f314b92f19c7e90d997fd5c848accf2d2a597f22252e36a9cb2a0b4614","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-06T02:11:23.670680Z","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-11T19:00:36.294444Z","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:947ba073ad0289097af51b08fd3c08e3e59e4469fbdc0077a927bf23f10703c0","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-12T23:50:18.534344Z","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-11T19:00:36.294444Z","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:eea302dd31f659d0480a5c92cfff3c327516ba4b04c83865fe4300da7dd8cdf0","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-12T23:16:13.337531Z","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-11T19:00:36.294444Z","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:fda2d72b7a9e3138762a339fca1787c85dbe1123049cf571bfd8089cd264c05f","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-11T19:00:36.294444Z","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:dac6ca84264bf0463755e72a2fbf1b8369f007eceaab886a8b873e48e7ce4f7e","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-11T19:00:36.294444Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2412.13571."}