{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BA3TMMF3UCWVQTXXXQQF26N7DA","short_pith_number":"pith:BA3TMMF3","canonical_record":{"source":{"id":"1109.3094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-14T14:36:41Z","cross_cats_sorted":[],"title_canon_sha256":"734259973341568b68386cb1e0ae4fe9d0f02ad53d47cd0740fee85e9bce362b","abstract_canon_sha256":"8896a973a3402a0101e839549e44e177039ac5cdbe5a06a58b44e88ce0b33198"},"schema_version":"1.0"},"canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","source":{"kind":"arxiv","id":"1109.3094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3094","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3094v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3094","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"BA3TMMF3UCWV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BA3TMMF3UCWVQTXX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BA3TMMF3","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BA3TMMF3UCWVQTXXXQQF26N7DA","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-14T14:36:41Z","cross_cats_sorted":[],"title_canon_sha256":"734259973341568b68386cb1e0ae4fe9d0f02ad53d47cd0740fee85e9bce362b","abstract_canon_sha256":"8896a973a3402a0101e839549e44e177039ac5cdbe5a06a58b44e88ce0b33198"},"schema_version":"1.0"},"canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:06.302846Z","signature_b64":"on5zWbmDP7cjHm9U8klopfC/LeJw/nx9CYu7Ik3sK9lsHtkA+HaDERXoWnEwAr/FM+gyQf0NqTpbZxCvAgUjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","last_reissued_at":"2026-05-18T04:13:06.302365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:06.302365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3094","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-05-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTU0Ju8DLh+1PIhdfIs71crd1GC3spEWb4e3jd8lgeR4WoyJCYRqThAtVvpRzibAJw98Zsvs8Ib4/TXfwF65Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:21.516829Z"},"content_sha256":"d69e86522f42395bedaa017b7cf6323b7585883ffacfc94ff58913fc8c22d80a","schema_version":"1.0","event_id":"sha256:d69e86522f42395bedaa017b7cf6323b7585883ffacfc94ff58913fc8c22d80a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BA3TMMF3UCWVQTXXXQQF26N7DA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the use of reference points for the biobjective Inventory Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marc Sevaux, Martin Josef Geiger","submitted_at":"2011-09-14T14:36:41Z","abstract_excerpt":"The article presents a study on the biobjective inventory routing problem. Contrary to most previous research, the problem is treated as a true multi-objective optimization problem, with the goal of identifying Pareto-optimal solutions. Due to the hardness of the problem at hand, a reference point based optimization approach is presented and implemented into an optimization and decision support system, which allows for the computation of a true subset of the optimal outcomes. Experimental investigation involving local search metaheuristics are conducted on benchmark data, and numerical results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3094","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":""},"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-05-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIoh00OdA7Cy5VEcezpaOTiVTZ0uh9rInGWQUxSnAcZIzpSREkCHpnlJHOiTtQtX67PMABfimnKjjmhJNAt4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:21.517533Z"},"content_sha256":"54b3026eb74d4217f6dca79cdc7ee77d75a987a2d8161087371fa16066a65c2f","schema_version":"1.0","event_id":"sha256:54b3026eb74d4217f6dca79cdc7ee77d75a987a2d8161087371fa16066a65c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/bundle.json","state_url":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/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-08T19:07:21Z","links":{"resolver":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA","bundle":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/bundle.json","state":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BA3TMMF3UCWVQTXXXQQF26N7DA","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":"8896a973a3402a0101e839549e44e177039ac5cdbe5a06a58b44e88ce0b33198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-14T14:36:41Z","title_canon_sha256":"734259973341568b68386cb1e0ae4fe9d0f02ad53d47cd0740fee85e9bce362b"},"schema_version":"1.0","source":{"id":"1109.3094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3094","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3094v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3094","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"BA3TMMF3UCWV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BA3TMMF3UCWVQTXX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BA3TMMF3","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:54b3026eb74d4217f6dca79cdc7ee77d75a987a2d8161087371fa16066a65c2f","target":"graph","created_at":"2026-05-18T04:13:06Z","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"},"paper":{"abstract_excerpt":"The article presents a study on the biobjective inventory routing problem. Contrary to most previous research, the problem is treated as a true multi-objective optimization problem, with the goal of identifying Pareto-optimal solutions. Due to the hardness of the problem at hand, a reference point based optimization approach is presented and implemented into an optimization and decision support system, which allows for the computation of a true subset of the optimal outcomes. Experimental investigation involving local search metaheuristics are conducted on benchmark data, and numerical results","authors_text":"Marc Sevaux, Martin Josef Geiger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-14T14:36:41Z","title":"On the use of reference points for the biobjective Inventory Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3094","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:d69e86522f42395bedaa017b7cf6323b7585883ffacfc94ff58913fc8c22d80a","target":"record","created_at":"2026-05-18T04:13:06Z","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":"8896a973a3402a0101e839549e44e177039ac5cdbe5a06a58b44e88ce0b33198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-14T14:36:41Z","title_canon_sha256":"734259973341568b68386cb1e0ae4fe9d0f02ad53d47cd0740fee85e9bce362b"},"schema_version":"1.0","source":{"id":"1109.3094","kind":"arxiv","version":1}},"canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","first_computed_at":"2026-05-18T04:13:06.302365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:06.302365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"on5zWbmDP7cjHm9U8klopfC/LeJw/nx9CYu7Ik3sK9lsHtkA+HaDERXoWnEwAr/FM+gyQf0NqTpbZxCvAgUjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:06.302846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d69e86522f42395bedaa017b7cf6323b7585883ffacfc94ff58913fc8c22d80a","sha256:54b3026eb74d4217f6dca79cdc7ee77d75a987a2d8161087371fa16066a65c2f"],"state_sha256":"831483396ab67715d289ab13ea9b5fc89235dcaba43a1b4421678b1b014096f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjR2Fkt0htQKyN8N9YaqBIlYAWSNtsjHCG6uymjIlGYop0g1SFZrT+SqwD2htvFsDdqQP6NJkksCDQJj4VZpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:07:21.521654Z","bundle_sha256":"77f05305c1cb6390f28f02a7a9b146b5305bb0cab67d26e621fb509e865a4fa6"}}