{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SVGMF464NQ7LWVI7OJGWZZEK63","short_pith_number":"pith:SVGMF464","canonical_record":{"source":{"id":"1507.04438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T03:00:41Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"f31f55a33221aae93db955cbe70eab331e497276779013326c88338563f24fbd","abstract_canon_sha256":"6f348326b43496815606e4c32f8c129c89e805aeb43bbb40c950d1e77477571b"},"schema_version":"1.0"},"canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","source":{"kind":"arxiv","id":"1507.04438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04438","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04438v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04438","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"SVGMF464NQ7L","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SVGMF464NQ7LWVI7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SVGMF464","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SVGMF464NQ7LWVI7OJGWZZEK63","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T03:00:41Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"f31f55a33221aae93db955cbe70eab331e497276779013326c88338563f24fbd","abstract_canon_sha256":"6f348326b43496815606e4c32f8c129c89e805aeb43bbb40c950d1e77477571b"},"schema_version":"1.0"},"canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.372628Z","signature_b64":"VOYr785J4YIXl9p1T864mM1warpRU3fG+IJhgTCsaVPRzFL/d6UXUrEpviqGtd+8kxSc1tGI2QjIwqYU7enmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","last_reissued_at":"2026-05-18T01:36:47.372101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.372101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04438","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:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKLIQ5JF/NaKQa05vuayHx13PdzUCQFuT5pq64TAd3IMQC0XyKB6RcTEE5iGX2k+1P3a6kGg9AUECAl/MvX4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:46:12.443694Z"},"content_sha256":"a860d7f60c7cd9dcc6ea459b4253dea35437165474a86b83448649640979cd6a","schema_version":"1.0","event_id":"sha256:a860d7f60c7cd9dcc6ea459b4253dea35437165474a86b83448649640979cd6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SVGMF464NQ7LWVI7OJGWZZEK63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Generalized MST and TSP in Grid Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Akbar Rafiey, Ante \\'Custi\\'c, Arash Rafiey, Binay Bhattacharya, Vladyslav Sokol","submitted_at":"2015-07-16T03:00:41Z","abstract_excerpt":"We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each grid cell is $1 \\times 1$. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Similarly, in the TSP version of the problem, the goal is to find a minimum weight cycle containing one point from each non-empty grid cell. We give a $(1+4\\sqrt{2}+\\epsilon)$ and $(1.5+8\\sqrt{2}+\\epsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04438","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:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWlM+AjM9fkslPAEbmxZIovd2fR03ZoNpOWENhKE/Vg9oitfIZNam4z7WwjdnIrrsf1Lt56MsMERZO2OOFjvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:46:12.444035Z"},"content_sha256":"98595d61fd8077f3d9f6431bc92e78149a0b5965885fe901aab477e670e7998e","schema_version":"1.0","event_id":"sha256:98595d61fd8077f3d9f6431bc92e78149a0b5965885fe901aab477e670e7998e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/bundle.json","state_url":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVGMF464NQ7LWVI7OJGWZZEK63/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-09T12:46:12Z","links":{"resolver":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63","bundle":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/bundle.json","state":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVGMF464NQ7LWVI7OJGWZZEK63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SVGMF464NQ7LWVI7OJGWZZEK63","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":"6f348326b43496815606e4c32f8c129c89e805aeb43bbb40c950d1e77477571b","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T03:00:41Z","title_canon_sha256":"f31f55a33221aae93db955cbe70eab331e497276779013326c88338563f24fbd"},"schema_version":"1.0","source":{"id":"1507.04438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04438","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04438v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04438","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"SVGMF464NQ7L","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SVGMF464NQ7LWVI7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SVGMF464","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:98595d61fd8077f3d9f6431bc92e78149a0b5965885fe901aab477e670e7998e","target":"graph","created_at":"2026-05-18T01:36:47Z","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":"We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each grid cell is $1 \\times 1$. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Similarly, in the TSP version of the problem, the goal is to find a minimum weight cycle containing one point from each non-empty grid cell. We give a $(1+4\\sqrt{2}+\\epsilon)$ and $(1.5+8\\sqrt{2}+\\epsi","authors_text":"Akbar Rafiey, Ante \\'Custi\\'c, Arash Rafiey, Binay Bhattacharya, Vladyslav Sokol","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T03:00:41Z","title":"Approximation Algorithms for Generalized MST and TSP in Grid Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04438","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:a860d7f60c7cd9dcc6ea459b4253dea35437165474a86b83448649640979cd6a","target":"record","created_at":"2026-05-18T01:36:47Z","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":"6f348326b43496815606e4c32f8c129c89e805aeb43bbb40c950d1e77477571b","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T03:00:41Z","title_canon_sha256":"f31f55a33221aae93db955cbe70eab331e497276779013326c88338563f24fbd"},"schema_version":"1.0","source":{"id":"1507.04438","kind":"arxiv","version":1}},"canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","first_computed_at":"2026-05-18T01:36:47.372101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:47.372101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VOYr785J4YIXl9p1T864mM1warpRU3fG+IJhgTCsaVPRzFL/d6UXUrEpviqGtd+8kxSc1tGI2QjIwqYU7enmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:47.372628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a860d7f60c7cd9dcc6ea459b4253dea35437165474a86b83448649640979cd6a","sha256:98595d61fd8077f3d9f6431bc92e78149a0b5965885fe901aab477e670e7998e"],"state_sha256":"65046fde335f1151d73590596f843614a26f0020d8b25a6e9c0ce812e290c742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Au4vb2Wu0o2+d9OKhZsFFc7ZP8DiorJspBIN5lhT900VoJhvyY/y+xTlmA0CkgB2jqb11a27gVrjPCrSs75eCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:46:12.446376Z","bundle_sha256":"82d66d157e76b3880476565d4d0392ecdcd26b16b212efce0cd7bd1a278d71c7"}}