{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HQBN3GYCY5A4ACE5V2WSA4BSIY","short_pith_number":"pith:HQBN3GYC","canonical_record":{"source":{"id":"2405.13509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T10:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"940d15314a27c619f1d78b48fcc69cd55028eeb0cd9eff24346e2c126f2c8245","abstract_canon_sha256":"5d86ea9b77faf5937a332216ab62dd47dc0cd9b8c025c7a2c10737d9e732ad0e"},"schema_version":"1.0"},"canonical_sha256":"3c02dd9b02c741c0089daead2070324600dbea47b24641f7363b8b37e5f7b5d6","source":{"kind":"arxiv","id":"2405.13509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13509","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13509v1","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13509","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"HQBN3GYCY5A4","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"HQBN3GYCY5A4ACE5","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"HQBN3GYC","created_at":"2026-07-05T08:22:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HQBN3GYCY5A4ACE5V2WSA4BSIY","target":"record","payload":{"canonical_record":{"source":{"id":"2405.13509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T10:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"940d15314a27c619f1d78b48fcc69cd55028eeb0cd9eff24346e2c126f2c8245","abstract_canon_sha256":"5d86ea9b77faf5937a332216ab62dd47dc0cd9b8c025c7a2c10737d9e732ad0e"},"schema_version":"1.0"},"canonical_sha256":"3c02dd9b02c741c0089daead2070324600dbea47b24641f7363b8b37e5f7b5d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:03.705414Z","signature_b64":"T9H0Z5DmWaxl/3Ff7tBuuk/RiyCMwZxui/rkXqM32HtYNNFBvAyNsy/srHx+gEdJUl7c9FbMQDBM+c1k4lQFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c02dd9b02c741c0089daead2070324600dbea47b24641f7363b8b37e5f7b5d6","last_reissued_at":"2026-07-05T08:22:03.704925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:03.704925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.13509","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-05T08:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+cIlsg6F/+HNRStg40x4Ht390AUh3ls94+stg+dZVYTF1fOZtK4ROaLTnEB4hCsrgEmZpdRJJLyHk8zZqamDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:41:57.033572Z"},"content_sha256":"d0e58dbd15653709ca1fa5ab3f6818325ffc3701fae6af30b6afc84f32e7ff2e","schema_version":"1.0","event_id":"sha256:d0e58dbd15653709ca1fa5ab3f6818325ffc3701fae6af30b6afc84f32e7ff2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HQBN3GYCY5A4ACE5V2WSA4BSIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn to formulate: A surrogate model framework for generalized assignment problem with routing constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuanhou Gao, Sen Xue","submitted_at":"2024-05-22T10:12:08Z","abstract_excerpt":"The generalized assignment problem with routing constraints, e.g. the vehicle routing problem, has essential practical relevance. This paper focuses on addressing the complexities of the problem by learning a surrogate model with reduced variables and reconstructed constraints. A surrogate model framework is presented with a class of surrogate models and a learning method to acquire parameters. The paper further provides theoretical results regarding the representational power and statistical properties to explore the effectiveness of this framework. Numerical experiments based on two practica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13509","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/2405.13509/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-05T08:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuUtUGU9EYpvVVHKMbcLfzN3i4BehPUDocLDGz2qoItCvCOdV6490wgyOmzGaHHVQp8ICnIOmENINzGtzbDdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:41:57.033945Z"},"content_sha256":"188be544059e6fe50a2f228ec83c3168fe508b3efab38b667ef5176800b72f5a","schema_version":"1.0","event_id":"sha256:188be544059e6fe50a2f228ec83c3168fe508b3efab38b667ef5176800b72f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/bundle.json","state_url":"https://pith.science/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/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-07-07T08:41:57Z","links":{"resolver":"https://pith.science/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY","bundle":"https://pith.science/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/bundle.json","state":"https://pith.science/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQBN3GYCY5A4ACE5V2WSA4BSIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HQBN3GYCY5A4ACE5V2WSA4BSIY","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":"5d86ea9b77faf5937a332216ab62dd47dc0cd9b8c025c7a2c10737d9e732ad0e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T10:12:08Z","title_canon_sha256":"940d15314a27c619f1d78b48fcc69cd55028eeb0cd9eff24346e2c126f2c8245"},"schema_version":"1.0","source":{"id":"2405.13509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13509","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13509v1","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13509","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"HQBN3GYCY5A4","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"HQBN3GYCY5A4ACE5","created_at":"2026-07-05T08:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"HQBN3GYC","created_at":"2026-07-05T08:22:03Z"}],"graph_snapshots":[{"event_id":"sha256:188be544059e6fe50a2f228ec83c3168fe508b3efab38b667ef5176800b72f5a","target":"graph","created_at":"2026-07-05T08:22:03Z","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/2405.13509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The generalized assignment problem with routing constraints, e.g. the vehicle routing problem, has essential practical relevance. This paper focuses on addressing the complexities of the problem by learning a surrogate model with reduced variables and reconstructed constraints. A surrogate model framework is presented with a class of surrogate models and a learning method to acquire parameters. The paper further provides theoretical results regarding the representational power and statistical properties to explore the effectiveness of this framework. Numerical experiments based on two practica","authors_text":"Chuanhou Gao, Sen Xue","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T10:12:08Z","title":"Learn to formulate: A surrogate model framework for generalized assignment problem with routing constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13509","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:d0e58dbd15653709ca1fa5ab3f6818325ffc3701fae6af30b6afc84f32e7ff2e","target":"record","created_at":"2026-07-05T08:22:03Z","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":"5d86ea9b77faf5937a332216ab62dd47dc0cd9b8c025c7a2c10737d9e732ad0e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T10:12:08Z","title_canon_sha256":"940d15314a27c619f1d78b48fcc69cd55028eeb0cd9eff24346e2c126f2c8245"},"schema_version":"1.0","source":{"id":"2405.13509","kind":"arxiv","version":1}},"canonical_sha256":"3c02dd9b02c741c0089daead2070324600dbea47b24641f7363b8b37e5f7b5d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c02dd9b02c741c0089daead2070324600dbea47b24641f7363b8b37e5f7b5d6","first_computed_at":"2026-07-05T08:22:03.704925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:03.704925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9H0Z5DmWaxl/3Ff7tBuuk/RiyCMwZxui/rkXqM32HtYNNFBvAyNsy/srHx+gEdJUl7c9FbMQDBM+c1k4lQFAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:03.705414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.13509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0e58dbd15653709ca1fa5ab3f6818325ffc3701fae6af30b6afc84f32e7ff2e","sha256:188be544059e6fe50a2f228ec83c3168fe508b3efab38b667ef5176800b72f5a"],"state_sha256":"4dececaeffbbe56d1ccab35cdee823e7d2b085b36e876b98befbf705d5ed58b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fC8qegkfr29+YmMWjeE4HgumLUCLXQ4ITvka63vZLsaQeiKS/bnclbqMYMkQmKmc4f4uidAizwte/BO9tvLBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:41:57.035842Z","bundle_sha256":"b2361be5dbb9ea0501f897c401c8d31d1a4e9a1bfa3be2706bd06d0a7ce1542f"}}