{"as_of":"2026-08-15T12:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ba59ada5a047784ce7451cab81d9dda06223b5fc89d2cf06bccb0f89f1e61f9","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:13:14.972133Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"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/2507.00716/citation-record","integrity":"/paper/2507.00716/integrity","json":"/paper/2507.00716/citation-record.json","paper":"/paper/2507.00716"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:13.648786Z","title":"Selective parallel loading of large-scale compressed graphs with ParaGrapher,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.648786Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:ef9ebd03650a3f7d22e7ec5f7efbb2b17e5c45978d2cc2050e08e3bf8470e482","observation_id":"0db785a8-7f22-44e5-8486-4c5b5f8c0624","resolution":{"observed_at":"2026-08-06T21:13:13.648786Z","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-06T21:13:15.922927Z","title":"PIGO: A parallel graph input/output library,","venue":null,"work_id":"aa392275-4b57-42d7-88c5-022323261a49","year":2021},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.680532Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:fb1e90dac3742a043e2c2c3ed94e6fbc0a762b7b5424cddd8ad667c92989763a","observation_id":"732a624d-0efc-4817-9b10-ff38f6c979f3","resolution":{"observed_at":"2026-08-06T21:13:15.926730Z","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-06T21:13:15.910319Z","title":"GVEL: Fast graph loading in edgelist and compressed sparse row (csr) formats,","venue":null,"work_id":"241d9477-0407-43ac-a585-30f0e1658846","year":2023},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.715951Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:1ad25bebf62674f6e3d361001a73706fe2260c9eb88a06361834d90a0e07bebc","observation_id":"7de89469-469c-431c-a2e5-c432da738c54","resolution":{"observed_at":"2026-08-06T21:13:15.914991Z","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-06T21:13:15.898557Z","title":"R-mat: A recursive model for graph mining","venue":null,"work_id":"dd653982-05a2-4224-b9a4-8944f5385749","year":2004},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.751294Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:bbda774202c2b3b7b661d3baa38324ef9cb20df4c3b5da7c2dba5f4c5a73b514","observation_id":"d9d2a85c-7ee9-436c-acc9-5f3a16406136","resolution":{"observed_at":"2026-08-06T21:13:15.903127Z","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-06T21:13:15.886687Z","title":"Gtgraph: A synthetic graph generator suite,","venue":null,"work_id":"772740e3-57aa-4fac-8a04-86eeee64febc","year":2006},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.787965Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:950a5f2a7f29c3b7077322b5b72520c9f8ba11940fff9de2b63bfed7af009ed1","observation_id":"470d4b8f-19e4-4bee-bdff-185b557d0c4b","resolution":{"observed_at":"2026-08-06T21:13:15.890818Z","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-06T21:13:15.874311Z","title":"Trilliong: A trillion-scale syn- thetic graph generator using a recursive vector model,","venue":null,"work_id":"f4c6e8dd-f0ac-41d5-a085-f353cc97a353","year":2017},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.824965Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:209655b609a04e4bfa4bbc27b74fbd8e6c166c2b777a41aecd33923301aa3b24","observation_id":"ba615fd7-6ce5-4b5f-a644-5ebf2265dd4b","resolution":{"observed_at":"2026-08-06T21:13:15.878760Z","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-06T21:13:15.861358Z","title":"Smooth kronecker: Solving the combing problem in kronecker graphs,","venue":null,"work_id":"3f29db32-0992-4145-b390-ba9c5b7171ba","year":2020},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.862164Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:92f31755a86a1e654263c34b06c84e580745fa461fe22a5d7c95937c36a8cd01","observation_id":"23b640cd-2589-4095-8c72-3f592f1ed73b","resolution":{"observed_at":"2026-08-06T21:13:15.866368Z","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-06T21:13:15.848287Z","title":"The webgraph framework i: Compression techniques,","venue":null,"work_id":"dc58f755-5af9-4563-8875-b50b1e6c05e4","year":2004},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.898361Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:3433b28bfb835e6368167f0dd328ff8f1168402d9fc0de23ce31e87d291324c9","observation_id":"5af45957-f9d9-4554-ba94-9c130e17c939","resolution":{"observed_at":"2026-08-06T21:13:15.852809Z","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-06T21:13:15.834231Z","title":"Sparskit: a basic tool kit for sparse matrix computations - version 2,","venue":null,"work_id":"514a2f7f-a0f5-4137-a486-3cae68682da5","year":1994},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.934828Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:3f8b8793687e772fa8b7eacbcebfe85591f87f2de1fcb8e066645f212a7a73ae","observation_id":"5a8be76a-539f-478c-83f4-3ebfc1c5bb8e","resolution":{"observed_at":"2026-08-06T21:13:15.838910Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-06T21:13:15.821368Z","title":"Ubi- crawler: A scalable fully distributed web crawler,","venue":null,"work_id":"7a6bd3a2-3682-46b6-97f3-30bcce147c65","year":2004},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:13.970519Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:bdeabb5f70b080c38b01fd041f2dae5a010ea696c127d3fd2fdb63cb3e4fdcbd","observation_id":"eb002e5f-3869-4cf6-89fc-f59a970a15a6","resolution":{"observed_at":"2026-08-06T21:13:15.825530Z","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-06T21:13:15.808332Z","title":"Bubing: Massive crawling for the masses,","venue":null,"work_id":"b466260c-925d-4f47-a4ac-448d28e11726","year":2018},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.007359Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:fa9ef56f48392fd08fc6d2c5dbfb8f2691ef46a2d3d24bc0f65a9da8ca76e686","observation_id":"393f2824-2834-4cb8-b262-5edd0b7041d1","resolution":{"observed_at":"2026-08-06T21:13:15.813031Z","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-06T21:13:15.794687Z","title":"Ultra- large-scale repository analysis via graph compression,","venue":null,"work_id":"397affc4-3508-416a-a7ad-da3314118b37","year":2020},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.033969Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:cdd000b1459820c704049ac93c977212a36e204d67528769f0ca4b69c4b3b896","observation_id":"18f7520e-6a8e-44d6-87ec-31bac9e65119","resolution":{"observed_at":"2026-08-06T21:13:15.799066Z","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-06T21:13:15.780497Z","title":"The software heritage graph dataset: Public software development un- der one roof,","venue":null,"work_id":"f0798301-5d73-43b3-8598-05ca37a25746","year":2019},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.071642Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:02a95ae1ba6c72859dcc4109fb487df17e26e4c827d72c6971b73e434fd634a1","observation_id":"229d4058-9d8a-45f3-95ef-3ffcb5320b9b","resolution":{"observed_at":"2026-08-06T21:13:15.785603Z","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":"2308.16744","doi":"10.48550/arxiv.2308.16744","metadata_source":"pith","pith_arxiv_id":"2308.16744","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"MS-BioGraphs: Sequence Similarity Graph Datasets","venue":"cs.DC","work_id":"10e4d801-4b9a-436c-9466-d98705d54d19","year":2023},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.108659Z"},"links":{"cited_paper":"/paper/2308.16744","citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:41343de3b05445d20e7f91b7b2253b89ea2549aa7848e3370dec8d5204a114cc","observation_id":"84ae6079-06be-4288-beb8-81cbec116da2","resolution":{"observed_at":"2026-08-06T21:13:15.061535Z","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-06T21:13:15.766967Z","title":"Webgraph: The next generation (is in rust),","venue":null,"work_id":"c8d16aea-5823-4f0a-a34c-af03643d94b5","year":2024},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.145428Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:16172869120582ebc46c60b8e3bb03b38fb1050a1d7fc36d579d3d079669b74b","observation_id":"fe7b7abc-991c-461d-9658-27be1a349ef7","resolution":{"observed_at":"2026-08-06T21:13:15.771835Z","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-06T21:13:15.753579Z","title":"Clique partitions, graph com- pression and speeding-up algorithms,","venue":null,"work_id":"4c6d6831-0756-447a-a4dd-e5ab26f42595","year":1991},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.171562Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:39ab4b1a22ce2ab36bfdeda0efd858b118310d7d5630b2e11848af5cb6f48e43","observation_id":"76fcbdd3-e2fc-4a04-b5eb-1a5b41b3c58c","resolution":{"observed_at":"2026-08-06T21:13:15.758594Z","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-06T21:13:15.741012Z","title":"Graphzip: a clique-based sparse graph compression method,","venue":null,"work_id":"201524cf-ff6e-45cd-88c8-40fa7c4c11c4","year":2018},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.205806Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:8fc33c521f74a9b38ee0511b328f1a97d6701c42d5226c3f590ef175ac6fc2b2","observation_id":"0642a511-9065-43f1-8a26-a8651411ffcf","resolution":{"observed_at":"2026-08-06T21:13:15.745558Z","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-06T21:13:15.728066Z","title":"Qclique: Optimizing performance and acuracy in maximum weighted clique,","venue":null,"work_id":"db8a5df5-588c-47b2-8dbc-3df3ac54fa87","year":2024},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.243327Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:6ce343953cf2761ca03fad458faa2f897de41becff0c8985046ce6ff1661d4db","observation_id":"c5483687-9cdb-4521-97ef-85626881230f","resolution":{"observed_at":"2026-08-06T21:13:15.732284Z","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-06T21:13:15.715273Z","title":"Graph summarization with bounded error,","venue":null,"work_id":"4040db03-17ba-4718-b0ed-a5aa09ec65b9","year":2008},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.279394Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:8c5d49e145c35b717c99ca379f1be7ba2e0a774ad832606d1009057cb9648e88","observation_id":"30dcb10c-ce8e-46fd-91d1-f0133a648767","resolution":{"observed_at":"2026-08-06T21:13:15.719615Z","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-06T21:13:15.702781Z","title":"Graph compression,","venue":null,"work_id":"e1bdf830-a7a8-4fd6-a42f-e28c0508452b","year":2015},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.305857Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:0551e7bcf5061334f69e773bb761d29de185680beaa90b28cc38b584b8b4d5fb","observation_id":"714b739c-cee8-4e43-8c51-2c3afd8b8c8a","resolution":{"observed_at":"2026-08-06T21:13:15.707283Z","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-06T21:13:15.688589Z","title":"Compressgraph: Ef fi cient parallel graph analytics with rule-based compression,","venue":null,"work_id":"809bd07d-2e17-4bd9-bd39-0fd18d1f69f5","year":2023},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.337725Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:d2932ffebc3283565b4706c48d10b7aef4adbb81ab0ef9386808a72ea48a8415","observation_id":"38921848-8322-4de6-82db-b1981119d5aa","resolution":{"observed_at":"2026-08-06T21:13:15.693346Z","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-06T21:13:15.674648Z","title":"Estimating and sampling graphs with multidimensional random walks,","venue":null,"work_id":"3f0bdd87-cd36-46ba-b51f-f717c52c356a","year":2010},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.361373Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:45eebbe935542ecf33a6b55b6d90e87102302c780cff0182ce846142f475a2bb","observation_id":"3c53f4f0-1fd2-4a0b-bdca-692c5a8e241f","resolution":{"observed_at":"2026-08-06T21:13:15.679682Z","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-06T21:13:15.564634Z","title":"Query preserving graph compression,","venue":null,"work_id":"2c5af22d-44ae-4dc7-bd72-321aae72c789","year":2012},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.382193Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:0bf98e05c182bd6a7192cddbff0533d5d3c60b2298c4484b7536791c92fc016d","observation_id":"f989881a-3f5d-4443-aa0a-81febf49633a","resolution":{"observed_at":"2026-08-06T21:13:15.569005Z","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-06T21:13:15.551772Z","title":"Compressing network graphs,","venue":null,"work_id":"06571718-a8f1-4285-84cc-a2b114b7db08","year":2004},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.416121Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:98942ddc6044e01b508790cf28034addf894cfaade90e81916e4832869289afe","observation_id":"2e9a8318-20e9-49cd-82dc-df12f969f196","resolution":{"observed_at":"2026-08-06T21:13:15.555545Z","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":"1504.00616","last_updated":"2015-04-02T17:08:09Z","snapshot_observed_at":"2026-08-14T22:53:51.495801Z","submitted_at":"2015-04-02T17:08:09Z","title":"A Survey on Methods and Systems for Graph Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.00616","snapshot_observed_at":"2026-08-06T21:13:14.451215Z","title":"A survey on methods and systems for graph compression,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.451215Z"},"links":{"cited_paper":"/paper/1504.00616","citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:2f1a2f47f06417cc9f68661553b1d10d2202672bc0fc025a00a7f949b40812d8","observation_id":"611da428-2ec7-4617-9098-d63e6a68a58c","resolution":{"observed_at":"2026-08-06T21:13:14.451215Z","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-06T21:13:15.537870Z","title":"Summa- rizing semantic graphs: a survey,","venue":null,"work_id":"0061bd1f-8121-4269-a810-2852957895e7","year":2019},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.485374Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:bb8df1d1038a452b8baf3e5e074edd2f8ab76f1dba2243bac26f2199e55cc794","observation_id":"e468ae0f-f015-4b5c-81ec-8d019eda8d42","resolution":{"observed_at":"2026-08-06T21:13:15.542773Z","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-06T21:13:15.523893Z","title":"Summarizing static and dynamic big graphs,","venue":null,"work_id":"495f49a8-d963-44b9-89ac-9fd9029c5eee","year":2017},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.513929Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:cd1573b7de8fde9e0a9b8671f101033c5192500abe904055831a5bfe51433cb3","observation_id":"26aa3b81-b5fd-486b-bfc2-1e6da0954999","resolution":{"observed_at":"2026-08-06T21:13:15.528643Z","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-06T21:13:15.510782Z","title":"Endgraph: An ef fi cient distributed graph preprocessing system,","venue":null,"work_id":"adf4f9f1-63de-4485-b300-088920df1466","year":2022},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.549741Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:346e330073bc4e493f6378fcdaff119a69c1eedae3dc469cc665b7f6d9b066e2","observation_id":"6c9b914f-953c-4ea0-ae47-562a1968eec8","resolution":{"observed_at":"2026-08-06T21:13:15.515962Z","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-06T21:13:15.497604Z","title":"Grapu: Ac- celerate streaming graph analysis through preprocessing buffered updates,","venue":null,"work_id":"fb16a9b4-08a1-4c4a-9472-ce2d0c3745db","year":2018},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.584027Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:d7a3ca9f3a68e9ac69ba5d40dcf4ccfdb9eb98435590535809909a15d52174e4","observation_id":"172ecded-a214-45b9-ad35-52c00680b38f","resolution":{"observed_at":"2026-08-06T21:13:15.502280Z","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-06T21:13:15.483308Z","title":"Evaluation of parallel graph loading techniques,","venue":null,"work_id":"813d5071-f3ca-4c89-bd70-f8548c69b955","year":2016},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.619928Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:8b478fc0ab7bcbafa642c0ce4298d012bd8624f046299ecd44622b05404236a2","observation_id":"a021dba2-9cde-4d44-820d-681d64b89a67","resolution":{"observed_at":"2026-08-06T21:13:15.488596Z","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-06T21:13:15.469506Z","title":"A survey of graph pre-processing methods: From algorithmic to hardware perspectives,","venue":null,"work_id":"e15ee175-b0bc-4421-9817-94cab8c1f148","year":2023},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.654924Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:209208a57f1cff44784d2a05c13728e60464c08184a15264052aeef966c3ec26","observation_id":"c6f8920d-af3d-442a-a0fb-e253571d6824","resolution":{"observed_at":"2026-08-06T21:13:15.473927Z","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":"1903.01955","last_updated":"2019-03-05T17:40:38Z","snapshot_observed_at":"2026-08-14T17:07:02.352608Z","submitted_at":"2019-03-05T17:40:38Z","title":"The Lustre Storage Architecture","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.01955","snapshot_observed_at":"2026-08-06T21:13:14.690047Z","title":"The lustre storage architecture,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.690047Z"},"links":{"cited_paper":"/paper/1903.01955","citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:69408f7a064f772f1c31ed64df525be1d15ebee654fe87309a8ceb2a53fddf26","observation_id":"1c3c46b6-91d8-4856-b13c-cd25ad58ccd4","resolution":{"observed_at":"2026-08-06T21:13:14.690047Z","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-06T21:13:15.455278Z","title":"Lustre unveiled: Evolution, design, advancements, and current trends,","venue":null,"work_id":"5ebc865d-dd58-4e91-9a19-031bf5f357fc","year":2025},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.726772Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:9eefdcc78abc1c3d008bf56262cc2f49fb2ab3eb52d5f753697d4417f7ec0b52","observation_id":"fb9d37c4-479a-4da2-a871-e160e581810d","resolution":{"observed_at":"2026-08-06T21:13:15.460132Z","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-06T21:13:15.440576Z","title":"Toward greener matrix operations by lossless compressed formats,","venue":null,"work_id":"24a7c612-30ca-4db6-b726-1592711c3782","year":2025},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.761645Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:0e02b246d524fddb12a7d63a339e8a95eafa8a2aa8412bdc9eab47bb6b4c8c82","observation_id":"c62d726d-97b5-466a-a1a6-c85dc145251c","resolution":{"observed_at":"2026-08-06T21:13:15.446068Z","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-06T21:13:15.425213Z","title":"The graph structure in the web – analyzed on different aggregation levels,","venue":null,"work_id":"b9f211c8-d08e-4bfb-a65b-7b6b59471f43","year":2015},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.795483Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:eaf4ebc62992ef79d2c7b4340be997ddaeddc4272a746f715936e981a7ea6de4","observation_id":"91711016-08c8-4a0b-9a3a-b2126d1abf40","resolution":{"observed_at":"2026-08-06T21:13:15.430558Z","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-06T21:13:15.409051Z","title":"Graph structure in the web: Aggregated by pay-level domain,","venue":null,"work_id":"1c60a93d-e2c1-48ac-bf5c-3b314c22824f","year":2014},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.831779Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:e9165a0b85e9b0519d9c929e2993589b2d5ade7b5e47e7990b67b69b5f085eb8","observation_id":"8a311cf9-ad3e-452d-994c-745104670caf","resolution":{"observed_at":"2026-08-06T21:13:15.414690Z","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-06T21:13:15.394150Z","title":"Graph structure in the web — revisited: A trick of the heavy tail,","venue":null,"work_id":"94e9c738-0865-44c0-a513-5b4b87aeff1b","year":2014},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.867478Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:f81e3e3eccf0e39752809d5bda6bcf1aae17c4d8878a8843969f9bb9746cc59c","observation_id":"722f0334-bc3d-47cd-b6ec-5afd4d5f8d09","resolution":{"observed_at":"2026-08-06T21:13:15.399293Z","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-06T21:13:15.368110Z","title":"A large time-aware graph,","venue":null,"work_id":"d9e633c3-7f3f-4241-b96b-ca3542f8172d","year":2008},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.903309Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:6d1c91f5da4a00ae603dc3cb1818bece5c90c743c91b8bf2c764956368803943","observation_id":"fe6e1236-d5df-43c2-b2e9-7a2b934515c4","resolution":{"observed_at":"2026-08-06T21:13:15.384551Z","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-06T21:13:15.298475Z","title":"What is twitter, a social network or a news media?","venue":null,"work_id":"11f792ad-403c-470e-964a-4eea1520649f","year":2010},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.938222Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:d5a4b3022ab89e676171fece83633f3056ba654ca65032fe5d49bc5a5224eed1","observation_id":"dd6da92c-9552-4711-ae3d-e3792a3bbd3d","resolution":{"observed_at":"2026-08-06T21:13:15.328322Z","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-06T21:13:15.229508Z","title":"Introducing the graph 500,","venue":null,"work_id":"e5d9de32-8b01-4d80-a902-e21b990d4d4d","year":2010},"citing_paper":{"arxiv_id":"2507.00716","last_updated":"2025-07-01T12:51:09Z","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.972133Z"},"links":{"citing_paper":"/paper/2507.00716"},"observation_digest":"sha256:52bc27c21787717841c661470c6312af3b15bb7683ee2ac17c8d18a167397880","observation_id":"ba0b7dcb-d2b5-48c6-bd80-544782472f2d","resolution":{"observed_at":"2026-08-06T21:13:15.258697Z","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":"2507.00716","last_updated":"2025-07-01T12:51:09Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T20:26:28.385210Z","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":35},"total_outbound_references":40},"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 15 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2507.00716."}