{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K4FOOWZRMVDGYMRWIC2LBNRWLG","short_pith_number":"pith:K4FOOWZR","canonical_record":{"source":{"id":"2410.22597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-29T23:28:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0b2c112a2847f8b311dcdae665fe0ab0671831b4352489e59d67062a3dfa1abf","abstract_canon_sha256":"d1eb77cb8d1aeeb14bc34fc4178895d7489831b14fb429513b6cbca0d7909b99"},"schema_version":"1.0"},"canonical_sha256":"570ae75b3165466c323640b4b0b63659b8a3bfbf52c7e73a284d1380b9a1c263","source":{"kind":"arxiv","id":"2410.22597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22597","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22597v1","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22597","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"K4FOOWZRMVDG","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"K4FOOWZRMVDGYMRW","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"K4FOOWZR","created_at":"2026-07-05T09:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K4FOOWZRMVDGYMRWIC2LBNRWLG","target":"record","payload":{"canonical_record":{"source":{"id":"2410.22597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-29T23:28:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0b2c112a2847f8b311dcdae665fe0ab0671831b4352489e59d67062a3dfa1abf","abstract_canon_sha256":"d1eb77cb8d1aeeb14bc34fc4178895d7489831b14fb429513b6cbca0d7909b99"},"schema_version":"1.0"},"canonical_sha256":"570ae75b3165466c323640b4b0b63659b8a3bfbf52c7e73a284d1380b9a1c263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:19.033187Z","signature_b64":"JWOUV27mAej4HpRTaPLDhlw18+vHgqDla/DBvRIGS96ccEisouUyzG9Fe5LwwYKDDfHjwVhL3+entzJPoiFnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"570ae75b3165466c323640b4b0b63659b8a3bfbf52c7e73a284d1380b9a1c263","last_reissued_at":"2026-07-05T09:28:19.032730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:19.032730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.22597","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-05T09:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRkqf2dWSc6tlLuIHOaRg5GoTYlctzFPCrj1fFIUcdB483k5dn6/T0d2Lk9mPN+F+YC+GHh8QhR/41Q25X6OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:31:37.012022Z"},"content_sha256":"bf2b68d95f990916227249768736f36d6ad0804c3702ff7ae2c9d9f6603132a6","schema_version":"1.0","event_id":"sha256:bf2b68d95f990916227249768736f36d6ad0804c3702ff7ae2c9d9f6603132a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K4FOOWZRMVDGYMRWIC2LBNRWLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are Large-Language Models Graph Algorithmic Reasoners?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander K Taylor, Anthony Cuturrufo, Mingyu Derek Ma, Vishal Yathish, Wei Wang","submitted_at":"2024-10-29T23:28:37Z","abstract_excerpt":"We seek to address a core challenge facing current Large Language Models (LLMs). LLMs have demonstrated superior performance in many tasks, yet continue to struggle with reasoning problems on explicit graphs that require multiple steps. To address this gap, we introduce a novel benchmark designed to evaluate LLM performance on classical algorithmic reasoning tasks on explicit graphs. Our benchmark encompasses five fundamental algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS) for connectivity, Dijkstra's algorithm and Floyd-Warshall algorithm for all nodes shortest path, and P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22597","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/2410.22597/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-05T09:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRznUhK/R2gDpiOstXUfo40obqs/uG7IB5rNJdZNSb5ISVDwwbakmo3NCQIdQPwpe/Eckc8EAJiLF9J+zjlbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:31:37.013115Z"},"content_sha256":"15bab0fa7f6efbd767a26461ab230e31a28f3cde57888ca5b9c3ade91a1e63aa","schema_version":"1.0","event_id":"sha256:15bab0fa7f6efbd767a26461ab230e31a28f3cde57888ca5b9c3ade91a1e63aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/bundle.json","state_url":"https://pith.science/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/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-17T04:31:37Z","links":{"resolver":"https://pith.science/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG","bundle":"https://pith.science/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/bundle.json","state":"https://pith.science/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4FOOWZRMVDGYMRWIC2LBNRWLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K4FOOWZRMVDGYMRWIC2LBNRWLG","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":"d1eb77cb8d1aeeb14bc34fc4178895d7489831b14fb429513b6cbca0d7909b99","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-29T23:28:37Z","title_canon_sha256":"0b2c112a2847f8b311dcdae665fe0ab0671831b4352489e59d67062a3dfa1abf"},"schema_version":"1.0","source":{"id":"2410.22597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.22597","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"2410.22597v1","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22597","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"K4FOOWZRMVDG","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"K4FOOWZRMVDGYMRW","created_at":"2026-07-05T09:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"K4FOOWZR","created_at":"2026-07-05T09:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:15bab0fa7f6efbd767a26461ab230e31a28f3cde57888ca5b9c3ade91a1e63aa","target":"graph","created_at":"2026-07-05T09:28:19Z","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.22597/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We seek to address a core challenge facing current Large Language Models (LLMs). LLMs have demonstrated superior performance in many tasks, yet continue to struggle with reasoning problems on explicit graphs that require multiple steps. To address this gap, we introduce a novel benchmark designed to evaluate LLM performance on classical algorithmic reasoning tasks on explicit graphs. Our benchmark encompasses five fundamental algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS) for connectivity, Dijkstra's algorithm and Floyd-Warshall algorithm for all nodes shortest path, and P","authors_text":"Alexander K Taylor, Anthony Cuturrufo, Mingyu Derek Ma, Vishal Yathish, Wei Wang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-29T23:28:37Z","title":"Are Large-Language Models Graph Algorithmic Reasoners?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22597","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:bf2b68d95f990916227249768736f36d6ad0804c3702ff7ae2c9d9f6603132a6","target":"record","created_at":"2026-07-05T09:28:19Z","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":"d1eb77cb8d1aeeb14bc34fc4178895d7489831b14fb429513b6cbca0d7909b99","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-29T23:28:37Z","title_canon_sha256":"0b2c112a2847f8b311dcdae665fe0ab0671831b4352489e59d67062a3dfa1abf"},"schema_version":"1.0","source":{"id":"2410.22597","kind":"arxiv","version":1}},"canonical_sha256":"570ae75b3165466c323640b4b0b63659b8a3bfbf52c7e73a284d1380b9a1c263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"570ae75b3165466c323640b4b0b63659b8a3bfbf52c7e73a284d1380b9a1c263","first_computed_at":"2026-07-05T09:28:19.032730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:28:19.032730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JWOUV27mAej4HpRTaPLDhlw18+vHgqDla/DBvRIGS96ccEisouUyzG9Fe5LwwYKDDfHjwVhL3+entzJPoiFnDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:28:19.033187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.22597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf2b68d95f990916227249768736f36d6ad0804c3702ff7ae2c9d9f6603132a6","sha256:15bab0fa7f6efbd767a26461ab230e31a28f3cde57888ca5b9c3ade91a1e63aa"],"state_sha256":"373bda0441e4170a2280f2e035dc23af3a99e2aadcb5c543125ab26379479fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5lwrQO87i1EDZcDAvvlal/jS8CGBm4SfHdHp3Ntt/zWekI+6qrWiLa9EwOPiSntCmP8MGUk4ptHPv9NHCFwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T04:31:37.019055Z","bundle_sha256":"c605abd6de79a385ad620c556ab345954ef178b41a7932e9d25215c3411a4b26"}}