{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CEZ4YM4T6OANPFNOQEYWE5NF6V","short_pith_number":"pith:CEZ4YM4T","schema_version":"1.0","canonical_sha256":"1133cc3393f380d795ae81316275a5f5436305b028be92be34d864583629f93c","source":{"kind":"arxiv","id":"1502.02933","version":1},"attestation_state":"computed","paper":{"title":"Dominating cycles and forbidden pairs containing a path of order 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michitaka Furuya, Shoichi Tsuchiya, Shuya Chiba","submitted_at":"2015-02-10T15:06:32Z","abstract_excerpt":"A cycle is a graph is dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate the characterization of the class of the forbidden pairs guaranteeing the existence of a dominating cycle and show the following two results: (i) Every $2$-connected $\\{P_{5}, K_{4}^{-}\\}$-free graph contains a longest cycle which is a dominating cycle. (ii) Every $2$-connected $\\{P_{5}, W^{*}\\}$-free graph contains a longest cycle which is a dominating cycle. Here $P_{5}$ is the path of order $5$, $K_{4}^{-}$ is the graph obtained from the complete graph of order $"},"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.02933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T15:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"2608142c4a7dde66437f27beeff374ab8988cd7fa66e5efe859936ccfec4b04e","abstract_canon_sha256":"ed966a857eede2ca5b2655a9d39358031687043a6677e1ea2ff9498319703350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.360994Z","signature_b64":"ozxzz438E2KRB62ymAGBhCwYY9svHc5DAZ37EY9fWGcEELsVbGItCPIz9+UmJ4P6ut083TIfOR4f5gINBwkPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1133cc3393f380d795ae81316275a5f5436305b028be92be34d864583629f93c","last_reissued_at":"2026-05-18T02:27:30.360372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.360372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating cycles and forbidden pairs containing a path of order 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michitaka Furuya, Shoichi Tsuchiya, Shuya Chiba","submitted_at":"2015-02-10T15:06:32Z","abstract_excerpt":"A cycle is a graph is dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate the characterization of the class of the forbidden pairs guaranteeing the existence of a dominating cycle and show the following two results: (i) Every $2$-connected $\\{P_{5}, K_{4}^{-}\\}$-free graph contains a longest cycle which is a dominating cycle. (ii) Every $2$-connected $\\{P_{5}, W^{*}\\}$-free graph contains a longest cycle which is a dominating cycle. Here $P_{5}$ is the path of order $5$, $K_{4}^{-}$ is the graph obtained from the complete graph of order $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02933","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.02933","created_at":"2026-05-18T02:27:30.360462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02933v1","created_at":"2026-05-18T02:27:30.360462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02933","created_at":"2026-05-18T02:27:30.360462+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEZ4YM4T6OAN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEZ4YM4T6OANPFNO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEZ4YM4T","created_at":"2026-05-18T12:29:14.074870+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/CEZ4YM4T6OANPFNOQEYWE5NF6V","json":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V.json","graph_json":"https://pith.science/api/pith-number/CEZ4YM4T6OANPFNOQEYWE5NF6V/graph.json","events_json":"https://pith.science/api/pith-number/CEZ4YM4T6OANPFNOQEYWE5NF6V/events.json","paper":"https://pith.science/paper/CEZ4YM4T"},"agent_actions":{"view_html":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V","download_json":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V.json","view_paper":"https://pith.science/paper/CEZ4YM4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02933&json=true","fetch_graph":"https://pith.science/api/pith-number/CEZ4YM4T6OANPFNOQEYWE5NF6V/graph.json","fetch_events":"https://pith.science/api/pith-number/CEZ4YM4T6OANPFNOQEYWE5NF6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V/action/storage_attestation","attest_author":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V/action/author_attestation","sign_citation":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V/action/citation_signature","submit_replication":"https://pith.science/pith/CEZ4YM4T6OANPFNOQEYWE5NF6V/action/replication_record"}},"created_at":"2026-05-18T02:27:30.360462+00:00","updated_at":"2026-05-18T02:27:30.360462+00:00"}