{"as_of":"2026-08-14T16:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a018fc89f9fca1ae08f5acacad5babe660b983de33c3259f50c924d9ac2c2bb5","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T01:48:19.732988Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2605.08451/citation-record","integrity":"/paper/2605.08451/integrity","json":"/paper/2605.08451/citation-record.json","paper":"/paper/2605.08451"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Using fast weights to attend to the recent past.Advances in neural information processing systems, 29","venue":null,"work_id":"282280ad-7323-4fdb-8172-200f7d9eec39","year":2016},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:cb9141d6277438882accf7fbeff60ebbb096869efdb76ef61a35583fca8331e5","observation_id":"19a2b7be-33bb-40c0-ae6e-cd6e2e303175","resolution":{"observed_at":"2026-05-14T05:58:15.180598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f1847f87-8c4d-4a8d-ab06-d37cc4304849","year":1989},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:3328e48541447a970c2b02ded8209af04764ee7dba301734e8172ce307822cd8","observation_id":"5ed1dd8b-b5e0-469c-8e8e-97a2b2b812e9","resolution":{"observed_at":"2026-05-14T05:58:15.200440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"FFTs in external or hierarchical memory.The Journal of Supercomputing, 4(1):23–35","venue":null,"work_id":"bade5090-d09e-4f5e-af70-761a73b37808","year":1990},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:c45047150d057c61c7c37e9bf6370f7f95e4ef203edfe54b87647edf9ab87b94","observation_id":"81e176ba-52da-4652-b381-b42cc7895818","resolution":{"observed_at":"2026-05-14T05:58:15.189394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"An algorithm for the machine calculation of complex fourier series.Mathematics of Computation, 19(90):297–301","venue":null,"work_id":"4d00c068-b6d1-4a53-b280-7ad7c5ddc622","year":1965},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:c7f3503ba80964f2c0118f5d1a7829ec46e00d761a73150fc32157d811d058d3","observation_id":"a6ac2edd-1b63-4885-816b-c0890a66ec99","resolution":{"observed_at":"2026-05-14T05:58:15.194949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Monarch mixer: A sim- ple sub-quadratic GEMM-based architecture","venue":null,"work_id":"e1e0a389-cb2b-4a94-9200-73b2a63ebc0f","year":2023},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:4400fddab4f6e96a3226dcb548812348fb0c72341fae994628a8a16f65230388","observation_id":"e6343b30-d306-4118-a920-127fb89bec62","resolution":{"observed_at":"2026-05-14T05:58:15.172156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05908","last_updated":"2023-11-10T07:33:35Z","snapshot_observed_at":"2026-08-13T05:28:38.078233Z","submitted_at":"2023-11-10T07:33:35Z","title":"FlashFFTConv: Efficient Convolutions for Long Sequences with Tensor Cores","version":1},"cited_work":{"arxiv_id":"2311.05908","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.05908","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Y., Kumbong, H., Nguyen, E., and R \\' e , C","venue":null,"work_id":"af21a753-aec2-428e-9f4b-e9eadd9e6326","year":2023},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"cited_paper":"/paper/2311.05908","citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:8a61bab715a6ab3f69ac4094cee3485d3231df171a35d7a71f2d84a64a2e1881","observation_id":"0e75312b-39e0-4d18-b04e-71e94dc4b9b4","resolution":{"observed_at":"2026-05-12T07:51:37.185732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5d8af3c0-8b85-4d2e-96ec-734c41ba58d6","year":2006},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:394612b010f7f4ceae3bfeca59398156c7154794305aab7aa726d39cf96ffb7a","observation_id":"b148774d-f687-4657-b31d-57fde3c6cf6a","resolution":{"observed_at":"2026-05-14T05:58:15.192101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":"2312.00752","doi":"10.48550/arxiv.2312.00752","metadata_source":"pith","pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","venue":"cs.LG","work_id":"4ee75248-1199-492c-a52f-6661e0f4adff","year":2023},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:2b2fbb394cab6a7ab8bde531351866574551bff81c08928cefa8f0303be7e7ae","observation_id":"babc6f69-6d76-492f-806a-7259890cea0c","resolution":{"observed_at":"2026-05-12T07:51:36.836029Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-13T20:38:14.544227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T20:38:14.544227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Efficiently modeling long sequences with struc- tured state spaces","venue":null,"work_id":"79710510-ba1f-4ff2-a10e-c3a8cc28f773","year":2022},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:824a12cecdb00f1ff038cb949a07f8180a1e5e2b9441c34d570d242000648d1e","observation_id":"af9754a6-1875-44a9-b625-1a852e894afb","resolution":{"observed_at":"2026-05-14T05:58:15.186243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Multiplication of many-digital numbers by automatic computers.Doklady Akademii Nauk SSSR, 145(2):293–294","venue":null,"work_id":"51ca5794-4e7a-4106-b585-961b4b0c4cdc","year":1962},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:8ef262be4ed71cd9e29bc5418fb069783ee96f754aee81f35b45046034e1e454","observation_id":"29cc16e4-ed86-4d9b-a15e-05f813f54a37","resolution":{"observed_at":"2026-05-14T05:58:15.174885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Zico Kolter, Tri Dao, and Albert Gu","venue":null,"work_id":"75a75018-5064-43e4-a486-625e168010fb","year":2026},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:dbfdda6ff8281462332ab9b792d4d228c99bed6db2a653c734405c0ef6499668","observation_id":"f5bd4dc0-a4c5-4c9c-bba5-e2259b1df267","resolution":{"observed_at":"2026-05-14T05:58:15.197788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Jamba: Hybrid transformer-mamba language models","venue":null,"work_id":"08bed087-958c-4b4a-9ef9-cb4b19979073","year":2025},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:523e789e51aef5c374a2762d084f010182580a9a1ed5e1adaa8516d4c7e75169","observation_id":"04fef193-d6f5-470d-bca0-22923a34e5b8","resolution":{"observed_at":"2026-05-14T05:58:15.177815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.10489","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Isabel Liu, Windsor Nguyen, Yagiz Devre, Evan Dogariu, Anirudha Majumdar, and Elad Hazan","venue":null,"work_id":"867ea6b2-bada-408f-83b1-53af9c66c704","year":2024},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:9c53810ca6e7f333df26b214b695c9409548053b63a3eff1b172fa088342d4b5","observation_id":"a629e638-a338-4bd4-9639-8ec328d4bd10","resolution":{"observed_at":"2026-05-12T07:51:36.956728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"The FineWeb datasets: Decanting the web for the finest text data at scale.Advances in Neural Information Processing Systems, 37:30811–30849","venue":null,"work_id":"5013c1a6-dbb9-44f2-a34e-386c4e649cab","year":2024},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:b2042aec024b4c4116cac4f890ed940778af2c28d729722020dafa907a9cc5ab","observation_id":"3718684c-9301-4a26-b157-525f0d27f16f","resolution":{"observed_at":"2026-05-14T05:58:15.203329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Hyena hierarchy: Towards larger convolutional language models","venue":null,"work_id":"8ebe556e-e20c-44ac-b7dc-797f9b426c56","year":2023},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:d7f6ac835d171ed2534f5fc59aee719fabaf44581e4fa6cd818882a5cdb83193","observation_id":"f31a31cc-5c38-43f5-a2f7-743d642d3061","resolution":{"observed_at":"2026-05-14T05:58:15.167098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17844","last_updated":"2024-08-19T17:26:18Z","snapshot_observed_at":"2026-08-14T13:45:36.750676Z","submitted_at":"2024-03-26T16:33:12Z","title":"Mechanistic Design and Scaling of Hybrid Architectures","version":2},"cited_work":{"arxiv_id":"2403.17844","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.17844","snapshot_observed_at":"2026-07-04T18:40:03.331686Z","title":"arXiv preprint arXiv:2403.17844 , year=","venue":null,"work_id":"8e9256eb-e497-4fb3-9807-fb16ed972a6b","year":2024},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"cited_paper":"/paper/2403.17844","citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:d1e92b4733ca41abee43e3cf904aa88dda22a08d0693f95e52d00aa7bc52f2d3","observation_id":"fabed174-1d0e-4981-a6ba-7872533ea0cb","resolution":{"observed_at":"2026-05-12T07:51:37.108392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Benchmark- ing and building long-context retrieval models with LoCo and M2-BERT","venue":null,"work_id":"f1887a80-51fa-4839-9fd6-93a1698fa7e5","year":2024},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:754406b3fcb088b40e05b8ddb4592e68be161ff24a21d3ac6f1b4f51571eda2a","observation_id":"6678c7e1-8426-4b89-8fba-4f598c901cf3","resolution":{"observed_at":"2026-05-14T05:58:15.169673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"85664032-2f24-4a86-b5e6-ab04cf88fe78","year":2025},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:6a83c2c0460795a0d3a871cfeab73c2f69fef423c7969ccbbf457223dc4448da","observation_id":"4600d6cb-d34e-4593-8066-b6a6f235dec2","resolution":{"observed_at":"2026-05-14T05:58:15.183150Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03865","last_updated":"2024-08-21T12:08:00Z","snapshot_observed_at":"2026-08-12T23:07:09.450552Z","submitted_at":"2024-08-07T16:13:43Z","title":"PackMamba: Efficient Processing of Variable-Length Sequences in Mamba training","version":2},"cited_work":{"arxiv_id":"2408.03865","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.03865","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"crossover point","venue":null,"work_id":"3e894d58-aa49-434c-8190-582d8b4ee49f","year":2024},"citing_paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-12T01:48:19.732988Z"},"links":{"cited_paper":"/paper/2408.03865","citing_paper":"/paper/2605.08451"},"observation_digest":"sha256:2a6185e5ef198a05b939c743175e8d36e6ab15b216492f10b3eb3ac22d4aa9a8","observation_id":"2814c80f-5219-43f5-84c9-fda374bb930e","resolution":{"observed_at":"2026-05-12T07:51:37.076900Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.08451","last_updated":"2026-05-08T20:17:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T13:20:21.075763Z","submitted_at":"2026-05-08T20:17:12Z","title":"RubiConv -- Efficient Boundary-Respecting Convolutions"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":5,"verified_fuzzy":11},"total_outbound_references":19},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2605.08451."}