{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GHPU2W5EPL4CAD5I2T7CAHDDET","short_pith_number":"pith:GHPU2W5E","canonical_record":{"source":{"id":"2509.24256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-29T04:05:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"02bafa974516e8fb9581a6735a26e97b996246bb6d9545e4c7210d98a5b9524c","abstract_canon_sha256":"9f74fc6e4448347b368308c1131c3ee7b0f731caadfb233579a79f742eebd479"},"schema_version":"1.0"},"canonical_sha256":"31df4d5ba47af8200fa8d4fe201c6324cb00a3beb4c1c2a1409128e2e559c085","source":{"kind":"arxiv","id":"2509.24256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.24256","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"2509.24256v2","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.24256","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"GHPU2W5EPL4C","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_16","alias_value":"GHPU2W5EPL4CAD5I","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_8","alias_value":"GHPU2W5E","created_at":"2026-07-14T01:22:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GHPU2W5EPL4CAD5I2T7CAHDDET","target":"record","payload":{"canonical_record":{"source":{"id":"2509.24256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-29T04:05:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"02bafa974516e8fb9581a6735a26e97b996246bb6d9545e4c7210d98a5b9524c","abstract_canon_sha256":"9f74fc6e4448347b368308c1131c3ee7b0f731caadfb233579a79f742eebd479"},"schema_version":"1.0"},"canonical_sha256":"31df4d5ba47af8200fa8d4fe201c6324cb00a3beb4c1c2a1409128e2e559c085","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:01.149434Z","signature_b64":"PcFpKq8hqGQ/Iq4FRSjvgL/HrgrL0ZeBMOKHeR0e9Zbcz5Dhk4sji+HHNV3ITF+aVaYDl4++kASi3ObSyfrnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31df4d5ba47af8200fa8d4fe201c6324cb00a3beb4c1c2a1409128e2e559c085","last_reissued_at":"2026-07-14T01:22:01.148557Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:01.148557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.24256","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-14T01:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIbSZoAlPfYApOGAK1NN+d4DOYvd3T3c8n8OD432i16FePxxQnJsNSWT6js+akGijMuVJr04YNLdIXvY1UVeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:49:05.614804Z"},"content_sha256":"1ca70b63ae27123d786b2c011c4ea835d3ab57d9bdadc2c6d31f53c2bb5c70a8","schema_version":"1.0","event_id":"sha256:1ca70b63ae27123d786b2c011c4ea835d3ab57d9bdadc2c6d31f53c2bb5c70a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GHPU2W5EPL4CAD5I2T7CAHDDET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jingyuan Yang, Pujun Zhang, Shaochong Lin, Yuan Qu, Yunhao Liang, Zuo-Jun Max Shen","submitted_at":"2025-09-29T04:05:48Z","abstract_excerpt":"The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets. However, extending this paradigm to Operations Research (OR) problems on graph structures remains challenging due to the fundamental conflict between the statistical flexibility of language and the strict combinatorial constraints of graphs. To bridge this gap, we introduce the Graph Foundation Model (GFM), the first framework capable of solving all distance-based optimization p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.24256","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/2509.24256/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-14T01:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UUenZyLruE1Mv3D5xJJ/q4LDluHvr9uJD9eMsHfiflnMRrJmUl0rmsl66s7AFL+RoXEHtnmQzsyLfnAN6rqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:49:05.615355Z"},"content_sha256":"716c5aba2c5ca511f9510f17e6e12fac91c1d9a96d6eb1b5ac5cd70a5629af2d","schema_version":"1.0","event_id":"sha256:716c5aba2c5ca511f9510f17e6e12fac91c1d9a96d6eb1b5ac5cd70a5629af2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/bundle.json","state_url":"https://pith.science/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/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-07T04:49:05Z","links":{"resolver":"https://pith.science/pith/GHPU2W5EPL4CAD5I2T7CAHDDET","bundle":"https://pith.science/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/bundle.json","state":"https://pith.science/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHPU2W5EPL4CAD5I2T7CAHDDET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GHPU2W5EPL4CAD5I2T7CAHDDET","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":"9f74fc6e4448347b368308c1131c3ee7b0f731caadfb233579a79f742eebd479","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-29T04:05:48Z","title_canon_sha256":"02bafa974516e8fb9581a6735a26e97b996246bb6d9545e4c7210d98a5b9524c"},"schema_version":"1.0","source":{"id":"2509.24256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.24256","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"2509.24256v2","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.24256","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"GHPU2W5EPL4C","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_16","alias_value":"GHPU2W5EPL4CAD5I","created_at":"2026-07-14T01:22:01Z"},{"alias_kind":"pith_short_8","alias_value":"GHPU2W5E","created_at":"2026-07-14T01:22:01Z"}],"graph_snapshots":[{"event_id":"sha256:716c5aba2c5ca511f9510f17e6e12fac91c1d9a96d6eb1b5ac5cd70a5629af2d","target":"graph","created_at":"2026-07-14T01:22:01Z","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/2509.24256/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets. However, extending this paradigm to Operations Research (OR) problems on graph structures remains challenging due to the fundamental conflict between the statistical flexibility of language and the strict combinatorial constraints of graphs. To bridge this gap, we introduce the Graph Foundation Model (GFM), the first framework capable of solving all distance-based optimization p","authors_text":"Jingyuan Yang, Pujun Zhang, Shaochong Lin, Yuan Qu, Yunhao Liang, Zuo-Jun Max Shen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-29T04:05:48Z","title":"Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.24256","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:1ca70b63ae27123d786b2c011c4ea835d3ab57d9bdadc2c6d31f53c2bb5c70a8","target":"record","created_at":"2026-07-14T01:22:01Z","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":"9f74fc6e4448347b368308c1131c3ee7b0f731caadfb233579a79f742eebd479","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-29T04:05:48Z","title_canon_sha256":"02bafa974516e8fb9581a6735a26e97b996246bb6d9545e4c7210d98a5b9524c"},"schema_version":"1.0","source":{"id":"2509.24256","kind":"arxiv","version":2}},"canonical_sha256":"31df4d5ba47af8200fa8d4fe201c6324cb00a3beb4c1c2a1409128e2e559c085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31df4d5ba47af8200fa8d4fe201c6324cb00a3beb4c1c2a1409128e2e559c085","first_computed_at":"2026-07-14T01:22:01.148557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:22:01.148557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PcFpKq8hqGQ/Iq4FRSjvgL/HrgrL0ZeBMOKHeR0e9Zbcz5Dhk4sji+HHNV3ITF+aVaYDl4++kASi3ObSyfrnBQ==","signature_status":"signed_v1","signed_at":"2026-07-14T01:22:01.149434Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.24256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca70b63ae27123d786b2c011c4ea835d3ab57d9bdadc2c6d31f53c2bb5c70a8","sha256:716c5aba2c5ca511f9510f17e6e12fac91c1d9a96d6eb1b5ac5cd70a5629af2d"],"state_sha256":"951f1ee92d7019a95b408cb15ac11b499e5e17912340617b03c6522a098a1c6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4z0fiYnsE7vT9JmPS0RZnOAmfY0KNJduKgl0YUFjpGCd7maIwC5vL9mD1gxzVXoWhh3uBe5EwlpX0zQbNDkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:49:05.618992Z","bundle_sha256":"85e363dd9b72a94995bcbab4be87c1f5a4bc617a12c1370fe151ed508daede79"}}