{"as_of":"2026-08-20T01:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad781620a1f18c2a48d70f1e34cffc6523b95b9d3128831d2599719f32e5f026","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:25:18.522216Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2504.13034/citation-record","integrity":"/paper/2504.13034/integrity","json":"/paper/2504.13034/citation-record.json","paper":"/paper/2504.13034"},"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-16T12:25:19.223336Z","title":"Full version","venue":null,"work_id":"52ec8646-40d1-466d-b207-01059adb4d34","year":2025},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.293711Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:d52babdf834aabbbdac27966f3df57f33abe942c6d5b016519fe53052e9c7dae","observation_id":"24bd3b49-28dc-4982-8ddb-b0119c15b789","resolution":{"observed_at":"2026-08-16T12:25:19.226911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.211936Z","title":null,"venue":null,"work_id":"48f35fd7-9179-4323-bd17-fe493e65a5a4","year":2022},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.298743Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:8b4bad2db2a9fca1a6bc93a6fad0c5ba2215890e6da139ff6f10b73b51355924","observation_id":"048ef69b-9239-4b80-8ac3-061a57abfcef","resolution":{"observed_at":"2026-08-16T12:25:19.215568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.201130Z","title":null,"venue":null,"work_id":"743cedaa-0b3a-4b7c-a649-b549106bb513","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.302789Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:e3734a67c66930fd704e2c1aebe6a05d4a1edacf122710190c8fdacdca682cad","observation_id":"dae6ac40-d12c-4966-b868-a9daee13a631","resolution":{"observed_at":"2026-08-16T12:25:19.204857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.190809Z","title":null,"venue":null,"work_id":"285f45cc-c69b-44c4-9b4d-71a98eecca4f","year":1994},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.306973Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:20fd946d88b72fe87dd4235c35e48a2fdb6dac0a182b708fa7d87bb369f3c2ab","observation_id":"61ae51ee-83e9-42b6-bb4a-351d18ecf44a","resolution":{"observed_at":"2026-08-16T12:25:19.194272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.180108Z","title":null,"venue":null,"work_id":"4456c7dc-2912-44b9-a39a-83823b1d2690","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.310911Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:ecd8ae2d81925506d3c24bf1a6a9998e6375eb11bb594d4a4b4da10f0f80b7f7","observation_id":"94cf118e-8427-40d7-8ce7-20c933b18313","resolution":{"observed_at":"2026-08-16T12:25:19.183881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.169174Z","title":null,"venue":null,"work_id":"d2a00a20-3095-4885-ac5c-4f01a6e37622","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.314614Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:61b5dfe6082ba6dc1663c3d2ecace97d22ba413a09bbc61ca8caab6b788257a1","observation_id":"75776a92-6280-41f0-a3ee-28295aa63729","resolution":{"observed_at":"2026-08-16T12:25:19.172953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.158132Z","title":null,"venue":null,"work_id":"3f8e6d01-8bad-4c8c-9626-a8ffefe4b0be","year":2017},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.319100Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:32babc2dfcfefdf1d60e39309631018f13dda10e13add6bd5ba7cf53ece0defe","observation_id":"ac42b17f-ab2c-434d-a5af-bd84261bfec1","resolution":{"observed_at":"2026-08-16T12:25:19.161803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01799","last_updated":"2019-04-27T17:00:27Z","snapshot_observed_at":"2026-08-14T19:07:14.367870Z","submitted_at":"2018-06-05T16:41:07Z","title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01799","snapshot_observed_at":"2026-08-16T12:25:18.322783Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.322783Z"},"links":{"cited_paper":"/paper/1806.01799","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:d337b6ecb6ea814156625c7e33103d21883c4a220e3c062ad7a580c98a04b15e","observation_id":"e656ecfd-8a37-40b3-984f-454526713aaa","resolution":{"observed_at":"2026-08-16T12:25:18.322783Z","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-16T12:25:19.146683Z","title":null,"venue":null,"work_id":"4784114b-8ed3-4532-9050-805edf092989","year":2024},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.327038Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:6ee43784574149724587781888337afd9edb0e0029e6ec8dbe860b7dd06652b2","observation_id":"2a980aff-60e5-4210-ab82-a18afb841c88","resolution":{"observed_at":"2026-08-16T12:25:19.150586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.135396Z","title":null,"venue":null,"work_id":"8db5fe97-2984-48f4-8dbf-50ab8bbab1a3","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.330750Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:8a417c8b2d62fc13f6e46ddc1366f22c83a1612d889a65cafe4a3ff199e8852d","observation_id":"69fd6651-a096-4df3-beed-ba992182a599","resolution":{"observed_at":"2026-08-16T12:25:19.138921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.112987Z","title":null,"venue":null,"work_id":"76a950dc-02ef-4335-bf61-3b6755ea9c5f","year":1992},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.338066Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:a482ab95548da1c762fbffca216ee87f86327bc922e368706f1fdc4a0655ed5b","observation_id":"695e1062-2f71-4dbd-8929-ed44e244bef1","resolution":{"observed_at":"2026-08-16T12:25:19.116658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.102655Z","title":null,"venue":null,"work_id":"55b7bf6b-4f5c-46fb-b800-38721f376a09","year":2024},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.341581Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:5dac1628dfbfddaf35919722af3027d17fc255aa0379ffd751a7f2d3e58ef45f","observation_id":"7c2169fc-f2f2-41a3-a56d-b1613cdd8875","resolution":{"observed_at":"2026-08-16T12:25:19.106005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.091754Z","title":null,"venue":null,"work_id":"9f68b3ec-cadd-4a16-a33b-c2ac54f44d29","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.345052Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:fb2f4de7cd989cfe400980a6a2e665723e3812a6b27dfe71b5fbf53f25a0621e","observation_id":"4ffe6b84-83f4-4f44-86af-419214f9725d","resolution":{"observed_at":"2026-08-16T12:25:19.095420Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.348545Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.348545Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:e4ed91ba724b324dda24114ae9280c5dbe300e05b458290b3bac422cfa1a3e6b","observation_id":"744edb7c-8492-493f-aa9a-c826a38d300c","resolution":{"observed_at":"2026-08-16T12:25:18.348545Z","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-16T12:25:19.063599Z","title":null,"venue":null,"work_id":"e395421f-d0cd-4a07-ae7a-3c889bffe730","year":2007},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.355344Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:32cc478b82612db108c79e6482131df488ab355ddd120e1e002ce1c4681cf9ce","observation_id":"1802a135-b57e-4580-9310-d849dce0eda7","resolution":{"observed_at":"2026-08-16T12:25:19.067366Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.052672Z","title":null,"venue":null,"work_id":"c9928cd2-39cb-4402-b9b2-260362f11ea0","year":2001},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.359294Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:346c7d0a945156e5fd5711bd6aa4bb7d555f3a14fc2f868b4a1db407bb05aad1","observation_id":"755086fd-7427-4dda-9817-73bb63201564","resolution":{"observed_at":"2026-08-16T12:25:19.056365Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.041236Z","title":null,"venue":null,"work_id":"22fb48c1-ec50-49c1-9960-8c87d0bb6ae6","year":2006},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.362798Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:446f5925d5cc26adcebefa7ceb5ae74b6b8b0ebddefd0e192ecee93ba248a580","observation_id":"7add460e-8d29-4ea1-b2e1-17f715a8ca6a","resolution":{"observed_at":"2026-08-16T12:25:19.044937Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.366164Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.366164Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:50ea78f07abfe4ccd47213e8dade9136e03cc2333cd8a03ea98d79441a73f6f9","observation_id":"0f3f8da1-e246-4df9-bbd7-fadf09b90d4e","resolution":{"observed_at":"2026-08-16T12:25:18.366164Z","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-16T12:25:19.012047Z","title":null,"venue":null,"work_id":"f5fb950b-5af2-43eb-bce6-8e070baa2a2c","year":2023},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.373271Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:357062031713d132dd4d07d02bbfa68d4184a1f157525ab3c2ff2f50b847ebd7","observation_id":"b240ed26-224b-49b3-a027-7aa6853b882b","resolution":{"observed_at":"2026-08-16T12:25:19.015587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.376624Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.376624Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:49f8b8a054395a12d09203b9d060d65c47edbeab12721be5ef5d47972051b316","observation_id":"0fd9c647-61ec-4465-83bd-bc8689d16ddc","resolution":{"observed_at":"2026-08-16T12:25:18.376624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00495","last_updated":"2022-12-28T11:19:05Z","snapshot_observed_at":"2026-08-19T11:56:02.486990Z","submitted_at":"2022-11-01T14:38:18Z","title":"Efficient Graph Neural Network Inference at Large Scale","version":3},"cited_work":{"arxiv_id":"2211.00495","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.00495","snapshot_observed_at":"2026-08-16T12:25:18.631206Z","title":"Efficient Graph Neural Network Inference at Large Scale","venue":"cs.LG","work_id":"397e514d-dce5-42d4-bf75-07fdb1476eaf","year":2022},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.380212Z"},"links":{"cited_paper":"/paper/2211.00495","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:b8d47fa8911a1c51e24ab7eb221ccf1c35f28c86d4c7dd05d85bf01b82c57d0e","observation_id":"1f2d10af-dba2-4572-9cef-3b823c6f32ba","resolution":{"observed_at":"2026-08-16T12:25:18.635586Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07640","last_updated":"2018-05-31T17:56:14Z","snapshot_observed_at":"2026-08-14T19:34:12.514740Z","submitted_at":"2018-03-20T20:32:07Z","title":"AllenNLP: A Deep Semantic Natural Language Processing Platform","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.07640","snapshot_observed_at":"2026-08-16T12:25:18.383952Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.383952Z"},"links":{"cited_paper":"/paper/1803.07640","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:98a605186bf628d25b64a44ef80f8dff97d0d65863a763b0f8189ffdbbf98040","observation_id":"576c0069-08d2-4077-b59f-d2f402a07ae1","resolution":{"observed_at":"2026-08-16T12:25:18.383952Z","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-16T12:25:18.993001Z","title":null,"venue":null,"work_id":"6b138ca2-3251-47be-9cdb-d12e1d64bf15","year":2023},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.388058Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:db923d7a821e92dc8b95d89c9a5551f3d475ea73a8b96ff75a3fb1dd868ebb9a","observation_id":"30298179-a9ea-45e7-a014-757800d56dfe","resolution":{"observed_at":"2026-08-16T12:25:18.996761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.982832Z","title":null,"venue":null,"work_id":"6d32c6eb-853f-47d3-af84-21d61a0acbfa","year":2017},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.391227Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:3b518b7474e304844f6de87d4ea7ff4274b586c74bbb6bd16c0bd4c60d5d8092","observation_id":"bff8c00d-9e9c-4be1-b13e-9abb5c131ab1","resolution":{"observed_at":"2026-08-16T12:25:18.986309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.972232Z","title":null,"venue":null,"work_id":"60cca113-dd50-494a-ac06-c0d1976ead27","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.394561Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:485f7f86e9a641d5a780ec81828783af37ba58d13ad0ea3d48bf79726b90d345","observation_id":"a73a13f2-a15e-4e9e-b30f-a3c278121614","resolution":{"observed_at":"2026-08-16T12:25:18.975671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-16T14:23:49.046360Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-16T12:25:18.397790Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.397790Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:35a755c2b2707600beadfc8897a1bc5299a4e689d5d536967f05ab8354fd37db","observation_id":"6948c469-55c1-456f-bdc1-a61536843cc1","resolution":{"observed_at":"2026-08-16T12:25:18.397790Z","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-16T12:25:18.961377Z","title":null,"venue":null,"work_id":"585317fe-89e6-458f-b768-a58d864392aa","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.401546Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:11ae56b86b0b4782e2e7e19861f6ca1c7de651a8baca52ea080d481429b30453","observation_id":"6e88fac8-ad40-4eb5-a5e9-cf119d446b12","resolution":{"observed_at":"2026-08-16T12:25:18.965166Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.950462Z","title":null,"venue":null,"work_id":"78fd149e-4a80-4bb0-8ad4-8828c60714de","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.404994Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:de9d3ca400d661f81c2ca0b7bf32864784019af8658f17e458c5e8c10cbf7a1e","observation_id":"47cf5717-6a95-4839-b600-5a0f7833a47f","resolution":{"observed_at":"2026-08-16T12:25:18.954440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.939305Z","title":null,"venue":null,"work_id":"40cd4a1d-2864-4c5d-bb45-e72a89d75c3c","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.408273Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:d5ca64b642ddc64d2ebd8061bf05e6a6248a298b0042bc8b70b481375b990f55","observation_id":"62af7d2a-0265-4596-92e7-5c47bb3526e6","resolution":{"observed_at":"2026-08-16T12:25:18.942894Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.928560Z","title":null,"venue":null,"work_id":"1dffb4bc-d7f9-43ee-b20d-cbfb57b9880b","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.411723Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:6840ef73f1de568234b264022a9547b90010727ebe1529f1613cfb12114ca74d","observation_id":"55454121-532d-4eed-a339-0001db56e95b","resolution":{"observed_at":"2026-08-16T12:25:18.932370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.418773Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.418773Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:073c139b4e9e331aad13cfcfc3b4f33a9baa6c51e31dc35582f4a1a23fbcc6be","observation_id":"9ca3ee99-7715-4102-a93c-5098f607fc04","resolution":{"observed_at":"2026-08-16T12:25:18.418773Z","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-16T12:25:18.906836Z","title":null,"venue":null,"work_id":"1d5f8ffa-f7c9-414a-b4f9-2abcda9583ff","year":2023},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.422439Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:afa682f3378b6eb859f4aa1b61c44d8e0a70d3032c33ef981769ec1fe7a4fd26","observation_id":"1546f915-fbab-4b2f-bd6f-86edc216e7f7","resolution":{"observed_at":"2026-08-16T12:25:18.910542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.895776Z","title":"at. 2000. O","venue":null,"work_id":"63e659aa-5520-4ef7-af9c-3ac4309d9bea","year":2000},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.425759Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:016ff31417050d4c3918584d07337dd1043d35f27214e4e8fb639317850d72d2","observation_id":"a0e024b2-dfe6-4388-a3bc-69e9cfde5e93","resolution":{"observed_at":"2026-08-16T12:25:18.899492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.917815Z","title":null,"venue":null,"work_id":"edc44085-fa98-4330-bd04-55e47c99a27b","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.415505Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:1e497291143e0eb906aa946d56b61fe8929553cb161121f64a580fd29ef0725f","observation_id":"179c647a-8eef-4825-be35-24bfc0fcca8a","resolution":{"observed_at":"2026-08-16T12:25:18.921501Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.04822","last_updated":"2022-04-24T13:49:50Z","snapshot_observed_at":"2026-08-19T11:56:04.067923Z","submitted_at":"2022-02-10T04:01:40Z","title":"Survey on Graph Neural Network Acceleration: An Algorithmic Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.04822","snapshot_observed_at":"2026-08-16T12:25:18.432377Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.432377Z"},"links":{"cited_paper":"/paper/2202.04822","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:12055cde643687f368b2d53aaeda4685d5951f1719b78b7e9b91b19d9b634d4d","observation_id":"3bfa11da-f8c1-49f8-8f5b-73dbbf119edb","resolution":{"observed_at":"2026-08-16T12:25:18.432377Z","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-16T12:25:18.873231Z","title":null,"venue":null,"work_id":"b44c7e56-158c-4c72-8c93-c9937018acef","year":2025},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.436167Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:3f027059ee053ff6decd37a6dae1e25193d55c25df99cba25f3ed9a26117e609","observation_id":"d618aab1-a319-4983-9ab4-f5898fc914ae","resolution":{"observed_at":"2026-08-16T12:25:18.877379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.862366Z","title":null,"venue":null,"work_id":"22132d34-f7c2-4844-83a2-0a89d8e44b8b","year":2023},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.439582Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:afc22138a6cce73042c4008884683ec4ed21b474aa1cae606fe37f8ea9a0e224","observation_id":"061c82ed-d326-4bbd-a542-8275fd525278","resolution":{"observed_at":"2026-08-16T12:25:18.866323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.884557Z","title":null,"venue":null,"work_id":"35f07f65-b324-46fe-bc5d-97b429f46a2c","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.428969Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:74d01e4c09c22770655ed17b27c96bafe8d0ed9d873bd80e006c97b9881bac58","observation_id":"2f017f9b-e7d6-4def-a331-2ab609b2f66f","resolution":{"observed_at":"2026-08-16T12:25:18.888142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.841155Z","title":null,"venue":null,"work_id":"346def42-5d66-40c3-b97f-41a54065c88e","year":2018},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.446644Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:f75231b68c54b28760c031ff19cabdee7585bb88d5fb5901a575f809e756a128","observation_id":"80284b68-1bc4-455e-8dc6-febb572c2cf4","resolution":{"observed_at":"2026-08-16T12:25:18.844570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.450290Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.450290Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:566a8963611afa36c9b43f1f7ffe7af965eacc4e72074a69fcf91296f631f58c","observation_id":"759a8ad7-08fb-492f-b45e-64a6c2e0e15a","resolution":{"observed_at":"2026-08-16T12:25:18.450290Z","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-16T12:25:18.817047Z","title":null,"venue":null,"work_id":"04fc3d5d-fbc3-4744-9376-e1a55a93868f","year":2022},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.457248Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:b5e6d90cbaef69fe8f0e14e3d7a734d037d3d96abde7d941a1259527ad2cd0fb","observation_id":"37457987-8fb6-4d91-aeac-3ebb01c275ec","resolution":{"observed_at":"2026-08-16T12:25:18.820945Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.851729Z","title":null,"venue":null,"work_id":"579189e4-6c37-4629-a95d-4ee4ffb2e921","year":1971},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.443143Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:9bad172e3c28e0b32d8bf1b08a7c99f05acb5e16251a99ae742b90cd95a2b262","observation_id":"b29a296a-13aa-4857-bb23-c5dc64711158","resolution":{"observed_at":"2026-08-16T12:25:18.855224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.467560Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.467560Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:ba74133f4015ca6afc2e52c905e11b14f17eb1b353b381c8bb28a3e6e865d474","observation_id":"7b5b93d1-ff5e-496b-95c3-17a282da64a9","resolution":{"observed_at":"2026-08-16T12:25:18.467560Z","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-16T12:25:18.769493Z","title":null,"venue":null,"work_id":"c738c39c-e705-4e2b-a86c-f8b27e72460d","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.474865Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:8ad207dfe4a0d56e9e14d7e202dc6f32b1f85e281938baf5db0d3c3b8b4117ba","observation_id":"8cef3c0b-9061-4fdf-a9ae-58effecd0e96","resolution":{"observed_at":"2026-08-16T12:25:18.773111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.758272Z","title":null,"venue":null,"work_id":"1ca49388-fd51-48a2-b79c-8c9f23734d2c","year":2008},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.478396Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:e7d053a28b82e5b04a5bd22e1720599b0b623f912867b2efc8e6931f6e8665be","observation_id":"896268d1-a206-4b56-859d-412da04662c1","resolution":{"observed_at":"2026-08-16T12:25:18.761900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.747113Z","title":null,"venue":null,"work_id":"f396ad0e-ff9a-48ea-a1c9-1960ce27029d","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.481782Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:a229f12f697fff111f42f810004e9a68c525735b5f58d11d611fcfbc89bba749","observation_id":"bd735fb1-7cfe-462c-aac7-6d79a374219d","resolution":{"observed_at":"2026-08-16T12:25:18.750917Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.460775Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.460775Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:df219b582822caba4c7a1bda1499468c1b1986e6ca06d275143586822868d45b","observation_id":"3542e56c-fdbc-4839-a1d5-f34c93da8325","resolution":{"observed_at":"2026-08-16T12:25:18.460775Z","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-16T12:25:18.735271Z","title":null,"venue":null,"work_id":"9cfe825b-0ecd-42e1-a352-c3b5ecc2253a","year":2023},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.488852Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:1170b2f493e6334898f95c70a140a80e66d66097fa9c9ea0a84e05d2611794ed","observation_id":"74c19d6f-8bd8-42fb-a0c5-f62ac00bfee1","resolution":{"observed_at":"2026-08-16T12:25:18.739391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.492165Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.492165Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:7c321cfbaaf2fc39c8313a50d4acb6e3b6c0721285a05f20cbb3dec171fdf227","observation_id":"ff0d8009-4c0a-4509-8a9c-d6d36bbce661","resolution":{"observed_at":"2026-08-16T12:25:18.492165Z","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-16T12:25:18.716918Z","title":null,"venue":null,"work_id":"b8c8e7b0-76d2-48a1-aacf-5ea246583118","year":1998},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.495537Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:75860982f3040036cbddced7e647d238c49d6c0d27065cfe311e8e312553ccf8","observation_id":"7c36c3ac-318e-43a4-87c5-d5560b58c0cc","resolution":{"observed_at":"2026-08-16T12:25:18.720644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.705890Z","title":null,"venue":null,"work_id":"033df67e-a9dc-438a-8617-836aa32e62c7","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.499000Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:630ca781d7856cea1a081345aa6a3e17b65406e7d424b1cb5c6753ae25fb60c4","observation_id":"46f76c9d-9dab-48d3-981b-9060a7de4db4","resolution":{"observed_at":"2026-08-16T12:25:18.709551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.502250Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.502250Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:5c5f6efb2c9a419433d1fe558617358ee8394093c9a410aefd9272dff59a7dbe","observation_id":"fb747895-7684-48f8-9cd7-f04a75050eed","resolution":{"observed_at":"2026-08-16T12:25:18.502250Z","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-16T12:25:18.688474Z","title":null,"venue":null,"work_id":"71b89016-128b-4325-a238-c3f1d7fce574","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.505328Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:bb0528e4a21a907e9bbfbd219dec5c714fc606e7bb9721618ce4b2a00ce65696","observation_id":"2b6faf46-93ed-4f02-8f47-49432479c166","resolution":{"observed_at":"2026-08-16T12:25:18.692199Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.05000","last_updated":"2021-03-15T15:27:59Z","snapshot_observed_at":"2026-08-19T22:47:54.115555Z","submitted_at":"2020-08-11T20:53:50Z","title":"Degree-Quant: Quantization-Aware Training for Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.05000","snapshot_observed_at":"2026-08-16T12:25:18.485161Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.485161Z"},"links":{"cited_paper":"/paper/2008.05000","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:b11654b30e472a22edbb1ee76e44380a02b7221f71cd6d382cbae122a0b47597","observation_id":"97818df8-e785-4e30-bba7-3bd2d20cf0a5","resolution":{"observed_at":"2026-08-16T12:25:18.485161Z","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-16T12:25:18.676127Z","title":null,"venue":null,"work_id":"bb50d458-c679-4a5f-bb2a-77bb72e69a87","year":2018},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.512309Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:4f053ce8b5e9df27d1e4d10f7dc7c822ff6cf161aa9d9154eba390a8c5ae0cd7","observation_id":"8319b1bf-0d91-4483-8b12-b4f90bea7ebc","resolution":{"observed_at":"2026-08-16T12:25:18.679881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.664787Z","title":null,"venue":null,"work_id":"6402ed84-ad04-4312-8569-d4748f543eb9","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.515726Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:f325195e011562155338dbdcbf872f524ce030c68f5bcdd2e9eac6ecc8c6a9c3","observation_id":"c30b4e38-1c5d-467b-a8fa-88b6358a4596","resolution":{"observed_at":"2026-08-16T12:25:18.668181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.654098Z","title":null,"venue":null,"work_id":"f1022684-f7d7-467b-ba11-ab4d8be97e95","year":2024},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.519125Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:a2cd143bf0411553dce4621b0b2bc3f10eed0f80c2d552e7c8e0614482d28263","observation_id":"7c9d2df0-b27a-4d54-849a-f416a882b795","resolution":{"observed_at":"2026-08-16T12:25:18.657808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.04528","last_updated":"2021-05-10T17:28:44Z","snapshot_observed_at":"2026-08-19T11:56:01.915763Z","submitted_at":"2021-05-10T17:28:44Z","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","version":1},"cited_work":{"arxiv_id":"2105.04528","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.04528","snapshot_observed_at":"2026-08-16T12:25:18.554730Z","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","venue":"cs.LG","work_id":"c187e314-e740-428b-ab16-bc96f6239bd6","year":2021},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.522216Z"},"links":{"cited_paper":"/paper/2105.04528","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:06a164c037e191a4be03e891a0f747504834c0ef9ab0747921dc0a5c22d2f275","observation_id":"1e62c311-7437-4bef-9976-ec617c2a1987","resolution":{"observed_at":"2026-08-16T12:25:18.560588Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.508749Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.508749Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:08cee82fdfe4a0fc7bf315b571d03c75eb0967e5a1e13748c5b4d069c4f1db8e","observation_id":"9351fc88-cc10-45eb-bb4a-cfce5ac68941","resolution":{"observed_at":"2026-08-16T12:25:18.508749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:25:18.453797Z","title":"Information Retrieval (2000)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.453797Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:5624bded07c633f89af67f5002397aca6011e85c2002df18b7cb651c141f95ec","observation_id":"d8f6e6ac-8d98-40b2-b9fc-32ec3c8deac0","resolution":{"observed_at":"2026-08-16T12:25:18.453797Z","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-16T12:25:19.023014Z","title":null,"venue":null,"work_id":"8c8fc948-9dbe-49fd-894f-71de1fceea25","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.369577Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:41abb66b97519d075d9b19713ba2f6ee9cc1d0a8b5820bb02947db9f1f8b1632","observation_id":"067daff4-fcc2-4d59-b650-9b5cb65bd633","resolution":{"observed_at":"2026-08-16T12:25:19.026861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.800119Z","title":"Information Sciences (2020)","venue":null,"work_id":"609bc63c-d80e-43bd-b195-3bed021541ca","year":2020},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.464180Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:1ae571ae9f8b74c848654ea3a93ccfe25104750c575039de855b9498f95a1f9f","observation_id":"f3ed74d1-9e44-4137-a16c-a08c63a6607d","resolution":{"observed_at":"2026-08-16T12:25:18.803738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.074398Z","title":null,"venue":null,"work_id":"05c36c48-dcb4-40fc-af6a-8c8ea8d92050","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.351881Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:c0c8197841b8f1919275f13bad67f0e72dc76e74bdae541ee71f75bc1d8c81d8","observation_id":"2fa1c7c4-0ca1-40bb-baab-4e8e20dcafac","resolution":{"observed_at":"2026-08-16T12:25:19.077814Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:18.780764Z","title":"Communica- tions Materials (2022)","venue":null,"work_id":"ff3cb092-de89-4537-a349-5530c150cee2","year":2022},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.471241Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:425ac40940eb4a68fa00243fa4153d4dc78d3dfa9473e299ef4fc1d821b25dd6","observation_id":"d3a80628-4edf-4a37-820c-6468d2da4ac3","resolution":{"observed_at":"2026-08-16T12:25:18.784961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:25:19.124315Z","title":"In Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","venue":null,"work_id":"a2892ec1-bd49-4d55-abe1-35b9db5cd3e5","year":null},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.334553Z"},"links":{"citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:8eafd97155fe01f2130ad5a0ed2cb60fc2b24768e74446581b2637a33bb729a4","observation_id":"134c957d-6e5d-4969-8a97-1cc3032eddcf","resolution":{"observed_at":"2026-08-16T12:25:19.128246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T11:55:15.020528Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":58,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":65},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2504.13034."}