{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M4HY4ZHZQBFNZ5T362Y72CNWDA","short_pith_number":"pith:M4HY4ZHZ","canonical_record":{"source":{"id":"2505.24226","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T05:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"5ee9af7467cc3421387d64c4c857672697fd09e899bfd3c6159eb5b95201a832","abstract_canon_sha256":"52e7a86b751ac140f43b82273e7bd1bff287f55f648679a17bb5872e6b9e020b"},"schema_version":"1.0"},"canonical_sha256":"670f8e64f9804adcf67bf6b1fd09b6183b9385ae65ea81d3f3f93171547fcc56","source":{"kind":"arxiv","id":"2505.24226","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24226","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24226v4","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24226","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"M4HY4ZHZQBFN","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"M4HY4ZHZQBFNZ5T3","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"M4HY4ZHZ","created_at":"2026-07-05T11:16:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M4HY4ZHZQBFNZ5T362Y72CNWDA","target":"record","payload":{"canonical_record":{"source":{"id":"2505.24226","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T05:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"5ee9af7467cc3421387d64c4c857672697fd09e899bfd3c6159eb5b95201a832","abstract_canon_sha256":"52e7a86b751ac140f43b82273e7bd1bff287f55f648679a17bb5872e6b9e020b"},"schema_version":"1.0"},"canonical_sha256":"670f8e64f9804adcf67bf6b1fd09b6183b9385ae65ea81d3f3f93171547fcc56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:59.589433Z","signature_b64":"E5Kx+iOkK2q4MrN9broNJ4sC3ZeezvQYjsoIdCOoZEHo/7D4EB5mr6uKQAlkqJtCqsd2TAF22nvjkXs1sNXbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670f8e64f9804adcf67bf6b1fd09b6183b9385ae65ea81d3f3f93171547fcc56","last_reissued_at":"2026-07-05T11:16:59.588922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:59.588922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.24226","source_version":4,"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:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYUW/91VJlPg9zi2MG2dzQ792U2T8FKMkhHUlXZVKsxNByfclHt1iBECIWUN3EW1f67q4lQ1gtcDALL9R+k5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:11:15.925815Z"},"content_sha256":"85c9cc0091ba28f41bf101307133049ac1d74a7167bc538b9c6f33c73bb6d980","schema_version":"1.0","event_id":"sha256:85c9cc0091ba28f41bf101307133049ac1d74a7167bc538b9c6f33c73bb6d980"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M4HY4ZHZQBFNZ5T362Y72CNWDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"E^2GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiapeng Zhu, Kangkang He, Xiang Li, Ye Guo, Yibo Zhao","submitted_at":"2025-05-30T05:27:40Z","abstract_excerpt":"Graph-based RAG methods like GraphRAG have shown promising global understanding of the knowledge base by constructing hierarchical entity graphs. However, they often suffer from inefficiency and rely on manually pre-defined query modes, limiting practical use. In this paper, we propose E^2GraphRAG, a streamlined graph-based RAG framework that improves both Efficiency and Effectiveness. During the indexing stage, E^2GraphRAG constructs a summary tree with large language models and an entity graph with SpaCy based on document chunks. We then construct bidirectional indexes between entities and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24226","kind":"arxiv","version":4},"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/2505.24226/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:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYtIZ/N5a00iGAoABl66KDZ+wswyyF/HqH38Tu2apN4Z6CfJY7ekXdvAbEsknm9cNUfJUU09C53KAhG5fnKaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T01:11:15.926415Z"},"content_sha256":"ba606c2ffdd6cdfa7cd4c4a25e8d36a6269d8ad6bd26c254ab5ba675d2f858d6","schema_version":"1.0","event_id":"sha256:ba606c2ffdd6cdfa7cd4c4a25e8d36a6269d8ad6bd26c254ab5ba675d2f858d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/bundle.json","state_url":"https://pith.science/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/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-18T01:11:15Z","links":{"resolver":"https://pith.science/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA","bundle":"https://pith.science/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/bundle.json","state":"https://pith.science/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4HY4ZHZQBFNZ5T362Y72CNWDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M4HY4ZHZQBFNZ5T362Y72CNWDA","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":"52e7a86b751ac140f43b82273e7bd1bff287f55f648679a17bb5872e6b9e020b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T05:27:40Z","title_canon_sha256":"5ee9af7467cc3421387d64c4c857672697fd09e899bfd3c6159eb5b95201a832"},"schema_version":"1.0","source":{"id":"2505.24226","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24226","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24226v4","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24226","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"M4HY4ZHZQBFN","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"M4HY4ZHZQBFNZ5T3","created_at":"2026-07-05T11:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"M4HY4ZHZ","created_at":"2026-07-05T11:16:59Z"}],"graph_snapshots":[{"event_id":"sha256:ba606c2ffdd6cdfa7cd4c4a25e8d36a6269d8ad6bd26c254ab5ba675d2f858d6","target":"graph","created_at":"2026-07-05T11:16:59Z","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/2505.24226/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph-based RAG methods like GraphRAG have shown promising global understanding of the knowledge base by constructing hierarchical entity graphs. However, they often suffer from inefficiency and rely on manually pre-defined query modes, limiting practical use. In this paper, we propose E^2GraphRAG, a streamlined graph-based RAG framework that improves both Efficiency and Effectiveness. During the indexing stage, E^2GraphRAG constructs a summary tree with large language models and an entity graph with SpaCy based on document chunks. We then construct bidirectional indexes between entities and c","authors_text":"Jiapeng Zhu, Kangkang He, Xiang Li, Ye Guo, Yibo Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T05:27:40Z","title":"E^2GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24226","kind":"arxiv","version":4},"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:85c9cc0091ba28f41bf101307133049ac1d74a7167bc538b9c6f33c73bb6d980","target":"record","created_at":"2026-07-05T11:16:59Z","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":"52e7a86b751ac140f43b82273e7bd1bff287f55f648679a17bb5872e6b9e020b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-30T05:27:40Z","title_canon_sha256":"5ee9af7467cc3421387d64c4c857672697fd09e899bfd3c6159eb5b95201a832"},"schema_version":"1.0","source":{"id":"2505.24226","kind":"arxiv","version":4}},"canonical_sha256":"670f8e64f9804adcf67bf6b1fd09b6183b9385ae65ea81d3f3f93171547fcc56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"670f8e64f9804adcf67bf6b1fd09b6183b9385ae65ea81d3f3f93171547fcc56","first_computed_at":"2026-07-05T11:16:59.588922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:59.588922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E5Kx+iOkK2q4MrN9broNJ4sC3ZeezvQYjsoIdCOoZEHo/7D4EB5mr6uKQAlkqJtCqsd2TAF22nvjkXs1sNXbCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:59.589433Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24226","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c9cc0091ba28f41bf101307133049ac1d74a7167bc538b9c6f33c73bb6d980","sha256:ba606c2ffdd6cdfa7cd4c4a25e8d36a6269d8ad6bd26c254ab5ba675d2f858d6"],"state_sha256":"ea4749bd8400b823ac101536e56255393729d6380fa2ab5dbb08afafdbd5e120"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmP4kiMtGnkGphBPSj6mh0ao08Oyr5vO9akgU86BJkKTt8SmjsTKXnWT6M+ZivSSahGV/2up/W+Vy6K6x0rrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T01:11:15.929860Z","bundle_sha256":"3ab0be1da2410d3a20ad8d9dbc0cac1e4cb69ef5707575696f75923704ea9a8e"}}