{"as_of":"2026-08-16T00:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91601fed94066a18695af1008405cd77d2ac2663b85b0ad9f224d8722322fdad","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:56:26.078293Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2501.06872/citation-record","integrity":"/paper/2501.06872/integrity","json":"/paper/2501.06872/citation-record.json","paper":"/paper/2501.06872"},"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-10T20:56:26.731285Z","title":"Ultra-large-scale repository analysis via graph compression,","venue":null,"work_id":"ba2720f2-fe31-4052-a487-bcc9135c96dc","year":2020},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.870895Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:412d464dc293eb507f5c24a0f4c44ab92af14e7916644f1fb64b784cd3bf5658","observation_id":"156a51d5-02fe-4a05-acd7-cbcae24c3613","resolution":{"observed_at":"2026-08-10T20:56:26.735281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.716860Z","title":"On overcoming HPC challenges of trillion-scale real-world graph datasets,","venue":null,"work_id":"cf101900-cbb4-4456-8eaa-26c66a6235a1","year":2023},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.875655Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:75ab10a69d59ef033bffc1e19d9168e57a28fa3a83a3c1be29fee420924946ed","observation_id":"c4dc5515-d720-4787-8455-b39e53aac7dd","resolution":{"observed_at":"2026-08-10T20:56:26.720888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.705130Z","title":"BUbiNG: Massive crawling for the masses,","venue":null,"work_id":"7dfc901e-81a4-4982-b037-0e0de834c760","year":2018},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.879813Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:5b3baf2d42b001857a317856baeafc5480d3622d70b03364ca1094d332d47c42","observation_id":"2d90a801-577a-43c5-990a-9c5594c1027e","resolution":{"observed_at":"2026-08-10T20:56:26.709109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.693789Z","title":"The software heritage graph dataset: Public software development under one roof,","venue":null,"work_id":"af2ecd8b-abab-4cb9-b61f-e50d5bc4d4f9","year":2019},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.884167Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:dfca3b01568e9204d441eaf61e0210ca5bd28322709a34ed8563db2af3970895","observation_id":"20cdadc6-0a9e-4e30-bbcf-39611c6bab69","resolution":{"observed_at":"2026-08-10T20:56:26.697734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.680634Z","title":"The graph structure in the web – analyzed on different aggregation levels,","venue":null,"work_id":"1ab07447-3a0e-49fe-9275-c418a3c71a71","year":2015},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.888298Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:40ca050989297f19027b2cf0dc94b244f51f3783a953c8242877d688a399a254","observation_id":"5c749899-19f7-469f-9140-0b3210d63375","resolution":{"observed_at":"2026-08-10T20:56:26.684979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.668702Z","title":"Parallel transposition of sparse data structures,","venue":null,"work_id":"126fd2d1-7a1e-4b9a-86b9-d466bd680745","year":2016},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.892712Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:23c68c774b625f53914c46f11bafedab2e71e308becb3df0a31f6fb1f0980caf","observation_id":"5c49ebf9-db4f-482e-ba3e-8e557240e051","resolution":{"observed_at":"2026-08-10T20:56:26.672721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.656350Z","title":null,"venue":null,"work_id":"975b1b9f-0b44-4271-ab9f-ae54bfa0b451","year":1987},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.897528Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:9ce5bebad1d169b84449c44bf13fb04f15179549158964abd6d27e7115ae6dc7","observation_id":"15ccb728-de7b-4653-a008-9bcf8b282501","resolution":{"observed_at":"2026-08-10T20:56:26.660232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.644330Z","title":"Sparskit: a basic tool kit for sparse matrix computations - version 2,","venue":null,"work_id":"c5105fe1-461b-4440-9d82-555314f9f23f","year":1994},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.902608Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:b82e8ed3eaea57aee7f4676eeced1227a2f09f02adef674094edaafb89c822eb","observation_id":"2a6eb444-e092-4fd8-a27f-077166e852c8","resolution":{"observed_at":"2026-08-10T20:56:26.648206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.634067Z","title":"Scrambled linear pseudorandom number generators,","venue":null,"work_id":"7a7f4123-002a-476e-88de-b25c07b52b42","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.907346Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:d501ef0229b1d35b7b8da35e4a2844a0346fd3f5f6fa907f9a534b4de30ed5bd","observation_id":"bd5d92cf-d553-4287-82f9-742dae8c9746","resolution":{"observed_at":"2026-08-10T20:56:26.637779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.622112Z","title":"Layered Label Propaga- tion: A multiresolution coordinate-free ordering for compressing social networks,","venue":null,"work_id":"93a47186-1f80-491c-85b9-3ee98b430efa","year":2011},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.911864Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:ddbdef3b439d64a2f26172ce0ba1c589a423dac78f8c41e75a060a848644c577","observation_id":"a50165d8-66f3-4eb3-ba56-806707bd5783","resolution":{"observed_at":"2026-08-10T20:56:26.626370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.609210Z","title":"Rabbit Order: Just-in-time parallel reordering for fast graph analysis,","venue":null,"work_id":"d1661c35-251f-44b4-9a9e-7b9040977bfa","year":2016},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.916811Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:5123340a23b86d2ec24186b3ab57d744331414dfb624da6b652eddbd9449a2e2","observation_id":"f3fcbbf9-cb22-4004-9a21-d38d1d1a827e","resolution":{"observed_at":"2026-08-10T20:56:26.613507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.596942Z","title":"Locality analysis of graph reordering algorithms,","venue":null,"work_id":"5140005f-cbdb-459e-a3cb-881a61d53536","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.921292Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:a15a752d474efc0d7885e27f0ceea387c4f6790dd189575a55347c01c878bca9","observation_id":"fb6bd2c3-587c-4843-bad9-2408b00e666d","resolution":{"observed_at":"2026-08-10T20:56:26.601400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.585127Z","title":"The WebGraph framework I: Compression techniques,","venue":null,"work_id":"6c6086c7-9322-4a5c-b554-6ac61a20f8d3","year":2004},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.925630Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:989e7954a06880f4cedade3e2b45d2b61598e11514e82def0ef2b970296215db","observation_id":"0936c43a-ee9e-444a-bf4e-f2b5c177c5b4","resolution":{"observed_at":"2026-08-10T20:56:26.589005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.573846Z","title":"Acceleration of pagerank with customized precision based on mantissa segmentation,","venue":null,"work_id":"dd337f63-88b7-498f-92e4-b6aeb0354c8d","year":2020},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.930446Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:7547f4112bfb28545096f06562b5e57353b95bf8ea0bfc29dc0a42f0e1172d48","observation_id":"ee29eded-441d-4d2c-81cb-2fbada338bc0","resolution":{"observed_at":"2026-08-10T20:56:26.578058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.559626Z","title":"Software-de fi ned fl oating-point number formats and their application to graph processing,","venue":null,"work_id":"46e24944-4656-4cad-be4b-456ffec987e7","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.933914Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:67b7746472c941994ee0e27ac302041a7db435a2c1c4ff04fa6e1db346c7ce4a","observation_id":"c80196c0-5076-4b8a-b2df-276c06d697b5","resolution":{"observed_at":"2026-08-10T20:56:26.565842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.546965Z","title":"SAPCo Sort: Optimizing degree-ordering for power-law graphs,","venue":null,"work_id":"f1bc0f16-647a-4f85-bf41-0ca92a03c572","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.937581Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:3dffb21f57d97459b0e3b1ac5b88faad14ac0f185ff1a65bcd54c80a1df6d1c8","observation_id":"4ae36267-6807-4294-b37f-283224b7b858","resolution":{"observed_at":"2026-08-10T20:56:26.551750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.532960Z","title":"UbiCrawler: A scalable fully distributed web crawler,","venue":null,"work_id":"c07d92cb-68a0-460d-8f8f-73367036a873","year":2004},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.941247Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:eead3e61c3548ab0d1b61f397dfd6f8d17fc564bb91b4292ce7718c9f4a4c205","observation_id":"6db49f9c-5ab8-4244-8a1b-b697e90414da","resolution":{"observed_at":"2026-08-10T20:56:26.537032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.520556Z","title":"Graph structure in the web: Aggregated by pay-level domain,","venue":null,"work_id":"70e6c5bc-76e3-481f-bb48-bfa4f44bb003","year":2014},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.944900Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:68ae4b4877af13f23584d26377cd8e2a20c5797d26657c4b8258f0ec3f13d779","observation_id":"56f01b39-2be1-4825-8767-feed996da11a","resolution":{"observed_at":"2026-08-10T20:56:26.524671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.507392Z","title":"Graph structure in the web — revisited: A trick of the heavy tail,","venue":null,"work_id":"ed7ffd31-7b81-4f2d-b805-21424b546efc","year":2014},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.948439Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:07c60f40b7fe6ac4d104573452d8bbc25d06b31fc4dbfed360a9f6264612ed6d","observation_id":"e7b7ba82-49c8-40aa-a353-602a943e4fc4","resolution":{"observed_at":"2026-08-10T20:56:26.511849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.495604Z","title":"Friendster: The online gaming social network,","venue":null,"work_id":"f03fdb3e-8ee9-48cd-bbaf-9dd1cce5e26c","year":2011},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.951860Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:cbb9802408efaee7d9026fafce61288c37a1ed24e6fedf038500c7a6ea48c5fb","observation_id":"e34cdd46-77ef-4250-8715-8bf14a0926f4","resolution":{"observed_at":"2026-08-10T20:56:26.499529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.483668Z","title":"What is twitter, a social network or a news media?","venue":null,"work_id":"71e44a49-9f65-45c4-9267-8e323fde89ce","year":null},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.955276Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:08a3e418952d1a74316e3aacb6b49a625e803caf346013bf692450cb0c9d4ba6","observation_id":"f46b9733-1d28-4cfe-837f-15d329555102","resolution":{"observed_at":"2026-08-10T20:56:26.487774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:25.959631Z","title":"Introducing the graph 500,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.959631Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:753ea71c3456fdee1e6886529a9d088119f4b0ceab0fea3cbe15c59c375255ad","observation_id":"a183487a-ba0d-4355-b677-f2a8e229c83d","resolution":{"observed_at":"2026-08-10T20:56:25.959631Z","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-10T20:56:26.465505Z","title":"Smooth kronecker: Solving the combing problem in kronecker graphs,","venue":null,"work_id":"82557bab-182b-4530-9884-dca783965abe","year":2020},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.964220Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:f6008d2631dc2d5c8cece37a4f25789feeb415a62ed428cd9a634ba0cab59263","observation_id":"40650489-23e2-4b9e-a2f4-69b1d6660ab9","resolution":{"observed_at":"2026-08-10T20:56:26.469401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.16744","last_updated":"2023-08-31T14:04:28Z","snapshot_observed_at":"2026-08-15T09:42:24.905696Z","submitted_at":"2023-08-31T14:04:28Z","title":"MS-BioGraphs: Sequence Similarity Graph Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.16744","snapshot_observed_at":"2026-08-10T20:56:25.967922Z","title":"MS-BioGraphs: Sequence similarity graph datasets,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.967922Z"},"links":{"cited_paper":"/paper/2308.16744","citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:0a543131b105265f2a25eeaf87168fed604b8788f4a32fdc5322e35a0f811d5d","observation_id":"cee6fb27-1bcb-4f5a-b03d-cd0372ac24a5","resolution":{"observed_at":"2026-08-10T20:56:25.967922Z","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-10T20:56:26.454407Z","title":"Dataset announcement: MS-BioGraphs, trillion-scale public real- world sequence similarity graphs,","venue":null,"work_id":"9525dd22-179c-41f3-89bb-1f6e428e0138","year":2023},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.972056Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:292117768cbe8851c34a4caeea117f6b7ead60933183325547db0d51ad8862e4","observation_id":"5ee51df7-2c07-4cd8-a5cd-d6402157f3cd","resolution":{"observed_at":"2026-08-10T20:56:26.458398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.443766Z","title":"On designing structure-aware high-performance graph algorithms,","venue":null,"work_id":"cfda4fbb-90b8-4544-91cf-0c5fce48aaa7","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.975726Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:71919f632302b62bef3e59d1261c999b67923d9d027cc9b044b02e32ec433d7d","observation_id":"325dc370-1275-4c0a-b622-cf93bc2d35a0","resolution":{"observed_at":"2026-08-10T20:56:26.447601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.432871Z","title":"Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher,","venue":null,"work_id":"42a39ebf-9036-44e0-aeb7-6121a9812832","year":2024},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.979234Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:7b6d3bc3077026c8a02e86d3d07f8212711ae6b1fe592a32b5755adf7cbb0cb7","observation_id":"a7cbe3e3-476f-49d0-9f3b-318bb315a321","resolution":{"observed_at":"2026-08-10T20:56:26.436709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.421261Z","title":"OpenMP: an industry standard api for shared- memory programming,","venue":null,"work_id":"714751d7-be9b-4da3-a13e-079a7b74b094","year":1998},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.983084Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:92b8302380be1cb69ad365a6778e150f9a872dafa54495adbb20ccb32f205f86","observation_id":"44b95d16-1884-4ef4-b523-72d6bba8f2ae","resolution":{"observed_at":"2026-08-10T20:56:26.425415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.408963Z","title":"Mining top- k frequent itemsets through progressive sampling,","venue":null,"work_id":"e6374c8b-82f0-442f-9891-a3ccad5510bd","year":2010},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.986932Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:308e9d47623a1cbcfb9a3f5c49313e04e12b80cc85fd8cba02939f8c09790d0d","observation_id":"9a3fff59-6769-4bf4-a103-7a0b82c44739","resolution":{"observed_at":"2026-08-10T20:56:26.412886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.396913Z","title":"Two fast algorithms for sparse matrices: Multiplication and permuted transposition,","venue":null,"work_id":"8a57d556-1796-45d7-be04-320cee6636de","year":1978},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.990679Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:495a69799430ce0445dc8be45631377e89e07c1d7d4fc165c6778744f59c6c6a","observation_id":"37b61e1b-9c7e-434e-9b1e-5694340dff2d","resolution":{"observed_at":"2026-08-10T20:56:26.401000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.385676Z","title":"Parallelizing the sparse matrix transposition: Reducing the programmer effort using transactional memory,","venue":null,"work_id":"aa0fbf04-80c7-4cb5-98d6-1e69f96c3cde","year":2013},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.994444Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:045ee432423a67e870e15c0a560a3f9e6631b9fcea0e6b4728eae7307035e0b0","observation_id":"ba3364a0-ecab-42b9-b608-9cf0f16f1b82","resolution":{"observed_at":"2026-08-10T20:56:26.389679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.374236Z","title":"Ef fi cient out-of-core and out- of-place rectangular matrix transposition and rotation,","venue":null,"work_id":"6521e09a-0fb4-4a6d-9e50-034623add435","year":1942},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:25.998350Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:e06b651db2f14be21360b3ce5a36fa0d01c236c62b6e45ae442a6c4392ff6d81","observation_id":"e9871ab3-6641-444d-b470-ead7f100316e","resolution":{"observed_at":"2026-08-10T20:56:26.378663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.363961Z","title":"Ef fi cient parallel out-of-core matrix transposition,","venue":null,"work_id":"e067be0f-1bc6-420d-9820-bade7ee2cb51","year":2004},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.002163Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:54dff0e74cb393df71ad3a2ff09951fb913d5b5e2b8177a25b1b7d88d9ddf98f","observation_id":"12331361-aa63-4982-9b48-d946b2ae6ded","resolution":{"observed_at":"2026-08-10T20:56:26.367685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.352918Z","title":"Parallel and cache- effi cient in-place matrix storage format conversion,","venue":null,"work_id":"c34da5c8-b9e1-4b5e-85cc-cd055056e801","year":2012},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.005928Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:49f8fe002846cc55be299e0a0b1e098ec1faaa440477c71d011b2e1917632853","observation_id":"2f42ac20-94f7-491b-87a0-bd1cb209c8ac","resolution":{"observed_at":"2026-08-10T20:56:26.356988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.341742Z","title":"Scalescan: Scalable density-based graph clustering,","venue":null,"work_id":"384968ab-fb49-4769-ba3d-81f6e9425666","year":2018},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.010177Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:7363c831da3666e91d860026fd81acbbc725a8d5986371f1698170eda6700207","observation_id":"48fd154b-a246-429e-b6a4-b7b9a26c3f14","resolution":{"observed_at":"2026-08-10T20:56:26.345704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.330591Z","title":"How do graph relabeling algorithms improve memory locality?","venue":null,"work_id":"aa581996-b412-4cf8-bd8c-73f96381ee76","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.014519Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:f225477f098ebf0ae6b366817f675840a5be449c6dec061c9cff1abfc566393d","observation_id":"cdb436f0-d703-4d6d-aa2d-df011ace02f4","resolution":{"observed_at":"2026-08-10T20:56:26.334590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.316794Z","title":"PowerLyra: Differentiated graph computation and partitioning on skewed graphs,","venue":null,"work_id":"9ba05eeb-09be-490f-8a42-d016fc0f46d0","year":2015},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.018154Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:e5a596cc43763332ebf21bc8450ade33264daa2c22d075d6f605624c33a7b867","observation_id":"efe55b72-3bf0-4710-8e6a-cfef8be8467f","resolution":{"observed_at":"2026-08-10T20:56:26.320965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.303034Z","title":"Thrifty Label Propagation: Fast connected components for skewed-degree graphs,","venue":null,"work_id":"1c0e7e33-f2ce-4c10-893f-06d60c734faf","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.021859Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:cf50fe6bdd6719e9da56b7f4b32551781f916e110276ba61caa923e5176c66af","observation_id":"d8fece39-e07b-4272-b80f-92c560eb3d93","resolution":{"observed_at":"2026-08-10T20:56:26.307978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.291132Z","title":"MASTIFF: Structure-aware minimum spanning tree/forest,","venue":null,"work_id":"36b19d61-04b7-4264-a437-3559bd513ad5","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.025631Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:741aa4d89a12f445299a6bd649f193f28b247d53478babbed1ff12a38d92febf","observation_id":"600a7c4b-d4d0-4bc9-b38d-6501ba93fab9","resolution":{"observed_at":"2026-08-10T20:56:26.295381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.279771Z","title":"LOTUS: Locality optimizing triangle counting,","venue":null,"work_id":"5526e844-7376-47f0-9f49-2d6277d754f0","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.029260Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:84ccb308c1c31d692e03ebedc3728a2168ee7d142d5166c95103d03b8f3562fe","observation_id":"31e37799-4c85-4828-a82d-0032bbd757fc","resolution":{"observed_at":"2026-08-10T20:56:26.283684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.267386Z","title":"Exploiting in-hub temporal locality in SpMV-based graph pro- cessing,","venue":null,"work_id":"9a4a8198-af30-4da6-8639-64f9d16ac43e","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.032860Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:1d6e4f2081d8fe4700f2bb375abfdaf5a6cacba9f81a42169c51d170ea6368cb","observation_id":"f2d532b6-837c-49eb-80aa-bad79a793c18","resolution":{"observed_at":"2026-08-10T20:56:26.272018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.255494Z","title":"Navigating the maze of graph analytics frameworks using massive graph datasets,","venue":null,"work_id":"52eeedd5-56fc-4ff5-babe-f23fef1cc23f","year":2014},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.036869Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:46cd606a7b0d9777a99ce83cab5fe77fb099c770fa0410b7f8cbf29128c26736","observation_id":"755cf207-96f0-4738-a38d-3012a8272cf8","resolution":{"observed_at":"2026-08-10T20:56:26.259403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06576","last_updated":"2018-06-18T09:55:45Z","snapshot_observed_at":"2026-08-15T21:07:45.199008Z","submitted_at":"2018-06-18T09:55:45Z","title":"VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing","version":1},"cited_work":{"arxiv_id":"1806.06576","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.06576","snapshot_observed_at":"2026-08-10T20:56:26.130701Z","title":"VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing","venue":"cs.DC","work_id":"e843760e-9048-4028-89fe-9d0475b55f13","year":2018},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.042550Z"},"links":{"cited_paper":"/paper/1806.06576","citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:8f416f01b354afa15e10a6b07d3c99aa833fcb5f84cc6eed13be8cd9416e70c2","observation_id":"730a5336-6751-43ad-b932-1c0211a3c726","resolution":{"observed_at":"2026-08-10T20:56:26.137508Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.243485Z","title":"SDS-Sort: Scalable dynamic skew- aware parallel sorting,","venue":null,"work_id":"12b616cc-bf26-4391-8ef7-37d03f242a06","year":2016},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.047265Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:c0744564c500cc3e7837dd1306ca6fb64fd6b77959e2506ff6abade829b5779c","observation_id":"250bc25c-ee63-41b1-9d80-6c1dcea8d908","resolution":{"observed_at":"2026-08-10T20:56:26.247827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.231923Z","title":"Engineering a cache- oblivious sorting algorithm,","venue":null,"work_id":"c170ac18-a89b-4d09-87bc-91f56112ae26","year":2008},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.050993Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:33a976dd3431280a933fa8e6f5e1ca292165f54743bbad8395ddc95ecc6430ea","observation_id":"2accbbd2-fcb7-4eb5-b8de-e3f77d168fb8","resolution":{"observed_at":"2026-08-10T20:56:26.236061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.218812Z","title":"An exper- imental comparison of cache-oblivious and cache-conscious programs,","venue":null,"work_id":"db2ca89d-9177-4a94-9934-3e5519633d67","year":2007},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.055500Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:9c1889460a7d5a9589e593fcc8b4aa15028c52205c4793b0eea515d0bcf71d85","observation_id":"2c05a52c-28d1-44bb-841d-fa46c48f4423","resolution":{"observed_at":"2026-08-10T20:56:26.223524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.205291Z","title":"Numa-aware graph-structured ana- lytics,","venue":null,"work_id":"a99e3c2e-f487-41e6-abe0-8df1bb5b8725","year":2015},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.059242Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:e6de944af32e35b8ccb28221563a486d25681fddc55b59f5324f28e13582be84","observation_id":"689cc36a-0b63-43ae-8c3b-e22fcc245102","resolution":{"observed_at":"2026-08-10T20:56:26.209111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.192701Z","title":"Graphgrind: Addressing load imbalance of graph partitioning,","venue":null,"work_id":"355007fb-ed40-4b61-b069-5dc423da40cd","year":2017},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.062816Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:526205dc51a357accb499f620b426df048f69b0dd76b28de90a76a1a303df2ab","observation_id":"ee141e25-9301-427b-b7d3-2d4c04a2aedd","resolution":{"observed_at":"2026-08-10T20:56:26.196883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.181160Z","title":"Energy-ef fi cient cache-aware scheduling on heterogeneous multicore systems,","venue":null,"work_id":"53fdc704-6409-4c05-9345-3db8ddc70f1d","year":2022},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.066676Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:7550329b508f15e1988b48805df362c6a9e9381c0e2d1991ba24bc6ef0955059","observation_id":"b13d4f50-2c4e-442f-aafa-a6e1b0b3a94c","resolution":{"observed_at":"2026-08-10T20:56:26.185052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.169616Z","title":"Architecture-aware precision tuning with multiple number representa- tion systems,","venue":null,"work_id":"c6e12165-9ad0-48c5-9296-f144c3650602","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.070513Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:2dab4806230766a4aea835b61381ef7004a4bfe7e638c961acaa87e9a3a9e7da","observation_id":"722f5035-b9f0-4b9c-a456-d89b2972f8a8","resolution":{"observed_at":"2026-08-10T20:56:26.173785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.157569Z","title":"A gpu architecture aware fi ne-grain pruning tech- nique for deep neural networks,","venue":null,"work_id":"4432be10-0f70-4a4f-84a0-e1c1bc50af09","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.074138Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:bd2bd0b1c049413c955241ea8337274ce90eaaeb5c49bb36e1a292671d53975c","observation_id":"9b251136-a600-4c59-9ddd-f5d9b1445793","resolution":{"observed_at":"2026-08-10T20:56:26.161577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T20:56:26.146073Z","title":"Deact: Architecture-aware virtual memory support for fabric attached memory systems,","venue":null,"work_id":"ce8ad4b8-b459-49b1-a899-b9042ff0dc2b","year":2021},"citing_paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T20:56:26.078293Z"},"links":{"citing_paper":"/paper/2501.06872"},"observation_digest":"sha256:f428433171d71f6abe392db4df5be36fac0c53b8c56787b4d3b38f18a1ffc204","observation_id":"044a77e2-c662-4213-baa6-86ffd7e6cdcf","resolution":{"observed_at":"2026-08-10T20:56:26.150135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.06872","last_updated":"2025-01-12T17:01:40Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-13T22:08:04.632518Z","submitted_at":"2025-01-12T17:01:40Z","title":"On Optimizing Locality of Graph Transposition on Modern Architectures"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":52},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2501.06872."}