{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XIX5KLEKRUVWQFMRWL3M4NIYS6","short_pith_number":"pith:XIX5KLEK","canonical_record":{"source":{"id":"2507.00716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T12:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"99df3c50d653174dae74a68c59138d2fda67d1e1903c59250096e5b1f4fcbc06","abstract_canon_sha256":"662931e6ec3d817e737433e301a4925d767887d09581d769ec9b828cd943767c"},"schema_version":"1.0"},"canonical_sha256":"ba2fd52c8a8d2b681591b2f6ce3518979ff969612763adc484437287b66e72ce","source":{"kind":"arxiv","id":"2507.00716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00716","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00716v1","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00716","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"XIX5KLEKRUVW","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_16","alias_value":"XIX5KLEKRUVWQFMR","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_8","alias_value":"XIX5KLEK","created_at":"2026-07-05T11:30:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XIX5KLEKRUVWQFMRWL3M4NIYS6","target":"record","payload":{"canonical_record":{"source":{"id":"2507.00716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T12:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"99df3c50d653174dae74a68c59138d2fda67d1e1903c59250096e5b1f4fcbc06","abstract_canon_sha256":"662931e6ec3d817e737433e301a4925d767887d09581d769ec9b828cd943767c"},"schema_version":"1.0"},"canonical_sha256":"ba2fd52c8a8d2b681591b2f6ce3518979ff969612763adc484437287b66e72ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:13.412284Z","signature_b64":"wbtNWHZltH4BkMU4fp47FCV7q9dMmHZnmuPFFqKAdoK0Y6qGWRCpTdugGNeWMtgQ0zHxQBpVByIex3yhuX27Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba2fd52c8a8d2b681591b2f6ce3518979ff969612763adc484437287b66e72ce","last_reissued_at":"2026-07-05T11:30:13.411820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:13.411820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.00716","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btdT5j1eqdR7pykzL2rM/UzqoPBxstLqsFmTxDbhhUTHrFUcmurZN1lPVM280wNQthNvaL3Re51Hh9w8qGQACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:39:30.092022Z"},"content_sha256":"3eb2a1fbb07501279d795be9c4bd995e0bf18a293a299e994545600282499c4a","schema_version":"1.0","event_id":"sha256:3eb2a1fbb07501279d795be9c4bd995e0bf18a293a299e994545600282499c4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XIX5KLEKRUVWQFMRWL3M4NIYS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Loading WebGraphs in ParaGrapher","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mohsen Koohi Esfahani","submitted_at":"2025-07-01T12:51:09Z","abstract_excerpt":"ParaGrapher is a graph loading API and library that enables graph processing frameworks to load large-scale compressed graphs with minimal overhead. This capability accelerates the design and implementation of new high-performance graph algorithms and their evaluation on a wide range of graphs and across different frameworks. However, our previous study identified two major limitations in ParaGrapher: inefficient utilization of high-bandwidth storage and reduced decompression bandwidth due to increased compression ratios. To address these limitations, we present two optimizations for ParaGraph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00716","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.00716/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PX2Mq+G071e2iFr3k9iUuspg+IWxAkGQN019lOtfE03KqveOfDCqD2FpqEC/MlVwaSkNON5UVjstG3JPqMIjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:39:30.092646Z"},"content_sha256":"a75cd30d915dde8166cd21746b3406f1987df4d90cfe0c7de2a657c9e2991253","schema_version":"1.0","event_id":"sha256:a75cd30d915dde8166cd21746b3406f1987df4d90cfe0c7de2a657c9e2991253"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/bundle.json","state_url":"https://pith.science/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T08:39:30Z","links":{"resolver":"https://pith.science/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6","bundle":"https://pith.science/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/bundle.json","state":"https://pith.science/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIX5KLEKRUVWQFMRWL3M4NIYS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XIX5KLEKRUVWQFMRWL3M4NIYS6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"662931e6ec3d817e737433e301a4925d767887d09581d769ec9b828cd943767c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T12:51:09Z","title_canon_sha256":"99df3c50d653174dae74a68c59138d2fda67d1e1903c59250096e5b1f4fcbc06"},"schema_version":"1.0","source":{"id":"2507.00716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00716","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00716v1","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00716","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"XIX5KLEKRUVW","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_16","alias_value":"XIX5KLEKRUVWQFMR","created_at":"2026-07-05T11:30:13Z"},{"alias_kind":"pith_short_8","alias_value":"XIX5KLEK","created_at":"2026-07-05T11:30:13Z"}],"graph_snapshots":[{"event_id":"sha256:a75cd30d915dde8166cd21746b3406f1987df4d90cfe0c7de2a657c9e2991253","target":"graph","created_at":"2026-07-05T11:30:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.00716/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"ParaGrapher is a graph loading API and library that enables graph processing frameworks to load large-scale compressed graphs with minimal overhead. This capability accelerates the design and implementation of new high-performance graph algorithms and their evaluation on a wide range of graphs and across different frameworks. However, our previous study identified two major limitations in ParaGrapher: inefficient utilization of high-bandwidth storage and reduced decompression bandwidth due to increased compression ratios. To address these limitations, we present two optimizations for ParaGraph","authors_text":"Mohsen Koohi Esfahani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T12:51:09Z","title":"Accelerating Loading WebGraphs in ParaGrapher"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00716","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3eb2a1fbb07501279d795be9c4bd995e0bf18a293a299e994545600282499c4a","target":"record","created_at":"2026-07-05T11:30:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"662931e6ec3d817e737433e301a4925d767887d09581d769ec9b828cd943767c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T12:51:09Z","title_canon_sha256":"99df3c50d653174dae74a68c59138d2fda67d1e1903c59250096e5b1f4fcbc06"},"schema_version":"1.0","source":{"id":"2507.00716","kind":"arxiv","version":1}},"canonical_sha256":"ba2fd52c8a8d2b681591b2f6ce3518979ff969612763adc484437287b66e72ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba2fd52c8a8d2b681591b2f6ce3518979ff969612763adc484437287b66e72ce","first_computed_at":"2026-07-05T11:30:13.411820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:13.411820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbtNWHZltH4BkMU4fp47FCV7q9dMmHZnmuPFFqKAdoK0Y6qGWRCpTdugGNeWMtgQ0zHxQBpVByIex3yhuX27Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:13.412284Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.00716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eb2a1fbb07501279d795be9c4bd995e0bf18a293a299e994545600282499c4a","sha256:a75cd30d915dde8166cd21746b3406f1987df4d90cfe0c7de2a657c9e2991253"],"state_sha256":"aa1dd2e5ec2a33f2352b50a078f5d156c65230ef1227323b73c19a4fc9c7f7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBjcwxKbd1S29px9/vED3+ZhCyBnsfs9Numt7FLwGANifqcr0p2W0HgbolIV8bLC3eYOuPpEaZPEH+6/zGZlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:39:30.098167Z","bundle_sha256":"6026b8924cb5c46c1ab2516ad4def71ceff5fa4458de1dc3e6faf7f3b642b123"}}