{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7FZOQFIHZK3N7EB3XAIK6FZ4E5","short_pith_number":"pith:7FZOQFIH","canonical_record":{"source":{"id":"2507.08945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-11T18:10:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cbc7d5a7ff0f08ad7e7b4436134a132f00179fc323c01150e5ac9b23773ff468","abstract_canon_sha256":"fa238eccade825e22b0f3dede80c93627c0d861d267d5d546ed3ca1057aa6ef5"},"schema_version":"1.0"},"canonical_sha256":"f972e81507cab6df903bb810af173c2765f88dee47be5f1dac2b749ebba707a7","source":{"kind":"arxiv","id":"2507.08945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08945","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08945v1","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08945","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"7FZOQFIHZK3N","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_16","alias_value":"7FZOQFIHZK3N7EB3","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_8","alias_value":"7FZOQFIH","created_at":"2026-07-05T11:36:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7FZOQFIHZK3N7EB3XAIK6FZ4E5","target":"record","payload":{"canonical_record":{"source":{"id":"2507.08945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-11T18:10:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cbc7d5a7ff0f08ad7e7b4436134a132f00179fc323c01150e5ac9b23773ff468","abstract_canon_sha256":"fa238eccade825e22b0f3dede80c93627c0d861d267d5d546ed3ca1057aa6ef5"},"schema_version":"1.0"},"canonical_sha256":"f972e81507cab6df903bb810af173c2765f88dee47be5f1dac2b749ebba707a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:00.915934Z","signature_b64":"p2vwGWFw9UviyRN3pq+a1nRehCjUYp3mYcmFIJC8xrC1SUy9wxDIGFSe+wNsS6I0hABdjChx7j3gJeMcq+PDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f972e81507cab6df903bb810af173c2765f88dee47be5f1dac2b749ebba707a7","last_reissued_at":"2026-07-05T11:36:00.915503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:00.915503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.08945","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPgaFEqlFhfVejQLvAOHwi5EITYTb+POPhOMrlw/WYULCeC5zvZSHKJzDqsfm5siVjgzCis78KhQYcOBGQtwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:03:20.035922Z"},"content_sha256":"972d0969d85dd44e2c08695e9ac5ffd0334456c6457857663bfbc6a898551c35","schema_version":"1.0","event_id":"sha256:972d0969d85dd44e2c08695e9ac5ffd0334456c6457857663bfbc6a898551c35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7FZOQFIHZK3N7EB3XAIK6FZ4E5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jason Mars, Jayanaka L. Dantanarayana, Kriszti\\'an Flautner, Lingjia Tang, Savini Kashmira","submitted_at":"2025-07-11T18:10:01Z","abstract_excerpt":"Conventional Retrieval Augmented Generation (RAG) approaches are common in text-based applications. However, they struggle with structured, interconnected datasets like knowledge graphs, where understanding underlying relationships is crucial for accurate retrieval. A common direction in graph-based retrieval employs iterative, rule-based traversal guided by Large Language Models (LLMs). Such existing iterative methods typically combine reasoning with single hop traversal at each step, making them vulnerable to LLM reasoning errors and hallucinations that ultimately hinder the retrieval of rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08945","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.08945/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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpQ8W0hp7gpaXr5vuVP70utYTMOWIdeCIy4UINgWi8MxKFv/H2hccX4HnEy1PVDem9VQMQQoBQd1klM5ltOmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:03:20.036431Z"},"content_sha256":"0c1a2f00f80cbdd36fa306dc5427726352d69fc001cadfbc25608c1c4340a929","schema_version":"1.0","event_id":"sha256:0c1a2f00f80cbdd36fa306dc5427726352d69fc001cadfbc25608c1c4340a929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/bundle.json","state_url":"https://pith.science/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/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-10T13:03:20Z","links":{"resolver":"https://pith.science/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5","bundle":"https://pith.science/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/bundle.json","state":"https://pith.science/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FZOQFIHZK3N7EB3XAIK6FZ4E5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7FZOQFIHZK3N7EB3XAIK6FZ4E5","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":"fa238eccade825e22b0f3dede80c93627c0d861d267d5d546ed3ca1057aa6ef5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-11T18:10:01Z","title_canon_sha256":"cbc7d5a7ff0f08ad7e7b4436134a132f00179fc323c01150e5ac9b23773ff468"},"schema_version":"1.0","source":{"id":"2507.08945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08945","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08945v1","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08945","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"7FZOQFIHZK3N","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_16","alias_value":"7FZOQFIHZK3N7EB3","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_8","alias_value":"7FZOQFIH","created_at":"2026-07-05T11:36:00Z"}],"graph_snapshots":[{"event_id":"sha256:0c1a2f00f80cbdd36fa306dc5427726352d69fc001cadfbc25608c1c4340a929","target":"graph","created_at":"2026-07-05T11:36:00Z","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.08945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Conventional Retrieval Augmented Generation (RAG) approaches are common in text-based applications. However, they struggle with structured, interconnected datasets like knowledge graphs, where understanding underlying relationships is crucial for accurate retrieval. A common direction in graph-based retrieval employs iterative, rule-based traversal guided by Large Language Models (LLMs). Such existing iterative methods typically combine reasoning with single hop traversal at each step, making them vulnerable to LLM reasoning errors and hallucinations that ultimately hinder the retrieval of rel","authors_text":"Jason Mars, Jayanaka L. Dantanarayana, Kriszti\\'an Flautner, Lingjia Tang, Savini Kashmira","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-11T18:10:01Z","title":"GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08945","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:972d0969d85dd44e2c08695e9ac5ffd0334456c6457857663bfbc6a898551c35","target":"record","created_at":"2026-07-05T11:36:00Z","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":"fa238eccade825e22b0f3dede80c93627c0d861d267d5d546ed3ca1057aa6ef5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-11T18:10:01Z","title_canon_sha256":"cbc7d5a7ff0f08ad7e7b4436134a132f00179fc323c01150e5ac9b23773ff468"},"schema_version":"1.0","source":{"id":"2507.08945","kind":"arxiv","version":1}},"canonical_sha256":"f972e81507cab6df903bb810af173c2765f88dee47be5f1dac2b749ebba707a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f972e81507cab6df903bb810af173c2765f88dee47be5f1dac2b749ebba707a7","first_computed_at":"2026-07-05T11:36:00.915503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:00.915503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2vwGWFw9UviyRN3pq+a1nRehCjUYp3mYcmFIJC8xrC1SUy9wxDIGFSe+wNsS6I0hABdjChx7j3gJeMcq+PDDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:00.915934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.08945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:972d0969d85dd44e2c08695e9ac5ffd0334456c6457857663bfbc6a898551c35","sha256:0c1a2f00f80cbdd36fa306dc5427726352d69fc001cadfbc25608c1c4340a929"],"state_sha256":"b6114be6a673809d3229d977d62d3dd13066eac3736ab73a8a11a8d5e28731d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvzZos+Q/5b+HwTudTwASJpRTMb+OX4qe3A/D1I4qqF8rroa7JCKtr20xU/PlodXw3fsg7eaPxP01pfNTHMRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:03:20.041091Z","bundle_sha256":"6bebe3af442f0ee01f0eeade8414a1b32a6b0ac76ddbc2bc6516746d7b6c1d90"}}