{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:GGZNECH5C7OB7K7W75NYGMSKH3","short_pith_number":"pith:GGZNECH5","canonical_record":{"source":{"id":"0910.1238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-07T12:36:40Z","cross_cats_sorted":[],"title_canon_sha256":"1fca6d931f3c8e59233edf603e595d9fdaa941924d824bff9108780d3d903f5c","abstract_canon_sha256":"6577f478a9ad1e2333d7b64d924196b7d33738dfe126bc7839b0e7a7b3332c15"},"schema_version":"1.0"},"canonical_sha256":"31b2d208fd17dc1fabf6ff5b83324a3ec17cd2964ed4bd3fedd14dbcc1eed123","source":{"kind":"arxiv","id":"0910.1238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.1238","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"0910.1238v1","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1238","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"GGZNECH5C7OB","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"GGZNECH5C7OB7K7W","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"GGZNECH5","created_at":"2026-07-04T15:53:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:GGZNECH5C7OB7K7W75NYGMSKH3","target":"record","payload":{"canonical_record":{"source":{"id":"0910.1238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-07T12:36:40Z","cross_cats_sorted":[],"title_canon_sha256":"1fca6d931f3c8e59233edf603e595d9fdaa941924d824bff9108780d3d903f5c","abstract_canon_sha256":"6577f478a9ad1e2333d7b64d924196b7d33738dfe126bc7839b0e7a7b3332c15"},"schema_version":"1.0"},"canonical_sha256":"31b2d208fd17dc1fabf6ff5b83324a3ec17cd2964ed4bd3fedd14dbcc1eed123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:53:57.650204Z","signature_b64":"oACnEjR+knBnzFP9/19xJZwwo48asjLNVPx8orvJ7KDeZNEspgOp+k/ND6IBgs93Rgg4rI6CsEl7r7jQHCQkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31b2d208fd17dc1fabf6ff5b83324a3ec17cd2964ed4bd3fedd14dbcc1eed123","last_reissued_at":"2026-07-04T15:53:57.649865Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:53:57.649865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.1238","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-04T15:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcgTO+ZA7R5lk1zPoVxUimYKAyBpSo4BQwFVwF386arS7dFWBOSoKcDpSbiL7RZbBG+65CIg9OlJRjS3A64NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:03:06.889373Z"},"content_sha256":"c9e4aeb3d5059e3605207d7b3bd1fa8d605691d6e4bbe0babdd74587312db599","schema_version":"1.0","event_id":"sha256:c9e4aeb3d5059e3605207d7b3bd1fa8d605691d6e4bbe0babdd74587312db599"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:GGZNECH5C7OB7K7W75NYGMSKH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pascal Van Hentenryck, Quang Dung Pham, Yves Deville","submitted_at":"2009-10-07T12:36:40Z","abstract_excerpt":"Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1238","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/0910.1238/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-04T15:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5T2o4bLGCLRZk4pje35iTCwk9sPj3Le/CjNUOz86rHF1XPLBK0pkqd9dD5llZhHHVhB3QW2bE5ZRIP2o9nkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:03:06.890486Z"},"content_sha256":"426285a1b7d2356a64666d82a29086519019b703c3c464bfdc438df5007ab384","schema_version":"1.0","event_id":"sha256:426285a1b7d2356a64666d82a29086519019b703c3c464bfdc438df5007ab384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGZNECH5C7OB7K7W75NYGMSKH3/bundle.json","state_url":"https://pith.science/pith/GGZNECH5C7OB7K7W75NYGMSKH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGZNECH5C7OB7K7W75NYGMSKH3/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-08-11T04:03:06Z","links":{"resolver":"https://pith.science/pith/GGZNECH5C7OB7K7W75NYGMSKH3","bundle":"https://pith.science/pith/GGZNECH5C7OB7K7W75NYGMSKH3/bundle.json","state":"https://pith.science/pith/GGZNECH5C7OB7K7W75NYGMSKH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGZNECH5C7OB7K7W75NYGMSKH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GGZNECH5C7OB7K7W75NYGMSKH3","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":"6577f478a9ad1e2333d7b64d924196b7d33738dfe126bc7839b0e7a7b3332c15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-07T12:36:40Z","title_canon_sha256":"1fca6d931f3c8e59233edf603e595d9fdaa941924d824bff9108780d3d903f5c"},"schema_version":"1.0","source":{"id":"0910.1238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.1238","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"0910.1238v1","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1238","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"GGZNECH5C7OB","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"GGZNECH5C7OB7K7W","created_at":"2026-07-04T15:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"GGZNECH5","created_at":"2026-07-04T15:53:57Z"}],"graph_snapshots":[{"event_id":"sha256:426285a1b7d2356a64666d82a29086519019b703c3c464bfdc438df5007ab384","target":"graph","created_at":"2026-07-04T15:53:57Z","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/0910.1238/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computatio","authors_text":"Pascal Van Hentenryck, Quang Dung Pham, Yves Deville","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-07T12:36:40Z","title":"A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1238","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:c9e4aeb3d5059e3605207d7b3bd1fa8d605691d6e4bbe0babdd74587312db599","target":"record","created_at":"2026-07-04T15:53:57Z","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":"6577f478a9ad1e2333d7b64d924196b7d33738dfe126bc7839b0e7a7b3332c15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-07T12:36:40Z","title_canon_sha256":"1fca6d931f3c8e59233edf603e595d9fdaa941924d824bff9108780d3d903f5c"},"schema_version":"1.0","source":{"id":"0910.1238","kind":"arxiv","version":1}},"canonical_sha256":"31b2d208fd17dc1fabf6ff5b83324a3ec17cd2964ed4bd3fedd14dbcc1eed123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31b2d208fd17dc1fabf6ff5b83324a3ec17cd2964ed4bd3fedd14dbcc1eed123","first_computed_at":"2026-07-04T15:53:57.649865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:53:57.649865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oACnEjR+knBnzFP9/19xJZwwo48asjLNVPx8orvJ7KDeZNEspgOp+k/ND6IBgs93Rgg4rI6CsEl7r7jQHCQkCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:53:57.650204Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.1238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e4aeb3d5059e3605207d7b3bd1fa8d605691d6e4bbe0babdd74587312db599","sha256:426285a1b7d2356a64666d82a29086519019b703c3c464bfdc438df5007ab384"],"state_sha256":"2425fa1ee661fa1004c430e5a6f922b903582430497feebccab681827b580cd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ht8MZfnG3X7TKYpgsnYJvHh7zYeY+ycyuMgaGVThJWdelWRXWUYIlELgoiQlXmUobaHX7OBeio7sZb/2GNT3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:03:06.898336Z","bundle_sha256":"42c85c9837b7858c7de4e812c12df099697e912a1645f4f13bb002453823f679"}}