{"paper":{"title":"Making the complete OpenAIRE citation graph easily accessible through compact data representation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The full OpenAIRE citation graph is reduced to a 16 GB dataset while preserving every publication and citation.","cross_cats":["cs.DL"],"primary_cat":"cs.SI","authors_text":"Joakim Skarding, Pavel Sanda","submitted_at":"2026-02-12T17:44:36Z","abstract_excerpt":"The OpenAIRE graph contains a large citation graph dataset, with over 200 million publications and over 2 billion citations. The current graph is available as a dump with metadata which, when uncompressed, totals $\\sim$2.5 TB. This makes it hard to process on conventional computers. To make this network more accessible for the community, we provide a processed OpenAIRE graph which is downscaled to 16 GB RAM, while preserving the full graph structure. Apart from this we offer the processed data in a very simple format, which allows for further straightforward manipulation. We also provide (1) a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we provide a processed OpenAIRE graph which is downscaled to 16 GB RAM, while preserving the full graph structure","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the chosen compact representation and simple format retain all information needed for the majority of downstream citation-graph analyses without introducing hidden losses or requiring users to re-derive missing fields.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A 16 GB version of the complete OpenAIRE citation graph is released together with processing code, keeping every node and edge while fitting on ordinary machines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The full OpenAIRE citation graph is reduced to a 16 GB dataset while preserving every publication and citation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1a454789240abb421ae8698ab1b3153122a842d981fec84298346a9d11405108"},"source":{"id":"2602.12206","kind":"arxiv","version":3},"verdict":{"id":"d1df8cde-9341-4069-a2e4-65eaffd6a9b6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T05:28:12.931267Z","strongest_claim":"we provide a processed OpenAIRE graph which is downscaled to 16 GB RAM, while preserving the full graph structure","one_line_summary":"A 16 GB version of the complete OpenAIRE citation graph is released together with processing code, keeping every node and edge while fitting on ordinary machines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the chosen compact representation and simple format retain all information needed for the majority of downstream citation-graph analyses without introducing hidden losses or requiring users to re-derive missing fields.","pith_extraction_headline":"The full OpenAIRE citation graph is reduced to a 16 GB dataset while preserving every publication and citation."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.12206/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}