{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SVGMF464NQ7LWVI7OJGWZZEK63","short_pith_number":"pith:SVGMF464","schema_version":"1.0","canonical_sha256":"954cc2f3dc6c3ebb551f724d6ce48af6d3b210a71a9bdfd360af179c3837e252","source":{"kind":"arxiv","id":"1507.04438","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.04438","created_at":"2026-05-18T01:36:47.372183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04438v1","created_at":"2026-05-18T01:36:47.372183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04438","created_at":"2026-05-18T01:36:47.372183+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVGMF464NQ7L","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVGMF464NQ7LWVI7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVGMF464","created_at":"2026-05-18T12:29:42.218222+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/SVGMF464NQ7LWVI7OJGWZZEK63","json":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63.json","graph_json":"https://pith.science/api/pith-number/SVGMF464NQ7LWVI7OJGWZZEK63/graph.json","events_json":"https://pith.science/api/pith-number/SVGMF464NQ7LWVI7OJGWZZEK63/events.json","paper":"https://pith.science/paper/SVGMF464"},"agent_actions":{"view_html":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63","download_json":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63.json","view_paper":"https://pith.science/paper/SVGMF464","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04438&json=true","fetch_graph":"https://pith.science/api/pith-number/SVGMF464NQ7LWVI7OJGWZZEK63/graph.json","fetch_events":"https://pith.science/api/pith-number/SVGMF464NQ7LWVI7OJGWZZEK63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/action/storage_attestation","attest_author":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/action/author_attestation","sign_citation":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/action/citation_signature","submit_replication":"https://pith.science/pith/SVGMF464NQ7LWVI7OJGWZZEK63/action/replication_record"}},"created_at":"2026-05-18T01:36:47.372183+00:00","updated_at":"2026-05-18T01:36:47.372183+00:00"}