{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JZRBCRURQZQJGHFFUE26RFOV7C","short_pith_number":"pith:JZRBCRUR","schema_version":"1.0","canonical_sha256":"4e621146918660931ca5a135e895d5f8834f2a78fed09f4a9967899193592ae1","source":{"kind":"arxiv","id":"1806.09651","version":2},"attestation_state":"computed","paper":{"title":"Even cycles in dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Jangwon Yie, Neal Bushaw","submitted_at":"2018-06-25T18:22:24Z","abstract_excerpt":"We will show that for $\\alpha>0$ there is $n_0$ such that if $G$ is a graph on $n\\geq n_0$ vertices such that $\\alpha n< \\delta(G)< (n-1)/2$, then for every $n_1+n_2+\\cdots +n_l= \\delta(G)$, $G$ contains a disjoint union of $C_{2n_1},C_{2n_2}, \\dots, C_{2n_l}$ unless $G$ has a very specific structure."},"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":"1806.09651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-25T18:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"11c21c5250180961e508cb646ae417e430ef14694953aae9b4b7c39942ec6e6a","abstract_canon_sha256":"8eb9d9d132ed56a999f97ef7657869a9209dd5b27f5b77b5faf50f6d5b4865ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.356680Z","signature_b64":"GRo1lgJVykc2db60S0thypNH2CTdPkNxbcqjqINY1ZCK1dQSXqlgdgz4tv8iU7x7i5MQXdzhhaMoomNv0dqoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e621146918660931ca5a135e895d5f8834f2a78fed09f4a9967899193592ae1","last_reissued_at":"2026-05-18T00:10:44.356118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.356118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even cycles in dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Jangwon Yie, Neal Bushaw","submitted_at":"2018-06-25T18:22:24Z","abstract_excerpt":"We will show that for $\\alpha>0$ there is $n_0$ such that if $G$ is a graph on $n\\geq n_0$ vertices such that $\\alpha n< \\delta(G)< (n-1)/2$, then for every $n_1+n_2+\\cdots +n_l= \\delta(G)$, $G$ contains a disjoint union of $C_{2n_1},C_{2n_2}, \\dots, C_{2n_l}$ unless $G$ has a very specific structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09651","kind":"arxiv","version":2},"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":"1806.09651","created_at":"2026-05-18T00:10:44.356192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09651v2","created_at":"2026-05-18T00:10:44.356192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09651","created_at":"2026-05-18T00:10:44.356192+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZRBCRURQZQJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZRBCRURQZQJGHFF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZRBCRUR","created_at":"2026-05-18T12:32:33.847187+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/JZRBCRURQZQJGHFFUE26RFOV7C","json":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C.json","graph_json":"https://pith.science/api/pith-number/JZRBCRURQZQJGHFFUE26RFOV7C/graph.json","events_json":"https://pith.science/api/pith-number/JZRBCRURQZQJGHFFUE26RFOV7C/events.json","paper":"https://pith.science/paper/JZRBCRUR"},"agent_actions":{"view_html":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C","download_json":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C.json","view_paper":"https://pith.science/paper/JZRBCRUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09651&json=true","fetch_graph":"https://pith.science/api/pith-number/JZRBCRURQZQJGHFFUE26RFOV7C/graph.json","fetch_events":"https://pith.science/api/pith-number/JZRBCRURQZQJGHFFUE26RFOV7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C/action/storage_attestation","attest_author":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C/action/author_attestation","sign_citation":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C/action/citation_signature","submit_replication":"https://pith.science/pith/JZRBCRURQZQJGHFFUE26RFOV7C/action/replication_record"}},"created_at":"2026-05-18T00:10:44.356192+00:00","updated_at":"2026-05-18T00:10:44.356192+00:00"}