{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V7UDU7IKFAGE5HXEM2IWKO6LXH","short_pith_number":"pith:V7UDU7IK","canonical_record":{"source":{"id":"2508.20330","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T00:15:57Z","cross_cats_sorted":[],"title_canon_sha256":"22b410d466cd04961263953a56fe3253f1cfcff67eb6b3a3017b060061bc9abf","abstract_canon_sha256":"bf435c888fe01d6a4e5a7cbd11fd3443849a8e310c0176e11beed23065a1cd3a"},"schema_version":"1.0"},"canonical_sha256":"afe83a7d0a280c4e9ee46691653bcbb9f269629f061c7b85b897bc5282e9d6a7","source":{"kind":"arxiv","id":"2508.20330","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20330","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20330v5","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20330","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"V7UDU7IKFAGE","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"V7UDU7IKFAGE5HXE","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"V7UDU7IK","created_at":"2026-06-19T16:10:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V7UDU7IKFAGE5HXEM2IWKO6LXH","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20330","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T00:15:57Z","cross_cats_sorted":[],"title_canon_sha256":"22b410d466cd04961263953a56fe3253f1cfcff67eb6b3a3017b060061bc9abf","abstract_canon_sha256":"bf435c888fe01d6a4e5a7cbd11fd3443849a8e310c0176e11beed23065a1cd3a"},"schema_version":"1.0"},"canonical_sha256":"afe83a7d0a280c4e9ee46691653bcbb9f269629f061c7b85b897bc5282e9d6a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:53.718267Z","signature_b64":"SgrQtDIVytgxo/Ausd0mbN2CR50seLq/U+WHhBoiofcUy/xFRFfhMblYtHSZQowTW1adgMdvqQo8/Yd0AQnuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afe83a7d0a280c4e9ee46691653bcbb9f269629f061c7b85b897bc5282e9d6a7","last_reissued_at":"2026-06-19T16:10:53.717833Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:53.717833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20330","source_version":5,"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-06-19T16:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOVzJkAWiVsveToqAsmJuo5PFzsZww6wMiLYEhNmYz3TT+ClPKxjFzrMBq3gxM7UymOANKjYVS5Ubr/JXDvcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:05:24.200095Z"},"content_sha256":"1a71bf95f015dd780ac3ef56cea0b3a7f52b599f86aa3821b5f8b9cca5761525","schema_version":"1.0","event_id":"sha256:1a71bf95f015dd780ac3ef56cea0b3a7f52b599f86aa3821b5f8b9cca5761525"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V7UDU7IKFAGE5HXEM2IWKO6LXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FORGE: Foundational Optimization Representations from Graph Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Serdar Kadioglu, Zohair Shafi","submitted_at":"2025-08-28T00:15:57Z","abstract_excerpt":"Combinatorial optimization problems are ubiquitous in science and engineering. Still, learning-based approaches to accelerate combinatorial optimization often require solving a large number of difficult instances to collect training data, incurring significant computational cost. Existing learning-based methods require training dedicated models for each problem distribution, for each downstream task, severely limiting their scalability and generalization. We introduce Forge: Foundational Optimization Representations from Graph Embeddings, a framework that pre-trains a vector-quantized graph au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20330","kind":"arxiv","version":5},"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/2508.20330/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-06-19T16:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkgPcuVJyz9c4rc1zTRsNF6PFX0WX+z6IjHFJG9hQvB7yT0zY6nvoJgM8+qdfttW9WtpE482kl8EAzPbdb9yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:05:24.200470Z"},"content_sha256":"3f0274dec4640ca5c8d86eabcf1d80d5f6c3b4fa91552bf38b6b4ffd14589637","schema_version":"1.0","event_id":"sha256:3f0274dec4640ca5c8d86eabcf1d80d5f6c3b4fa91552bf38b6b4ffd14589637"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/bundle.json","state_url":"https://pith.science/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/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-06-29T17:05:24Z","links":{"resolver":"https://pith.science/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH","bundle":"https://pith.science/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/bundle.json","state":"https://pith.science/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7UDU7IKFAGE5HXEM2IWKO6LXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V7UDU7IKFAGE5HXEM2IWKO6LXH","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":"bf435c888fe01d6a4e5a7cbd11fd3443849a8e310c0176e11beed23065a1cd3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T00:15:57Z","title_canon_sha256":"22b410d466cd04961263953a56fe3253f1cfcff67eb6b3a3017b060061bc9abf"},"schema_version":"1.0","source":{"id":"2508.20330","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20330","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20330v5","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20330","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"V7UDU7IKFAGE","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"V7UDU7IKFAGE5HXE","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"V7UDU7IK","created_at":"2026-06-19T16:10:53Z"}],"graph_snapshots":[{"event_id":"sha256:3f0274dec4640ca5c8d86eabcf1d80d5f6c3b4fa91552bf38b6b4ffd14589637","target":"graph","created_at":"2026-06-19T16:10:53Z","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/2508.20330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization problems are ubiquitous in science and engineering. Still, learning-based approaches to accelerate combinatorial optimization often require solving a large number of difficult instances to collect training data, incurring significant computational cost. Existing learning-based methods require training dedicated models for each problem distribution, for each downstream task, severely limiting their scalability and generalization. We introduce Forge: Foundational Optimization Representations from Graph Embeddings, a framework that pre-trains a vector-quantized graph au","authors_text":"Serdar Kadioglu, Zohair Shafi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T00:15:57Z","title":"FORGE: Foundational Optimization Representations from Graph Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20330","kind":"arxiv","version":5},"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:1a71bf95f015dd780ac3ef56cea0b3a7f52b599f86aa3821b5f8b9cca5761525","target":"record","created_at":"2026-06-19T16:10:53Z","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":"bf435c888fe01d6a4e5a7cbd11fd3443849a8e310c0176e11beed23065a1cd3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T00:15:57Z","title_canon_sha256":"22b410d466cd04961263953a56fe3253f1cfcff67eb6b3a3017b060061bc9abf"},"schema_version":"1.0","source":{"id":"2508.20330","kind":"arxiv","version":5}},"canonical_sha256":"afe83a7d0a280c4e9ee46691653bcbb9f269629f061c7b85b897bc5282e9d6a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afe83a7d0a280c4e9ee46691653bcbb9f269629f061c7b85b897bc5282e9d6a7","first_computed_at":"2026-06-19T16:10:53.717833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:53.717833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgrQtDIVytgxo/Ausd0mbN2CR50seLq/U+WHhBoiofcUy/xFRFfhMblYtHSZQowTW1adgMdvqQo8/Yd0AQnuCQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:53.718267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20330","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a71bf95f015dd780ac3ef56cea0b3a7f52b599f86aa3821b5f8b9cca5761525","sha256:3f0274dec4640ca5c8d86eabcf1d80d5f6c3b4fa91552bf38b6b4ffd14589637"],"state_sha256":"c7eebc48114b1f37d46ff426ba5516757fb5e0c4496d4408bda8b1cc950b6480"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4RM/S4Dbz8WC0aAurYIjVMsVRMUsrbsL/CuHQMVIes2r3Jii50G26Y+gtVxb2f2fsZw0mE4ozy8C8hkDx5NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:05:24.202598Z","bundle_sha256":"312e8ee5a3cac20cd2774da8b11f353e23bfdd7d2d09a6f8a97b3dd80c94b532"}}