{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y3QWL575SDXYD2DAEKXEGRKYAL","short_pith_number":"pith:Y3QWL575","canonical_record":{"source":{"id":"1508.01813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T20:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"88a04e2efb89fac7c67dc3d32c0a997c25fffc022453f29b9a7e4bbe570589d6","abstract_canon_sha256":"1f94b2703292422f4edfc64d9a7700bf1de515a646d840aa608c62d59880fb77"},"schema_version":"1.0"},"canonical_sha256":"c6e165f7fd90ef81e86022ae43455802c0a30f5ad5f500121322c04182706dbd","source":{"kind":"arxiv","id":"1508.01813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01813","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01813v1","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01813","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"Y3QWL575SDXY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y3QWL575SDXYD2DA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y3QWL575","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y3QWL575SDXYD2DAEKXEGRKYAL","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T20:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"88a04e2efb89fac7c67dc3d32c0a997c25fffc022453f29b9a7e4bbe570589d6","abstract_canon_sha256":"1f94b2703292422f4edfc64d9a7700bf1de515a646d840aa608c62d59880fb77"},"schema_version":"1.0"},"canonical_sha256":"c6e165f7fd90ef81e86022ae43455802c0a30f5ad5f500121322c04182706dbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:37.888794Z","signature_b64":"Mhop/29HvzWlILjx8rXsamj6fHPWXdW6QeEgh98Z0e88+wBZGaFjjhIv97mSo6HB3DEDajtd9F+psWR/0obgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e165f7fd90ef81e86022ae43455802c0a30f5ad5f500121322c04182706dbd","last_reissued_at":"2026-05-18T01:35:37.888190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:37.888190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01813","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-18T01:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRnR4pzdlv2zAdd4Z8r9Wkj3nLy9Xqg+E1pdNZDJ3wFinAnD3Ck24XhywFya/1pwkYrcmSJDdS2QgyuRmPN+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:08:46.804606Z"},"content_sha256":"92cf2b0c0b1e2dcdba4312464a46ff293f03158b16cee5d5a30a864bfbcbd066","schema_version":"1.0","event_id":"sha256:92cf2b0c0b1e2dcdba4312464a46ff293f03158b16cee5d5a30a864bfbcbd066"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y3QWL575SDXYD2DAEKXEGRKYAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","submitted_at":"2015-08-07T20:42:18Z","abstract_excerpt":"The generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman. The GMDTSP is an NP-hard problem as it generalizes the MDTSP and has practical applications in design of ring networks, vehicle routing, flexible manufacturing scheduling and postal routing. We present an integer programming formulation for the GMDTSP and valid inequalities to strengthen the linear pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01813","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-18T01:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM0xjU8A5fqwgTHa3Bcq/WSbiiUAerqI6fWTg6LHd1zVu3JCXfYMiiuxL9QJyeSRflU6Ib6bvdb5IlKCEZGaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:08:46.804948Z"},"content_sha256":"92357e88b6c1777bc64b10dc9342dae7ca4723e9a57deab27bf729dd8665a14d","schema_version":"1.0","event_id":"sha256:92357e88b6c1777bc64b10dc9342dae7ca4723e9a57deab27bf729dd8665a14d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/bundle.json","state_url":"https://pith.science/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/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-02T02:08:46Z","links":{"resolver":"https://pith.science/pith/Y3QWL575SDXYD2DAEKXEGRKYAL","bundle":"https://pith.science/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/bundle.json","state":"https://pith.science/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3QWL575SDXYD2DAEKXEGRKYAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y3QWL575SDXYD2DAEKXEGRKYAL","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":"1f94b2703292422f4edfc64d9a7700bf1de515a646d840aa608c62d59880fb77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T20:42:18Z","title_canon_sha256":"88a04e2efb89fac7c67dc3d32c0a997c25fffc022453f29b9a7e4bbe570589d6"},"schema_version":"1.0","source":{"id":"1508.01813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01813","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01813v1","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01813","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"Y3QWL575SDXY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y3QWL575SDXYD2DA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y3QWL575","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:92357e88b6c1777bc64b10dc9342dae7ca4723e9a57deab27bf729dd8665a14d","target":"graph","created_at":"2026-05-18T01:35:37Z","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 generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman. The GMDTSP is an NP-hard problem as it generalizes the MDTSP and has practical applications in design of ring networks, vehicle routing, flexible manufacturing scheduling and postal routing. We present an integer programming formulation for the GMDTSP and valid inequalities to strengthen the linear pro","authors_text":"Kaarthik Sundar, Sivakumar Rathinam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T20:42:18Z","title":"Generalized multiple depot traveling salesmen problem - polyhedral study and exact algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01813","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:92cf2b0c0b1e2dcdba4312464a46ff293f03158b16cee5d5a30a864bfbcbd066","target":"record","created_at":"2026-05-18T01:35:37Z","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":"1f94b2703292422f4edfc64d9a7700bf1de515a646d840aa608c62d59880fb77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T20:42:18Z","title_canon_sha256":"88a04e2efb89fac7c67dc3d32c0a997c25fffc022453f29b9a7e4bbe570589d6"},"schema_version":"1.0","source":{"id":"1508.01813","kind":"arxiv","version":1}},"canonical_sha256":"c6e165f7fd90ef81e86022ae43455802c0a30f5ad5f500121322c04182706dbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6e165f7fd90ef81e86022ae43455802c0a30f5ad5f500121322c04182706dbd","first_computed_at":"2026-05-18T01:35:37.888190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:37.888190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mhop/29HvzWlILjx8rXsamj6fHPWXdW6QeEgh98Z0e88+wBZGaFjjhIv97mSo6HB3DEDajtd9F+psWR/0obgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:37.888794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92cf2b0c0b1e2dcdba4312464a46ff293f03158b16cee5d5a30a864bfbcbd066","sha256:92357e88b6c1777bc64b10dc9342dae7ca4723e9a57deab27bf729dd8665a14d"],"state_sha256":"d15c0b01233356da5195ec6a98f7883ea362c7a7036d2dc49d304ca60dcfc1f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCXJpfoVOeUeHSznHHMmMB78dV+jVcZdXBsv1jp+WnYCdFqVqB0FkGs9T5V4fuVQhvB0s09W7ckoz5kXMsQZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:08:46.806815Z","bundle_sha256":"a8c7a4d4ace572ab3c26c322b7812d97140aa5598b9e8b0bbe27d846086e0691"}}