{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VVTCCA2LT6AJNVB5YG767SHHED","short_pith_number":"pith:VVTCCA2L","schema_version":"1.0","canonical_sha256":"ad6621034b9f8096d43dc1bfefc8e720dfc3f217307bda3a59633d9e68bdcb9c","source":{"kind":"arxiv","id":"2504.08401","version":2},"attestation_state":"computed","paper":{"title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdo Abouelrous, Adriana F. Gabor, Laurens Bliek, Yaoxin Wu, Yingqian Zhang","submitted_at":"2025-04-11T10:08:38Z","abstract_excerpt":"Column Generation (CG) is a popular method dedicated to enhancing computational efficiency in large scale Combinatorial Optimization (CO) problems. It reduces the number of decision variables in a problem by solving a pricing problem. For many CO problems, the pricing problem is an Elementary Shortest Path Problem with Resource Constraints (ESPPRC). Large ESPPRC instances are difficult to solve to near-optimality. Consequently, we use a Graph neural Network (GNN) to reduces the size of the ESPPRC such that it becomes computationally tractable with standard solving techniques. Our GNN is traine"},"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":"2504.08401","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-11T10:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"25f44614be2e35ad865d92c865aaf48b780aa237ecc8f97578d7e6650a0c7c04","abstract_canon_sha256":"42586ab08b06512f318086c6672f115a7c0e3c190db3a733c79c89afcd95f4e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:12.879298Z","signature_b64":"+liJay7sYlQHXnZmJ27IdewmLheMXAwxLEygb4+IS+G6WlQk3k7FxDy50NxWF82oskSnP5hWtaN+e1urPpinBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad6621034b9f8096d43dc1bfefc8e720dfc3f217307bda3a59633d9e68bdcb9c","last_reissued_at":"2026-07-05T10:50:12.878798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:12.878798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdo Abouelrous, Adriana F. Gabor, Laurens Bliek, Yaoxin Wu, Yingqian Zhang","submitted_at":"2025-04-11T10:08:38Z","abstract_excerpt":"Column Generation (CG) is a popular method dedicated to enhancing computational efficiency in large scale Combinatorial Optimization (CO) problems. It reduces the number of decision variables in a problem by solving a pricing problem. For many CO problems, the pricing problem is an Elementary Shortest Path Problem with Resource Constraints (ESPPRC). Large ESPPRC instances are difficult to solve to near-optimality. Consequently, we use a Graph neural Network (GNN) to reduces the size of the ESPPRC such that it becomes computationally tractable with standard solving techniques. Our GNN is traine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08401","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/2504.08401/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":"2504.08401","created_at":"2026-07-05T10:50:12.878858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.08401v2","created_at":"2026-07-05T10:50:12.878858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08401","created_at":"2026-07-05T10:50:12.878858+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVTCCA2LT6AJ","created_at":"2026-07-05T10:50:12.878858+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVTCCA2LT6AJNVB5","created_at":"2026-07-05T10:50:12.878858+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVTCCA2L","created_at":"2026-07-05T10:50:12.878858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.01557","citing_title":"Unsupervised Learning for the Elementary Shortest Path Problem","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED","json":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED.json","graph_json":"https://pith.science/api/pith-number/VVTCCA2LT6AJNVB5YG767SHHED/graph.json","events_json":"https://pith.science/api/pith-number/VVTCCA2LT6AJNVB5YG767SHHED/events.json","paper":"https://pith.science/paper/VVTCCA2L"},"agent_actions":{"view_html":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED","download_json":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED.json","view_paper":"https://pith.science/paper/VVTCCA2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.08401&json=true","fetch_graph":"https://pith.science/api/pith-number/VVTCCA2LT6AJNVB5YG767SHHED/graph.json","fetch_events":"https://pith.science/api/pith-number/VVTCCA2LT6AJNVB5YG767SHHED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED/action/storage_attestation","attest_author":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED/action/author_attestation","sign_citation":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED/action/citation_signature","submit_replication":"https://pith.science/pith/VVTCCA2LT6AJNVB5YG767SHHED/action/replication_record"}},"created_at":"2026-07-05T10:50:12.878858+00:00","updated_at":"2026-07-05T10:50:12.878858+00:00"}