{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WZTK36PD3N2H3OTSSZ7VS3PSYQ","short_pith_number":"pith:WZTK36PD","schema_version":"1.0","canonical_sha256":"b666adf9e3db747dba72967f596df2c43f3529c8922454b299320417aebca922","source":{"kind":"arxiv","id":"2606.11562","version":1},"attestation_state":"computed","paper":{"title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Hanlin Gu, Jingzhou Jiang, Lixin Fan, Yi Yang, Zhuoyi Peng","submitted_at":"2026-06-10T01:41:53Z","abstract_excerpt":"Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood. We introduce GraphInfer-Bench, a benchmark for whether LLMs can perform this graph inference: producing an open-ended answer that no single node supports and no path retrieves. Existing graph-QA protocols cannot test this capability: algorithm simulation, node classification, single-node description, KG-QA, and GraphRAG all admit answers r"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.11562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-10T01:41:53Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"2237959e2bc6db1d2282370c5a0268eb03920d05d3bfe80f39a8f25b735709bf","abstract_canon_sha256":"a0fe5d8843890b60a6dea479ff94717d47bd7e5a98e55a76a9f2595040b021ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:56.212162Z","signature_b64":"mkSHVGB7uTRkBeKJKtvYv5NNBvkGOayfo/zxDv+ElpmPIcXd7FLJYmMYXZH4AwFpXSs06Z5EVylToXjE0y7iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b666adf9e3db747dba72967f596df2c43f3529c8922454b299320417aebca922","last_reissued_at":"2026-06-11T01:09:56.211245Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:56.211245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Hanlin Gu, Jingzhou Jiang, Lixin Fan, Yi Yang, Zhuoyi Peng","submitted_at":"2026-06-10T01:41:53Z","abstract_excerpt":"Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood. We introduce GraphInfer-Bench, a benchmark for whether LLMs can perform this graph inference: producing an open-ended answer that no single node supports and no path retrieves. Existing graph-QA protocols cannot test this capability: algorithm simulation, node classification, single-node description, KG-QA, and GraphRAG all admit answers r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11562","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/2606.11562/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.11562","created_at":"2026-06-11T01:09:56.211419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11562v1","created_at":"2026-06-11T01:09:56.211419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11562","created_at":"2026-06-11T01:09:56.211419+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZTK36PD3N2H","created_at":"2026-06-11T01:09:56.211419+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZTK36PD3N2H3OTS","created_at":"2026-06-11T01:09:56.211419+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZTK36PD","created_at":"2026-06-11T01:09:56.211419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ","json":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ.json","graph_json":"https://pith.science/api/pith-number/WZTK36PD3N2H3OTSSZ7VS3PSYQ/graph.json","events_json":"https://pith.science/api/pith-number/WZTK36PD3N2H3OTSSZ7VS3PSYQ/events.json","paper":"https://pith.science/paper/WZTK36PD"},"agent_actions":{"view_html":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ","download_json":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ.json","view_paper":"https://pith.science/paper/WZTK36PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11562&json=true","fetch_graph":"https://pith.science/api/pith-number/WZTK36PD3N2H3OTSSZ7VS3PSYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WZTK36PD3N2H3OTSSZ7VS3PSYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ/action/storage_attestation","attest_author":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ/action/author_attestation","sign_citation":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ/action/citation_signature","submit_replication":"https://pith.science/pith/WZTK36PD3N2H3OTSSZ7VS3PSYQ/action/replication_record"}},"created_at":"2026-06-11T01:09:56.211419+00:00","updated_at":"2026-06-11T01:09:56.211419+00:00"}