{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JSVIZ7Z2U34KVUEYWVS4OIFRIE","short_pith_number":"pith:JSVIZ7Z2","canonical_record":{"source":{"id":"2410.13080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-16T22:55:17Z","cross_cats_sorted":[],"title_canon_sha256":"415f97592e8aab2d9f60ca1557a27a27b0192573ee264aeb1d3da30e59946e57","abstract_canon_sha256":"8521027843454bafa2493c58760effbbe149e3408b7470bc59009812a1ff88c6"},"schema_version":"1.0"},"canonical_sha256":"4caa8cff3aa6f8aad098b565c720b14136a590601b9fc6163579265ffd498330","source":{"kind":"arxiv","id":"2410.13080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13080","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13080v2","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13080","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"JSVIZ7Z2U34K","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"JSVIZ7Z2U34KVUEY","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"JSVIZ7Z2","created_at":"2026-07-05T11:10:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JSVIZ7Z2U34KVUEYWVS4OIFRIE","target":"record","payload":{"canonical_record":{"source":{"id":"2410.13080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-16T22:55:17Z","cross_cats_sorted":[],"title_canon_sha256":"415f97592e8aab2d9f60ca1557a27a27b0192573ee264aeb1d3da30e59946e57","abstract_canon_sha256":"8521027843454bafa2493c58760effbbe149e3408b7470bc59009812a1ff88c6"},"schema_version":"1.0"},"canonical_sha256":"4caa8cff3aa6f8aad098b565c720b14136a590601b9fc6163579265ffd498330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:48.088843Z","signature_b64":"5LIH4yjSh7XV/gqURlJYou2TCXIJzWx06E41mBdmOKqmfsyGVElqq8shIcNGZZDTxUcRH+aRJLJmNQXSr4EdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4caa8cff3aa6f8aad098b565c720b14136a590601b9fc6163579265ffd498330","last_reissued_at":"2026-07-05T11:10:48.088344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:48.088344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.13080","source_version":2,"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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYgNyR16nM19NPEM/9klEv0q3ADor6uUIC20+351IbMyOcrsKPjAm8QKlGDr/LKfXLl3YGTyeXAvsLxTzQ5TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T15:17:11.313876Z"},"content_sha256":"eb45253256f8782755787522830ac6ef0059ebe105c703a53321b1bf2ed3f120","schema_version":"1.0","event_id":"sha256:eb45253256f8782755787522830ac6ef0059ebe105c703a53321b1bf2ed3f120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JSVIZ7Z2U34KVUEYWVS4OIFRIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chen Gong, Gholamreza Haffari, Linhao Luo, Shirui Pan, Yuan-Fang Li, Zicheng Zhao","submitted_at":"2024-10-16T22:55:17Z","abstract_excerpt":"Large language models (LLMs) have demonstrated impressive reasoning abilities, but they still struggle with faithful reasoning due to knowledge gaps and hallucinations. To address these issues, knowledge graphs (KGs) have been utilized to enhance LLM reasoning through their structured knowledge. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this work, we introduce graph-constrained reasoning (GCR), a novel framework that bridges structured knowledge in KGs with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13080","kind":"arxiv","version":2},"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/2410.13080/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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDmSN+uUbquhQw6rXApHhqURE+74evvvCzU5MAMUocRie1BgKv+2xl3ZKrEPLP9jidDmsaEss4QJUXA35IucCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T15:17:11.314382Z"},"content_sha256":"2b232de98b8524db856483e947ad269e397abe92ec6ce3509825fc042810a52a","schema_version":"1.0","event_id":"sha256:2b232de98b8524db856483e947ad269e397abe92ec6ce3509825fc042810a52a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/bundle.json","state_url":"https://pith.science/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/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-02T15:17:11Z","links":{"resolver":"https://pith.science/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE","bundle":"https://pith.science/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/bundle.json","state":"https://pith.science/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSVIZ7Z2U34KVUEYWVS4OIFRIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JSVIZ7Z2U34KVUEYWVS4OIFRIE","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":"8521027843454bafa2493c58760effbbe149e3408b7470bc59009812a1ff88c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-16T22:55:17Z","title_canon_sha256":"415f97592e8aab2d9f60ca1557a27a27b0192573ee264aeb1d3da30e59946e57"},"schema_version":"1.0","source":{"id":"2410.13080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.13080","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2410.13080v2","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13080","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"JSVIZ7Z2U34K","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"JSVIZ7Z2U34KVUEY","created_at":"2026-07-05T11:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"JSVIZ7Z2","created_at":"2026-07-05T11:10:48Z"}],"graph_snapshots":[{"event_id":"sha256:2b232de98b8524db856483e947ad269e397abe92ec6ce3509825fc042810a52a","target":"graph","created_at":"2026-07-05T11:10:48Z","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/2410.13080/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) have demonstrated impressive reasoning abilities, but they still struggle with faithful reasoning due to knowledge gaps and hallucinations. To address these issues, knowledge graphs (KGs) have been utilized to enhance LLM reasoning through their structured knowledge. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this work, we introduce graph-constrained reasoning (GCR), a novel framework that bridges structured knowledge in KGs with ","authors_text":"Chen Gong, Gholamreza Haffari, Linhao Luo, Shirui Pan, Yuan-Fang Li, Zicheng Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13080","kind":"arxiv","version":2},"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:eb45253256f8782755787522830ac6ef0059ebe105c703a53321b1bf2ed3f120","target":"record","created_at":"2026-07-05T11:10:48Z","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":"8521027843454bafa2493c58760effbbe149e3408b7470bc59009812a1ff88c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-16T22:55:17Z","title_canon_sha256":"415f97592e8aab2d9f60ca1557a27a27b0192573ee264aeb1d3da30e59946e57"},"schema_version":"1.0","source":{"id":"2410.13080","kind":"arxiv","version":2}},"canonical_sha256":"4caa8cff3aa6f8aad098b565c720b14136a590601b9fc6163579265ffd498330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4caa8cff3aa6f8aad098b565c720b14136a590601b9fc6163579265ffd498330","first_computed_at":"2026-07-05T11:10:48.088344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:48.088344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5LIH4yjSh7XV/gqURlJYou2TCXIJzWx06E41mBdmOKqmfsyGVElqq8shIcNGZZDTxUcRH+aRJLJmNQXSr4EdBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:48.088843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.13080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb45253256f8782755787522830ac6ef0059ebe105c703a53321b1bf2ed3f120","sha256:2b232de98b8524db856483e947ad269e397abe92ec6ce3509825fc042810a52a"],"state_sha256":"22dfdf61cdefeb3488fff6502c22d6a47df31e9f0f26fa2949c1f3c80450537f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2sO8oF6nANgl0Sy5HNdfxLbp6PUPLb53UVc3BQIPWc2ihD5tZ7/3Mn+/o/qrx5BILYRMghLUFzSUMG953cYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T15:17:11.318573Z","bundle_sha256":"e3a5717cbaa6e17d9bf3d78807cd4a0472b16186352b3a356e408b7a713957d2"}}