{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3ZT44I23DNAPYFKQETO6NYTWSC","short_pith_number":"pith:3ZT44I23","schema_version":"1.0","canonical_sha256":"de67ce235b1b40fc155024dde6e27690b5b9ab0655bf04352b0ad14e8b9d00f8","source":{"kind":"arxiv","id":"1502.07085","version":1},"attestation_state":"computed","paper":{"title":"An approximation algorithm for the longest cycle problem in solid grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Asghar Asgharian Sardroud","submitted_at":"2015-02-25T08:54:58Z","abstract_excerpt":"Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by presenting a linear-time constant-factor approximation algorithm, we show that the longest cycle problem in solid grid graphs is in APX. More precisely, our algorithm finds a cycle of length at least $\\frac{2n}{3}+1$ in 2-connected $n$-node solid grid graphs.\n  Keywords: Longest cycle, Hamiltonian cycle, Approximation algorithm, Solid grid graph."},"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":"1502.07085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-25T08:54:58Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d17bea6bafd33be2840d51fdee7dc1e921ce772ab9a1cc12692e24a6d7db40c6","abstract_canon_sha256":"4bd6d88a1e576ffad8640ffa9667f80f0045accdbe7a1a5607c4fe64b169c514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:11.917748Z","signature_b64":"exPDipAW5xZsxcboQDaBRlhIYjZHBDWy0bpFmGFqZpWUKJvSkJWdLRSVwhTMXkUKJvu9Ry2MgAwwMmNENzF3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de67ce235b1b40fc155024dde6e27690b5b9ab0655bf04352b0ad14e8b9d00f8","last_reissued_at":"2026-05-18T02:26:11.917072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:11.917072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximation algorithm for the longest cycle problem in solid grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Asghar Asgharian Sardroud","submitted_at":"2015-02-25T08:54:58Z","abstract_excerpt":"Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by presenting a linear-time constant-factor approximation algorithm, we show that the longest cycle problem in solid grid graphs is in APX. More precisely, our algorithm finds a cycle of length at least $\\frac{2n}{3}+1$ in 2-connected $n$-node solid grid graphs.\n  Keywords: Longest cycle, Hamiltonian cycle, Approximation algorithm, Solid grid graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07085","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":"1502.07085","created_at":"2026-05-18T02:26:11.917186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07085v1","created_at":"2026-05-18T02:26:11.917186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07085","created_at":"2026-05-18T02:26:11.917186+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZT44I23DNAP","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZT44I23DNAPYFKQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZT44I23","created_at":"2026-05-18T12:29:02.477457+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/3ZT44I23DNAPYFKQETO6NYTWSC","json":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC.json","graph_json":"https://pith.science/api/pith-number/3ZT44I23DNAPYFKQETO6NYTWSC/graph.json","events_json":"https://pith.science/api/pith-number/3ZT44I23DNAPYFKQETO6NYTWSC/events.json","paper":"https://pith.science/paper/3ZT44I23"},"agent_actions":{"view_html":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC","download_json":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC.json","view_paper":"https://pith.science/paper/3ZT44I23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07085&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZT44I23DNAPYFKQETO6NYTWSC/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZT44I23DNAPYFKQETO6NYTWSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC/action/storage_attestation","attest_author":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC/action/author_attestation","sign_citation":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC/action/citation_signature","submit_replication":"https://pith.science/pith/3ZT44I23DNAPYFKQETO6NYTWSC/action/replication_record"}},"created_at":"2026-05-18T02:26:11.917186+00:00","updated_at":"2026-05-18T02:26:11.917186+00:00"}