{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BA3TMMF3UCWVQTXXXQQF26N7DA","short_pith_number":"pith:BA3TMMF3","schema_version":"1.0","canonical_sha256":"08373630bba0ad584ef7bc205d79bf1806b2b061e5584c46d258252b13303786","source":{"kind":"arxiv","id":"1109.3094","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3094","created_at":"2026-05-18T04:13:06.302421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3094v1","created_at":"2026-05-18T04:13:06.302421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3094","created_at":"2026-05-18T04:13:06.302421+00:00"},{"alias_kind":"pith_short_12","alias_value":"BA3TMMF3UCWV","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BA3TMMF3UCWVQTXX","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BA3TMMF3","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA","json":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA.json","graph_json":"https://pith.science/api/pith-number/BA3TMMF3UCWVQTXXXQQF26N7DA/graph.json","events_json":"https://pith.science/api/pith-number/BA3TMMF3UCWVQTXXXQQF26N7DA/events.json","paper":"https://pith.science/paper/BA3TMMF3"},"agent_actions":{"view_html":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA","download_json":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA.json","view_paper":"https://pith.science/paper/BA3TMMF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3094&json=true","fetch_graph":"https://pith.science/api/pith-number/BA3TMMF3UCWVQTXXXQQF26N7DA/graph.json","fetch_events":"https://pith.science/api/pith-number/BA3TMMF3UCWVQTXXXQQF26N7DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/action/storage_attestation","attest_author":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/action/author_attestation","sign_citation":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/action/citation_signature","submit_replication":"https://pith.science/pith/BA3TMMF3UCWVQTXXXQQF26N7DA/action/replication_record"}},"created_at":"2026-05-18T04:13:06.302421+00:00","updated_at":"2026-05-18T04:13:06.302421+00:00"}