{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W2J6D7JQBRPDEH3SUEH36BK23J","short_pith_number":"pith:W2J6D7JQ","schema_version":"1.0","canonical_sha256":"b693e1fd300c5e321f72a10fbf055ada5c06fd7387825173de7273b1f3a63cae","source":{"kind":"arxiv","id":"2511.10234","version":3},"attestation_state":"computed","paper":{"title":"Lost in Serialization: Invariance and Generalization of LLM Graph Reasoners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akanksha Ahuja, Daniel Herbst, Divyanshu Kumar, Fabrizio Frasca, Fatemeh Gholamzadeh Nasrabadi, Lea Karbevska","submitted_at":"2025-11-13T12:06:12Z","abstract_excerpt":"While promising, graph reasoners based on Large Language Models (LLMs) lack built-in invariance to symmetries in graph representations. Operating on sequential graph serializations, LLMs can produce different outputs under node reindexing, edge reordering, or formatting changes, raising robustness concerns. We systematically analyze these effects, studying how fine-tuning impacts encoding sensitivity as well generalization on unseen tasks. We propose a principled decomposition of graph serializations into node labeling, edge encoding, and syntax, and evaluate LLM robustness to variations of ea"},"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":"2511.10234","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T12:06:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1b6e87e6ae04db6ce0a32db53dfbdbaab6a688ae9a29fc57a74a80707d31b68a","abstract_canon_sha256":"6266a118a6fc5944c7970080252fdb2c670f17c575f54c9c9997eb25f1d43295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:57.418717Z","signature_b64":"I6GQBrzlStOfEgH+Lf83E2jMqdguFSaY/GSciDPaEK29YM0GXVTvd5whlg5mJQz1PL5U47JjA3VGo5s8mlO4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b693e1fd300c5e321f72a10fbf055ada5c06fd7387825173de7273b1f3a63cae","last_reissued_at":"2026-06-10T01:10:57.417594Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:57.417594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lost in Serialization: Invariance and Generalization of LLM Graph Reasoners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akanksha Ahuja, Daniel Herbst, Divyanshu Kumar, Fabrizio Frasca, Fatemeh Gholamzadeh Nasrabadi, Lea Karbevska","submitted_at":"2025-11-13T12:06:12Z","abstract_excerpt":"While promising, graph reasoners based on Large Language Models (LLMs) lack built-in invariance to symmetries in graph representations. Operating on sequential graph serializations, LLMs can produce different outputs under node reindexing, edge reordering, or formatting changes, raising robustness concerns. We systematically analyze these effects, studying how fine-tuning impacts encoding sensitivity as well generalization on unseen tasks. We propose a principled decomposition of graph serializations into node labeling, edge encoding, and syntax, and evaluate LLM robustness to variations of ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10234","kind":"arxiv","version":3},"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/2511.10234/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":"2511.10234","created_at":"2026-06-10T01:10:57.417757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.10234v3","created_at":"2026-06-10T01:10:57.417757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10234","created_at":"2026-06-10T01:10:57.417757+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2J6D7JQBRPD","created_at":"2026-06-10T01:10:57.417757+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2J6D7JQBRPDEH3S","created_at":"2026-06-10T01:10:57.417757+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2J6D7JQ","created_at":"2026-06-10T01:10:57.417757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.09484","citing_title":"Detecting Differences Is Not Understanding Structure: Large Language Models Fail at Graph Isomorphism","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J","json":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J.json","graph_json":"https://pith.science/api/pith-number/W2J6D7JQBRPDEH3SUEH36BK23J/graph.json","events_json":"https://pith.science/api/pith-number/W2J6D7JQBRPDEH3SUEH36BK23J/events.json","paper":"https://pith.science/paper/W2J6D7JQ"},"agent_actions":{"view_html":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J","download_json":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J.json","view_paper":"https://pith.science/paper/W2J6D7JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.10234&json=true","fetch_graph":"https://pith.science/api/pith-number/W2J6D7JQBRPDEH3SUEH36BK23J/graph.json","fetch_events":"https://pith.science/api/pith-number/W2J6D7JQBRPDEH3SUEH36BK23J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J/action/storage_attestation","attest_author":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J/action/author_attestation","sign_citation":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J/action/citation_signature","submit_replication":"https://pith.science/pith/W2J6D7JQBRPDEH3SUEH36BK23J/action/replication_record"}},"created_at":"2026-06-10T01:10:57.417757+00:00","updated_at":"2026-06-10T01:10:57.417757+00:00"}