{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:327EJ3TZXUKWQYZT3RAEMRWXQF","short_pith_number":"pith:327EJ3TZ","schema_version":"1.0","canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","source":{"kind":"arxiv","id":"1809.06113","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonicity in Convex Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"N. Sadagopan, P. Kowsika, V. Divya","submitted_at":"2018-09-17T10:19:33Z","abstract_excerpt":"For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \\cite{muller,garey} that HAMILTONIAN CYCLE (PATH) are NP-complete in general graphs and chordal bipartite graphs. A convex bipartite graph $G$ with bipartition $(X,Y)$ and an ordering $X=(x_1,\\ldots,x_n)$, is a bipartite graph such that for each $y \\in Y$, the neighborhood of $y$ in $X$ appears consecutively. $G$ is said to have convexity with respect to $X$. Further, convex bipartite graphs are a subclass of chordal bipartite graphs. In this paper, we present"},"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":"1809.06113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-17T10:19:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ea1a525e9ab582a9ae65febca7d95d6da78bb633d28f1396dbcc4e22d308e9d7","abstract_canon_sha256":"97f35fdbad9f8b9e819337854765f562d52e078568a2bb29d4e38ff621d5e110"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.604543Z","signature_b64":"3MZmwDFIqVFh+BFcbAVD8XL5XKd/Gjyoy8Z6ha8rPacesSnCjALLcllVeQWsjr3NmkkqfgNIYeTzFcnKfTpdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","last_reissued_at":"2026-05-18T00:05:35.604104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.604104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity in Convex Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"N. Sadagopan, P. Kowsika, V. Divya","submitted_at":"2018-09-17T10:19:33Z","abstract_excerpt":"For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \\cite{muller,garey} that HAMILTONIAN CYCLE (PATH) are NP-complete in general graphs and chordal bipartite graphs. A convex bipartite graph $G$ with bipartition $(X,Y)$ and an ordering $X=(x_1,\\ldots,x_n)$, is a bipartite graph such that for each $y \\in Y$, the neighborhood of $y$ in $X$ appears consecutively. $G$ is said to have convexity with respect to $X$. Further, convex bipartite graphs are a subclass of chordal bipartite graphs. In this paper, we present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06113","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":"1809.06113","created_at":"2026-05-18T00:05:35.604174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06113v1","created_at":"2026-05-18T00:05:35.604174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06113","created_at":"2026-05-18T00:05:35.604174+00:00"},{"alias_kind":"pith_short_12","alias_value":"327EJ3TZXUKW","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"327EJ3TZXUKWQYZT","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"327EJ3TZ","created_at":"2026-05-18T12:32:02.567920+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/327EJ3TZXUKWQYZT3RAEMRWXQF","json":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF.json","graph_json":"https://pith.science/api/pith-number/327EJ3TZXUKWQYZT3RAEMRWXQF/graph.json","events_json":"https://pith.science/api/pith-number/327EJ3TZXUKWQYZT3RAEMRWXQF/events.json","paper":"https://pith.science/paper/327EJ3TZ"},"agent_actions":{"view_html":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF","download_json":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF.json","view_paper":"https://pith.science/paper/327EJ3TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06113&json=true","fetch_graph":"https://pith.science/api/pith-number/327EJ3TZXUKWQYZT3RAEMRWXQF/graph.json","fetch_events":"https://pith.science/api/pith-number/327EJ3TZXUKWQYZT3RAEMRWXQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/action/storage_attestation","attest_author":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/action/author_attestation","sign_citation":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/action/citation_signature","submit_replication":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/action/replication_record"}},"created_at":"2026-05-18T00:05:35.604174+00:00","updated_at":"2026-05-18T00:05:35.604174+00:00"}