{"as_of":"2026-08-18T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a9ea4790f0ae7bdf974d01bf1a4f133c278a5155fcc106c07fb195fc0a034bcd","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:34:27.978806Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:07:36.820969Z","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-10T20:11:52.798726Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"cited_work":{"arxiv_id":"2412.11007","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11007","snapshot_observed_at":"2026-08-10T20:11:52.798726Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","venue":"cs.DC","work_id":"f96d4be8-7f2c-4e51-ace7-2338dd3d1c68","year":2024},"citing_paper":{"arxiv_id":"2501.09251","last_updated":"2025-01-16T02:38:03Z","snapshot_observed_at":"2026-08-17T21:43:41.478321Z","submitted_at":"2025-01-16T02:38:03Z","title":"Acc-SpMM: Accelerating General-purpose Sparse Matrix-Matrix Multiplication with GPU Tensor Cores","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T20:11:52.705588Z"},"links":{"cited_paper":"/paper/2412.11007","citing_paper":"/paper/2501.09251"},"observation_digest":"sha256:1f2ca07a9b678d2ee79e5d5b828c22bc357f453bb8606d94047a18f2991b99d8","observation_id":"aea8cd1c-d001-4ecc-9004-69523ba72181","resolution":{"observed_at":"2026-08-10T20:11:52.805572Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11007","snapshot_observed_at":"2026-08-15T22:07:36.820969Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08098","last_updated":"2025-05-12T22:09:05Z","snapshot_observed_at":"2026-08-18T16:06:50.213312Z","submitted_at":"2025-05-12T22:09:05Z","title":"Fused3S: Fast Sparse Attention on Tensor Cores","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T22:07:36.820969Z"},"links":{"cited_paper":"/paper/2412.11007","citing_paper":"/paper/2505.08098"},"observation_digest":"sha256:d26a5d532d448db2b3f5ef854210be18fb7337091a13f4d573e8e9745eba236b","observation_id":"03145871-051b-4794-b051-6b896bfb2556","resolution":{"observed_at":"2026-08-15T22:07:36.820969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.11007/citation-record","integrity":"/paper/2412.11007/integrity","json":"/paper/2412.11007/citation-record.json","paper":"/paper/2412.11007"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:34:28.723608Z","title":"Tensor Core","venue":null,"work_id":"c294e594-5bdb-44cd-af93-e119ca865c8f","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.760986Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:1e6e08b40330355d8cdc769060d58d17b91eefb86826d0b051472d9af1302519","observation_id":"388e3eb2-400b-4d3a-8b03-745627f4e17e","resolution":{"observed_at":"2026-08-11T15:34:28.728479Z","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-11T15:34:28.708392Z","title":null,"venue":null,"work_id":"b5d993cb-e8fd-4bcc-bddd-f342169685f0","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.766528Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:30b680c5dda3294db5d63ebd24a24d3d1c5e497a235dc2897f3f4e3e2849e64f","observation_id":"12f4c0cf-816c-4762-ad30-a7a87356a956","resolution":{"observed_at":"2026-08-11T15:34:28.713184Z","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-11T15:34:28.693332Z","title":null,"venue":null,"work_id":"78098321-f6b6-4efc-b7de-702b6c39db28","year":2015},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.771684Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:0377714dc2b148da00d0e623e43b4deee51d96e7dbf65ac64b5e9d6299c61a0a","observation_id":"855aa020-42d6-4687-a8c9-cb756ed9bab9","resolution":{"observed_at":"2026-08-11T15:34:28.697704Z","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-11T15:34:27.776824Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.776824Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:70006b45b66e8f47342432cb0b8e22dcf0df1c56191ed59ff9ad5fdf16ea5983","observation_id":"2f4553e5-30f6-4f4c-84ab-d9dec8f9f3f2","resolution":{"observed_at":"2026-08-11T15:34:27.776824Z","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-11T15:34:28.669511Z","title":null,"venue":null,"work_id":"75081977-a881-4f4c-aa2c-221ab358d0e2","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.782000Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:3bce9468857f1df8c7334745a4de5f7b8ff5cacb33e37959709c0a2421d6e00c","observation_id":"33918e26-782f-4aed-9f94-982c7d40b645","resolution":{"observed_at":"2026-08-11T15:34:28.674030Z","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-11T15:34:28.654363Z","title":null,"venue":null,"work_id":"31e59def-a554-4d3e-b79b-26af398ff637","year":2021},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.787062Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:b2b2aea2feefc72f2f9ae17c1cbbc69fe80ca4c2df100ea43896e952a9f16b2d","observation_id":"154be1a0-16d8-4210-a3d9-cb233e713d72","resolution":{"observed_at":"2026-08-11T15:34:28.659304Z","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-11T15:34:28.639492Z","title":null,"venue":null,"work_id":"6896dcee-aa5e-4536-88ce-67292da7e705","year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.792529Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:662f7f91037c8728dfa1080dd8716609606db8f890ff809e56ddb4791995921c","observation_id":"2f6c688b-5e6a-4b7a-92a0-538fedb907ea","resolution":{"observed_at":"2026-08-11T15:34:28.644100Z","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-11T15:34:27.796836Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.796836Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:303d6b19b8124730b4582e41887648b5f7e734c892fc48ce9afe3322d0927a11","observation_id":"7593397d-09b7-438f-9778-d7a42602026a","resolution":{"observed_at":"2026-08-11T15:34:27.796836Z","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-11T15:34:28.611313Z","title":null,"venue":null,"work_id":"7109e5d7-a32f-4883-8396-1905319a34f6","year":2018},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.801342Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:d0ea936ebd90371bb3f3cb400c9d364d1197ddda24bcd90994150187ada24fd6","observation_id":"309ff8ed-61b8-4b50-8ec0-245f1f2bedfd","resolution":{"observed_at":"2026-08-11T15:34:28.616826Z","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-11T15:34:28.596500Z","title":null,"venue":null,"work_id":"1b670f21-4660-4519-9ed8-2cf3c6c42810","year":2024},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.805709Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:bf45fca9bc74753f58307d4d7c8565a1401d3b39c2871db93d7d671658040d94","observation_id":"fb1dc27c-e7ab-4899-8d35-cde249e2a90f","resolution":{"observed_at":"2026-08-11T15:34:28.601183Z","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-11T15:34:28.580277Z","title":null,"venue":null,"work_id":"a2e3f700-6500-4914-935e-562c533368bb","year":2021},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.810092Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:58515aa2efe4ef5d99fbab794230f246664f8a9a868438bfb61c5c925bcaee52","observation_id":"343fa8ae-a3e1-45c0-bec6-236b1b7c4af6","resolution":{"observed_at":"2026-08-11T15:34:28.585367Z","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-11T15:34:28.564850Z","title":null,"venue":null,"work_id":"ab3ea908-50b7-4ba6-b8ab-42201c0ec13d","year":2021},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.814493Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:5d875b59eaef102dcd4dd524133bfa8274cdd00c37a3b5d3a1cb278d20d21853","observation_id":"f79286b7-53eb-4a9d-9113-f206e4465ccd","resolution":{"observed_at":"2026-08-11T15:34:28.569537Z","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":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-11T15:34:27.818848Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.818848Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:264febbbce4a28656d64d88431b24eca13dc58056bd231471b17a6ac615545c5","observation_id":"4a2f6ddc-973d-4635-89f8-1f1d14440871","resolution":{"observed_at":"2026-08-11T15:34:27.818848Z","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-11T15:34:28.549730Z","title":null,"venue":null,"work_id":"7a0b55be-bd29-4b7a-a30d-910f02d5947d","year":2020},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.823562Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:4fe647424689853f7b20d071b94e66d68e6239f495aa76edc9bd2eff05c6df54","observation_id":"3c8e18d3-b5ca-4eb7-bdb3-57f7ab129818","resolution":{"observed_at":"2026-08-11T15:34:28.554509Z","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-11T15:34:28.534679Z","title":null,"venue":null,"work_id":"3b4912b6-7e09-4890-82e8-a85fa91d6867","year":2012},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.827509Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:eff43d1d36c587b38790710fcb0d908ccefbe271e03baace71e2802d5dfbd8ba","observation_id":"a5b20648-9532-4948-b9f7-756a0952431d","resolution":{"observed_at":"2026-08-11T15:34:28.539523Z","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-11T15:34:28.520583Z","title":null,"venue":null,"work_id":"5d25616d-2065-49ee-bcbe-c18d4a92366a","year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.831361Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:62e6575263f0d796191349ef54db2ef947ab7fc14b4a34c52df9f973d9b16357","observation_id":"e8b03fa3-1825-4298-876e-c71544e596a2","resolution":{"observed_at":"2026-08-11T15:34:28.524904Z","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-11T15:34:28.506116Z","title":null,"venue":null,"work_id":"9d1432aa-ba6f-4bde-ad69-67dc897bba2b","year":2020},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.835194Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:859a3cb477df2cfd7618dee407759cc02b143af97094e3bbc6c226318c65d9bf","observation_id":"f5ec0926-5791-4111-9e6e-8e43ac7fde93","resolution":{"observed_at":"2026-08-11T15:34:28.510456Z","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-11T15:34:28.491163Z","title":null,"venue":null,"work_id":"23032189-26b4-41e3-9dd3-fccf319443dd","year":2020},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.839175Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:7b7295d708c5b327bcd158d94f332c330530b4d50c474426e5c4a170ec9e4490","observation_id":"fe2e76c4-39d6-4f3c-b583-ae5d35da7528","resolution":{"observed_at":"2026-08-11T15:34:28.495856Z","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-11T15:34:28.476354Z","title":null,"venue":null,"work_id":"316bed6b-1b98-4f13-94ad-536932ba51b3","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.843792Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:5a6fd483c14044f0596065b12d1110f2dd90d199586c52403096cbec2540dfcf","observation_id":"9979645c-fbad-4347-975a-e5b581d0e8c9","resolution":{"observed_at":"2026-08-11T15:34:28.480947Z","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-11T15:34:28.461688Z","title":null,"venue":null,"work_id":"342e1367-977f-4ad0-9402-ebffc1e409e0","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.848465Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:b3d742aebaa806c8e86f754581f5f8bc67b23685462d4370ba66eda1ee379344","observation_id":"7793eacc-c656-4740-8e96-86d2b6f0ee01","resolution":{"observed_at":"2026-08-11T15:34:28.466195Z","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-11T15:34:28.447075Z","title":null,"venue":null,"work_id":"00f8435e-0a84-4a16-96d9-a87aaf42911a","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.852941Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:0f756c25293ed2229bbb4fbb59b7f1494245588a085f79de8a78aeae63fe0231","observation_id":"4750f672-5d0e-4301-9313-97d22d18c23e","resolution":{"observed_at":"2026-08-11T15:34:28.451641Z","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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-11T15:34:27.857468Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.857468Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:f9201d96a7f6edc78b22b79e0ecba2c05511270dd98020062933764bdc0bc7a9","observation_id":"f046e2b8-3709-4116-a376-210f272f2a66","resolution":{"observed_at":"2026-08-11T15:34:27.857468Z","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-11T15:34:28.432135Z","title":null,"venue":null,"work_id":"268bddac-dfa7-49ac-bffc-88be9d010966","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.862900Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:8ca8ddb6b247401ef6db8083f47f2ef90906f74a66ddcfd4dfd654de52093da8","observation_id":"03438580-c23d-4cb7-9dca-3a1a877d08b7","resolution":{"observed_at":"2026-08-11T15:34:28.436758Z","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-11T15:34:28.417323Z","title":null,"venue":null,"work_id":"89849476-fdbc-447e-8266-534ef801a97c","year":2009},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.867168Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:3509f70a8a813169aa17a86d9e999f068fbbbb62b511fcf85c292eade78393af","observation_id":"21805794-d27d-4deb-9f12-0a4f9a572cd1","resolution":{"observed_at":"2026-08-11T15:34:28.421980Z","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-11T15:34:28.402606Z","title":null,"venue":null,"work_id":"7ad84a85-03e9-4616-95b8-115da108eec9","year":2014},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.871861Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:48919262920e0b7887a2be2aa54c6fc26871bc24391f8b6f3f988f56e98cd321","observation_id":"92ab81dc-5fa5-49d4-83bf-3e6dd1047f08","resolution":{"observed_at":"2026-08-11T15:34:28.406753Z","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-11T15:34:28.389253Z","title":null,"venue":null,"work_id":"287f64ec-6531-41a3-8684-75c6a0131ce9","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.876478Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:811415a1fab9d5481d319407a2137420ea6cdb1bb9abe758301561d3f350ad71","observation_id":"850f6a2b-8049-4b92-9fca-e5027451e6e1","resolution":{"observed_at":"2026-08-11T15:34:28.393620Z","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-11T15:34:28.375560Z","title":null,"venue":null,"work_id":"a6bd4587-e78a-4509-afc8-985728aa8997","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.880974Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:1ef768cf5afd452dac6b80370da42490ffcdef9384f798d2e143c5b323be9249","observation_id":"48d28e72-d349-4b6c-adce-0d5c3a2942ae","resolution":{"observed_at":"2026-08-11T15:34:28.379860Z","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-11T15:34:28.360207Z","title":null,"venue":null,"work_id":"c765e6be-0071-4625-a638-c8a378d8dd8a","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.885429Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:a276cb2e48e50dc86450f8e6dcac411f68169fbc03618e9efcc3fd1f9c1badd7","observation_id":"97a89beb-8171-444d-b8d6-53fd397e7322","resolution":{"observed_at":"2026-08-11T15:34:28.365399Z","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-11T15:34:28.345272Z","title":null,"venue":null,"work_id":"6de8dee5-13bb-4e2b-9960-8100ba080118","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.890122Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:bce707177dec5e11bee26f8f7ec09c58bc11c3c3b4d704347fa88a19a7b9d6a0","observation_id":"43c8788a-c013-47e7-bddc-e8a5a92c54b1","resolution":{"observed_at":"2026-08-11T15:34:28.350104Z","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-11T15:34:28.330921Z","title":null,"venue":null,"work_id":"4123ba95-3091-4571-8225-b21b1880308d","year":null},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.894626Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:d27d67214ba31e1560a9c269c8f6fe28465f24f6a7d5e2faa80d1bac79d4b11a","observation_id":"d09686fb-0c53-4c23-817b-074e1dd0dc85","resolution":{"observed_at":"2026-08-11T15:34:28.335594Z","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-11T15:34:28.315998Z","title":null,"venue":null,"work_id":"f206ec2a-6e8b-4c9c-acdb-3bd438b00df5","year":null},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.900275Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:c993f8ca391807128914f0e81b299153094f64bfb2135e529d92bbd3a6b3634e","observation_id":"4e879b49-dc3d-44dc-896b-9c1f586569af","resolution":{"observed_at":"2026-08-11T15:34:28.320820Z","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-11T15:34:28.301451Z","title":null,"venue":null,"work_id":"2c3e5628-7441-41cc-b10a-9e869e67af40","year":2020},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.905090Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:124e9e16a5ca77931076a8f069797177ddd867664d6d61fcc7e06128ff34594e","observation_id":"6211bc12-f294-4bd3-943c-cd82f41f69b7","resolution":{"observed_at":"2026-08-11T15:34:28.305727Z","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-11T15:34:28.287635Z","title":null,"venue":null,"work_id":"a40371ff-d370-4e56-a9a8-7cd1e59dcb8b","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.909743Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:75dcf829fdcc223290f60514c90c5f9961233fc35185625e25c51150fb55dc26","observation_id":"e3441fd4-b59c-4241-a643-f02bc71a7447","resolution":{"observed_at":"2026-08-11T15:34:28.291743Z","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-11T15:34:28.273254Z","title":null,"venue":null,"work_id":"67548452-2bfb-4f6b-a21d-89644b017dcd","year":2024},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.914124Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:1de9640530f3be3aa799d9e09515e2ae91f34f1bad98fb8d1a886edfbf2947ce","observation_id":"3c0b85b9-5245-40c6-8a63-62481bdaf638","resolution":{"observed_at":"2026-08-11T15:34:28.278217Z","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-11T15:34:28.258668Z","title":null,"venue":null,"work_id":"6b3238df-8a78-4196-aeca-3fa1cf34dea5","year":2024},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.918580Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:4cb7d41b692c29b73367cdd78a4fcf061e3afb8ac7d3c538e6010c06b4247afb","observation_id":"4ec7f9a3-613a-43fd-b801-b42f5d9fa02d","resolution":{"observed_at":"2026-08-11T15:34:28.263329Z","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-11T15:34:28.243457Z","title":null,"venue":null,"work_id":"edbb688b-9bf6-462c-bc88-985515d275fc","year":2022},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.923435Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:118ca77f2140d889fb04365d0fd4f468f180155875274be80e9228ba960e9350","observation_id":"05a0a8db-a1b1-4712-9680-b5d96d42f0d2","resolution":{"observed_at":"2026-08-11T15:34:28.248443Z","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-11T15:34:28.227414Z","title":null,"venue":null,"work_id":"95f3976e-6625-475f-8956-968fe7356710","year":2021},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.928154Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:15b746e8ecd484a8cc1767ea851654e4ee2fc3fce31d020b5cce95578b11bb94","observation_id":"34dbffa9-4f18-4b65-a633-924dc2eb945f","resolution":{"observed_at":"2026-08-11T15:34:28.232769Z","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-11T15:34:28.213100Z","title":null,"venue":null,"work_id":"99ad3127-207f-4cda-95a9-3c0493da531a","year":2010},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.932253Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:94d155eabc663b6dcb39885bf40e1c69ea46fee7538d5350d4746d9b9da1fd8e","observation_id":"e99d38d5-1423-46f5-b216-acb76cfc0884","resolution":{"observed_at":"2026-08-11T15:34:28.217252Z","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-11T15:34:28.198393Z","title":null,"venue":null,"work_id":"b9d36a6b-75b9-4b79-9bae-29375fe93531","year":2008},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.936186Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:2f92d95b26f35b8ab0346fadaadcccbead23fd0de34f980b27cdd6e6b3929ea7","observation_id":"38ceab19-fc1a-49fc-8164-e2979f794170","resolution":{"observed_at":"2026-08-11T15:34:28.203064Z","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-11T15:34:28.183482Z","title":null,"venue":null,"work_id":"ff2991c3-51a5-4127-b1cf-1e2f52eaaafa","year":null},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.940212Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:86322fad4b4b32758d5829d019a7e9caf5be93d64da14e6f627bb5e82444f6cf","observation_id":"f1927d58-3fab-406c-bc1d-0a2047a2bd13","resolution":{"observed_at":"2026-08-11T15:34:28.187607Z","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-11T15:34:28.167934Z","title":null,"venue":null,"work_id":"59fc083f-275f-43ce-b028-0a9f2c3d6cf4","year":2009},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.948727Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:f36eacbb92518e5ea273dd85b1b01d0564cbd7465d7cdfa443889fb899493363","observation_id":"01d6d8fa-fa90-494a-a59e-62d9e28dee5a","resolution":{"observed_at":"2026-08-11T15:34:28.172307Z","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":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-11T15:34:27.952923Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.952923Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:3337b251bbc8abb1066ecd572a17b6bc79e521a01b43f07af87462d4520c1c05","observation_id":"a8c47ada-0346-4477-9877-15e414c0d774","resolution":{"observed_at":"2026-08-11T15:34:27.952923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.01315","last_updated":"2020-08-25T15:46:13Z","snapshot_observed_at":"2026-08-18T10:54:34.717319Z","submitted_at":"2019-09-03T17:10:28Z","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01315","snapshot_observed_at":"2026-08-11T15:34:27.957488Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.957488Z"},"links":{"cited_paper":"/paper/1909.01315","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:a119bec7733984c1a30b5eb53166cb1e229528dd7e4e4424b48a9b79dd42cc4e","observation_id":"99dcba07-ed40-41e1-9a16-6e0bd1aa0a63","resolution":{"observed_at":"2026-08-11T15:34:27.957488Z","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-11T15:34:28.153059Z","title":"2021.{GNNAdvisor}: An adaptive and efficient runtime system for{GNN} acceleration on{GPUs}","venue":null,"work_id":"0cd47c38-9ac6-404c-b9f4-da1818343f16","year":2021},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.962288Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:8508ca061d1d5d82ce2432395018e7faf9ddce5616f1f6dd725283865fd8332f","observation_id":"8019a65c-be86-407a-af34-1ec32303637d","resolution":{"observed_at":"2026-08-11T15:34:28.157867Z","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-11T15:34:28.137067Z","title":"2023.{TC-GNN}: Bridging Sparse{GNN} Computation and Dense Tensor Cores on{GPUs}","venue":null,"work_id":"34cf7ab6-3787-4ad2-a47d-05ae4ba966ff","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.966458Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:4f1932bfa0c681d489e7d963d31da80c1b31d6cddb8fcfa55299971a4f62a946","observation_id":"caa6d490-b528-4e74-9e4b-15cc050580be","resolution":{"observed_at":"2026-08-11T15:34:28.142489Z","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-11T15:34:28.121751Z","title":null,"venue":null,"work_id":"cf489695-96ed-4e1c-9438-6a768c53bc78","year":2023},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.970281Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:c1f335d1bb873594eb7c475e81616e0d3463fbe5c371b65d4d28f210eac52170","observation_id":"4176c87c-12c4-40df-afe4-eacd8217ae69","resolution":{"observed_at":"2026-08-11T15:34:28.126536Z","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-11T15:34:28.104987Z","title":null,"venue":null,"work_id":"211769d1-65d4-4f10-87f8-4b0e5482c68f","year":2020},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.974295Z"},"links":{"citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:ec148e4968f76b95b1be01853dbed56e45b9db7462ae5db2e1a07ca9a0b754e2","observation_id":"a1baf1f7-7e00-493e-a3ae-24c1e7f7bc20","resolution":{"observed_at":"2026-08-11T15:34:28.110591Z","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":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-11T15:34:27.978806Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.978806Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:a97383da22dbf8c262af09d18d25f3475e7c110ed80ba739ce23c9097561028d","observation_id":"2d58d681-eb4c-47b5-b8db-02518fa32f0b","resolution":{"observed_at":"2026-08-11T15:34:27.978806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03735","last_updated":"2018-03-10T02:01:35Z","snapshot_observed_at":"2026-08-14T19:37:38.456103Z","submitted_at":"2018-03-10T02:01:35Z","title":"Attention-based Graph Neural Network for Semi-supervised Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03735","snapshot_observed_at":"2026-08-11T15:34:27.944305Z","title":"arXiv preprint arXiv:1803.03735 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.944305Z"},"links":{"cited_paper":"/paper/1803.03735","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:9141bc4f61416932171f0506076a0985582fa0d8950336354442cf0f0cc6df54","observation_id":"a84c6d5e-7a49-48b6-879d-b565954a36a8","resolution":{"observed_at":"2026-08-11T15:34:27.944305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":49},"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 18 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 2 inbound Pith citation observations for arXiv:2412.11007."}