{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VYGZVWRD6LJLD5YBLEMVWFCMAK","short_pith_number":"pith:VYGZVWRD","schema_version":"1.0","canonical_sha256":"ae0d9ada23f2d2b1f70159195b144c02b89ccf6daf4f04e3eb14d774b11864f5","source":{"kind":"arxiv","id":"1207.4628","version":1},"attestation_state":"computed","paper":{"title":"On the Effect of Connectedness for Biobjective Multiple and Long Path Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Arnaud Liefooghe (INRIA Lille - Nord Europe, Clarisse Dhaenens (INRIA Lille - Nord Europe, J\\'er\\'emie Humeau (INRIA Lille - Nord Europe), Laetitia Jourdan (INRIA Lille - Nord Europe, LIFL), S\\'ebastien Verel (INRIA Lille - Nord Europe)","submitted_at":"2012-07-19T12:06:40Z","abstract_excerpt":"Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization (MOCO). Indeed, when connectedness holds, a basic Pareto local search, initialized with at least one non-dominated solution, allows to identify the efficient set exhaustively. However, this becomes quickly infeasible in practice as the number of efficient solutions typically grows exponentially with the instance size. As a consequence, we generally have to deal with a limited-size approximation, where a good sample set has t"},"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":"1207.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-19T12:06:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fa1f9cffc6862fe309a9522f2430e724edf80acf5207eb50f67d4cd8d84cefc4","abstract_canon_sha256":"8e53707746717dafad943777ace6b7fee21174171709cb2ba5fa35d0ee1b3165"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.383944Z","signature_b64":"ns5SuNepNfWASEEUw8CihCXnPAHyPV9/oiQAeG4tGapqzEIjF+tWBWcKnL/RVkKt7Rega049cFpgOYOZ8SzTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0d9ada23f2d2b1f70159195b144c02b89ccf6daf4f04e3eb14d774b11864f5","last_reissued_at":"2026-05-18T03:50:36.383464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.383464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Effect of Connectedness for Biobjective Multiple and Long Path Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Arnaud Liefooghe (INRIA Lille - Nord Europe, Clarisse Dhaenens (INRIA Lille - Nord Europe, J\\'er\\'emie Humeau (INRIA Lille - Nord Europe), Laetitia Jourdan (INRIA Lille - Nord Europe, LIFL), S\\'ebastien Verel (INRIA Lille - Nord Europe)","submitted_at":"2012-07-19T12:06:40Z","abstract_excerpt":"Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization (MOCO). Indeed, when connectedness holds, a basic Pareto local search, initialized with at least one non-dominated solution, allows to identify the efficient set exhaustively. However, this becomes quickly infeasible in practice as the number of efficient solutions typically grows exponentially with the instance size. As a consequence, we generally have to deal with a limited-size approximation, where a good sample set has t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4628","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":"1207.4628","created_at":"2026-05-18T03:50:36.383531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4628v1","created_at":"2026-05-18T03:50:36.383531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4628","created_at":"2026-05-18T03:50:36.383531+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYGZVWRD6LJL","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYGZVWRD6LJLD5YB","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYGZVWRD","created_at":"2026-05-18T12:27:25.539911+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/VYGZVWRD6LJLD5YBLEMVWFCMAK","json":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK.json","graph_json":"https://pith.science/api/pith-number/VYGZVWRD6LJLD5YBLEMVWFCMAK/graph.json","events_json":"https://pith.science/api/pith-number/VYGZVWRD6LJLD5YBLEMVWFCMAK/events.json","paper":"https://pith.science/paper/VYGZVWRD"},"agent_actions":{"view_html":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK","download_json":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK.json","view_paper":"https://pith.science/paper/VYGZVWRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4628&json=true","fetch_graph":"https://pith.science/api/pith-number/VYGZVWRD6LJLD5YBLEMVWFCMAK/graph.json","fetch_events":"https://pith.science/api/pith-number/VYGZVWRD6LJLD5YBLEMVWFCMAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK/action/storage_attestation","attest_author":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK/action/author_attestation","sign_citation":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK/action/citation_signature","submit_replication":"https://pith.science/pith/VYGZVWRD6LJLD5YBLEMVWFCMAK/action/replication_record"}},"created_at":"2026-05-18T03:50:36.383531+00:00","updated_at":"2026-05-18T03:50:36.383531+00:00"}