{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:327EJ3TZXUKWQYZT3RAEMRWXQF","short_pith_number":"pith:327EJ3TZ","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"},"canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","source":{"kind":"arxiv","id":"1809.06113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06113","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06113v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06113","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"327EJ3TZXUKW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"327EJ3TZXUKWQYZT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"327EJ3TZ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:327EJ3TZXUKWQYZT3RAEMRWXQF","target":"record","payload":{"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"},"canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","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"},"source_kind":"arxiv","source_id":"1809.06113","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-18T00:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9ryNQLC/vRogqw8Cm715Z+8a9AWISJAeibajw5/Ea2yQKtGY847ks8BU331lOxGsL6uf3q6WVIvG+IfyN9VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:32:15.874156Z"},"content_sha256":"de3148927058ac3ed4f7aae8cb8e96ad4fd988a9815753f7cf68e2e7c6bc11aa","schema_version":"1.0","event_id":"sha256:de3148927058ac3ed4f7aae8cb8e96ad4fd988a9815753f7cf68e2e7c6bc11aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:327EJ3TZXUKWQYZT3RAEMRWXQF","target":"graph","payload":{"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"},"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-18T00:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6m3OjmByEr+otl+QEzbglKgbgSWfycVd/7JlciBA/DB9KGVM1j02C61fGtAjyPEsuBj1ry7dG4pC2oUkZ2TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:32:15.874573Z"},"content_sha256":"4dfe3fdcf0ecffa863078c9e781f5ab76696dc52ae14ce653bfc7cf60a1c23a3","schema_version":"1.0","event_id":"sha256:4dfe3fdcf0ecffa863078c9e781f5ab76696dc52ae14ce653bfc7cf60a1c23a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/bundle.json","state_url":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/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-05-30T00:32:15Z","links":{"resolver":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF","bundle":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/bundle.json","state":"https://pith.science/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/327EJ3TZXUKWQYZT3RAEMRWXQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:327EJ3TZXUKWQYZT3RAEMRWXQF","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":"97f35fdbad9f8b9e819337854765f562d52e078568a2bb29d4e38ff621d5e110","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-17T10:19:33Z","title_canon_sha256":"ea1a525e9ab582a9ae65febca7d95d6da78bb633d28f1396dbcc4e22d308e9d7"},"schema_version":"1.0","source":{"id":"1809.06113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06113","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06113v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06113","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"327EJ3TZXUKW","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"327EJ3TZXUKWQYZT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"327EJ3TZ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:4dfe3fdcf0ecffa863078c9e781f5ab76696dc52ae14ce653bfc7cf60a1c23a3","target":"graph","created_at":"2026-05-18T00:05:35Z","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":"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","authors_text":"N. Sadagopan, P. Kowsika, V. Divya","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-17T10:19:33Z","title":"Hamiltonicity in Convex Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06113","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:de3148927058ac3ed4f7aae8cb8e96ad4fd988a9815753f7cf68e2e7c6bc11aa","target":"record","created_at":"2026-05-18T00:05:35Z","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":"97f35fdbad9f8b9e819337854765f562d52e078568a2bb29d4e38ff621d5e110","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-17T10:19:33Z","title_canon_sha256":"ea1a525e9ab582a9ae65febca7d95d6da78bb633d28f1396dbcc4e22d308e9d7"},"schema_version":"1.0","source":{"id":"1809.06113","kind":"arxiv","version":1}},"canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"debe44ee79bd15686333dc404646d7816d7f49601bb1b33252018933fd7d4115","first_computed_at":"2026-05-18T00:05:35.604104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:35.604104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3MZmwDFIqVFh+BFcbAVD8XL5XKd/Gjyoy8Z6ha8rPacesSnCjALLcllVeQWsjr3NmkkqfgNIYeTzFcnKfTpdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:35.604543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de3148927058ac3ed4f7aae8cb8e96ad4fd988a9815753f7cf68e2e7c6bc11aa","sha256:4dfe3fdcf0ecffa863078c9e781f5ab76696dc52ae14ce653bfc7cf60a1c23a3"],"state_sha256":"1b8d950b1100807a2a63a9b1f0ffddbf052d96369b2465493703d281908d9f31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzpIRzNRmWqwJsA3E6GOKoMRrIZZIUtNsWe37olrh50jQHAfeqS82ektEi717DY0WHKRarL918+kHmAGqt73CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:32:15.878479Z","bundle_sha256":"5f2a01e6d46ab1993690d83105b3ab4c14cc478e3881ce0c951f5669013b0d87"}}