{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3ZT44I23DNAPYFKQETO6NYTWSC","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":"4bd6d88a1e576ffad8640ffa9667f80f0045accdbe7a1a5607c4fe64b169c514","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-25T08:54:58Z","title_canon_sha256":"d17bea6bafd33be2840d51fdee7dc1e921ce772ab9a1cc12692e24a6d7db40c6"},"schema_version":"1.0","source":{"id":"1502.07085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07085","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07085v1","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07085","created_at":"2026-05-18T02:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"3ZT44I23DNAP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3ZT44I23DNAPYFKQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3ZT44I23","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a6a8f9721df67712c6199711c0c2f01e780efd2ff9dc22ab6eeb6f8a65017eb6","target":"graph","created_at":"2026-05-18T02:26:11Z","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":"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.","authors_text":"Alireza Bagheri, Asghar Asgharian Sardroud","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-25T08:54:58Z","title":"An approximation algorithm for the longest cycle problem in solid grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07085","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:bd5b8605a45da1e1552b64358e14d43786ba142576ff5a659923f1eb2ce5b8d7","target":"record","created_at":"2026-05-18T02:26:11Z","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":"4bd6d88a1e576ffad8640ffa9667f80f0045accdbe7a1a5607c4fe64b169c514","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-25T08:54:58Z","title_canon_sha256":"d17bea6bafd33be2840d51fdee7dc1e921ce772ab9a1cc12692e24a6d7db40c6"},"schema_version":"1.0","source":{"id":"1502.07085","kind":"arxiv","version":1}},"canonical_sha256":"de67ce235b1b40fc155024dde6e27690b5b9ab0655bf04352b0ad14e8b9d00f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de67ce235b1b40fc155024dde6e27690b5b9ab0655bf04352b0ad14e8b9d00f8","first_computed_at":"2026-05-18T02:26:11.917072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:11.917072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exPDipAW5xZsxcboQDaBRlhIYjZHBDWy0bpFmGFqZpWUKJvSkJWdLRSVwhTMXkUKJvu9Ry2MgAwwMmNENzF3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:11.917748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd5b8605a45da1e1552b64358e14d43786ba142576ff5a659923f1eb2ce5b8d7","sha256:a6a8f9721df67712c6199711c0c2f01e780efd2ff9dc22ab6eeb6f8a65017eb6"],"state_sha256":"f04ba99ea546e504bef748715b92b20649227998340c15c77291123339f14e1e"}