{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H4BFTJTDUWLCTBG3PENZRE2WJ2","short_pith_number":"pith:H4BFTJTD","schema_version":"1.0","canonical_sha256":"3f0259a663a5962984db791b9893564ea4f284aa026c028d5835d5080110e8d5","source":{"kind":"arxiv","id":"1512.02443","version":1},"attestation_state":"computed","paper":{"title":"Even and Odd Cycles Passing a Given Edge or a Vertex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Khashayar Etemadi, Mehrdad Ghadiri, Peyman Ezzati, Saieed Akbari","submitted_at":"2015-12-08T12:59:12Z","abstract_excerpt":"In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in $2$-connected or $2$-edge connected graphs. We provide some similar conditions for the existence of an odd or even circuit that passing a given vertex or an edge in 2-edge connected graphs. We show that if $G$ is a $2$-connected $k$-regular graph, $k \\geq 3$, then every edge of $G$ is contained in an even cycle. We also prove that in a $2$-edge connected graph, if a vertex has odd degree, then there is an even cycle containing this vertex."},"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":"1512.02443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-08T12:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"b22f268fb9bf975080eaaa2b4f04e97e68d78a651731166801b77f2b3a47af03","abstract_canon_sha256":"1db2956690ed98310233b1dee3712d0ceca3cfdbc9f7cf42e59cbd4b30511c5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.682046Z","signature_b64":"OodgF6VyCxjsrM7YCDCK8W3DeHZZl6MwBrhYxKgVjQ3f5x+vslggBwBRfGPoJ+YEzoMxJLcPxQZmMy26pXfIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f0259a663a5962984db791b9893564ea4f284aa026c028d5835d5080110e8d5","last_reissued_at":"2026-05-18T01:24:44.681377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.681377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even and Odd Cycles Passing a Given Edge or a Vertex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Khashayar Etemadi, Mehrdad Ghadiri, Peyman Ezzati, Saieed Akbari","submitted_at":"2015-12-08T12:59:12Z","abstract_excerpt":"In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in $2$-connected or $2$-edge connected graphs. We provide some similar conditions for the existence of an odd or even circuit that passing a given vertex or an edge in 2-edge connected graphs. We show that if $G$ is a $2$-connected $k$-regular graph, $k \\geq 3$, then every edge of $G$ is contained in an even cycle. We also prove that in a $2$-edge connected graph, if a vertex has odd degree, then there is an even cycle containing this vertex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02443","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":"1512.02443","created_at":"2026-05-18T01:24:44.681483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02443v1","created_at":"2026-05-18T01:24:44.681483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02443","created_at":"2026-05-18T01:24:44.681483+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4BFTJTDUWLC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4BFTJTDUWLCTBG3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4BFTJTD","created_at":"2026-05-18T12:29:22.688609+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/H4BFTJTDUWLCTBG3PENZRE2WJ2","json":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2.json","graph_json":"https://pith.science/api/pith-number/H4BFTJTDUWLCTBG3PENZRE2WJ2/graph.json","events_json":"https://pith.science/api/pith-number/H4BFTJTDUWLCTBG3PENZRE2WJ2/events.json","paper":"https://pith.science/paper/H4BFTJTD"},"agent_actions":{"view_html":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2","download_json":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2.json","view_paper":"https://pith.science/paper/H4BFTJTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02443&json=true","fetch_graph":"https://pith.science/api/pith-number/H4BFTJTDUWLCTBG3PENZRE2WJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/H4BFTJTDUWLCTBG3PENZRE2WJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2/action/storage_attestation","attest_author":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2/action/author_attestation","sign_citation":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2/action/citation_signature","submit_replication":"https://pith.science/pith/H4BFTJTDUWLCTBG3PENZRE2WJ2/action/replication_record"}},"created_at":"2026-05-18T01:24:44.681483+00:00","updated_at":"2026-05-18T01:24:44.681483+00:00"}