{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7YR6JHP3Z66T5N42GP6MTO4NNM","short_pith_number":"pith:7YR6JHP3","canonical_record":{"source":{"id":"1808.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T05:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"f2305b1b1cacde4c99e9806c7c44aef7d84f71c061df015be7ad226b9939dc47","abstract_canon_sha256":"98ab056dced71bcb08518e7c578db78a87df505ad62a2f7d249be630b81537a0"},"schema_version":"1.0"},"canonical_sha256":"fe23e49dfbcfbd3eb79a33fcc9bb8d6b232f21b64c49c9e4d6eda3f9bd0b63a2","source":{"kind":"arxiv","id":"1808.03893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03893","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03893v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03893","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"7YR6JHP3Z66T","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7YR6JHP3Z66T5N42","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7YR6JHP3","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7YR6JHP3Z66T5N42GP6MTO4NNM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T05:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"f2305b1b1cacde4c99e9806c7c44aef7d84f71c061df015be7ad226b9939dc47","abstract_canon_sha256":"98ab056dced71bcb08518e7c578db78a87df505ad62a2f7d249be630b81537a0"},"schema_version":"1.0"},"canonical_sha256":"fe23e49dfbcfbd3eb79a33fcc9bb8d6b232f21b64c49c9e4d6eda3f9bd0b63a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.402047Z","signature_b64":"PkRUyoS5/HMvxnxQ+PsDqUfk2CXzX7EErIc7Kug3siSctqRofvngmi5VwNHxiAXqo4AQ7PlWrRMfd+uwpjeMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe23e49dfbcfbd3eb79a33fcc9bb8d6b232f21b64c49c9e4d6eda3f9bd0b63a2","last_reissued_at":"2026-05-18T00:08:19.401566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.401566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03893","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoYtVSSsEJhnuWEn1AXZdFqdrYvsWpe+MFDfoQHMhFDfeDNweAo030DOQ5d1w5JxiXHxx24bbgTD7XAYpwECDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:01.477880Z"},"content_sha256":"105b55b0420ec9be3b6c85cb1c483b592d36c09ccde3f8aade34da98d27978b1","schema_version":"1.0","event_id":"sha256:105b55b0420ec9be3b6c85cb1c483b592d36c09ccde3f8aade34da98d27978b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7YR6JHP3Z66T5N42GP6MTO4NNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning a graph into cycles with a specified number of chords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jin Yan, Shuya Chiba, Suyun Jiang","submitted_at":"2018-08-12T05:38:41Z","abstract_excerpt":"For a graph $G$, let $\\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a result of Brandt et al. (J. Graph Theory 24 (1997) 165-173) for large graphs: For positive integers $k$ and $c$, there exists an integer $f(k,c)$ such that, if $G$ is a graph of order $n \\ge f(k, c)$ and $\\sigma_{2}(G) \\ge n$, then $G$ can be partitioned into $k$ vertex-disjoint cycles, each of which has at least $c$ chord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03893","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgGuvdFX5CoSGKh4qVseKHCNG1wW//VeZu2Y2eM2QiaeK5GemCw7a8KICC4yyVF4P28GQK0GNSKzubUNm2moDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:01.478625Z"},"content_sha256":"72de71b929e482d8743292e5467a0fcdc7797e04c275195068fc62c266ab9ef2","schema_version":"1.0","event_id":"sha256:72de71b929e482d8743292e5467a0fcdc7797e04c275195068fc62c266ab9ef2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/bundle.json","state_url":"https://pith.science/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/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-26T03:39:01Z","links":{"resolver":"https://pith.science/pith/7YR6JHP3Z66T5N42GP6MTO4NNM","bundle":"https://pith.science/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/bundle.json","state":"https://pith.science/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YR6JHP3Z66T5N42GP6MTO4NNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7YR6JHP3Z66T5N42GP6MTO4NNM","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":"98ab056dced71bcb08518e7c578db78a87df505ad62a2f7d249be630b81537a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T05:38:41Z","title_canon_sha256":"f2305b1b1cacde4c99e9806c7c44aef7d84f71c061df015be7ad226b9939dc47"},"schema_version":"1.0","source":{"id":"1808.03893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03893","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03893v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03893","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"7YR6JHP3Z66T","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7YR6JHP3Z66T5N42","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7YR6JHP3","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:72de71b929e482d8743292e5467a0fcdc7797e04c275195068fc62c266ab9ef2","target":"graph","created_at":"2026-05-18T00:08:19Z","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 graph $G$, let $\\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a result of Brandt et al. (J. Graph Theory 24 (1997) 165-173) for large graphs: For positive integers $k$ and $c$, there exists an integer $f(k,c)$ such that, if $G$ is a graph of order $n \\ge f(k, c)$ and $\\sigma_{2}(G) \\ge n$, then $G$ can be partitioned into $k$ vertex-disjoint cycles, each of which has at least $c$ chord","authors_text":"Jin Yan, Shuya Chiba, Suyun Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T05:38:41Z","title":"Partitioning a graph into cycles with a specified number of chords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03893","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:105b55b0420ec9be3b6c85cb1c483b592d36c09ccde3f8aade34da98d27978b1","target":"record","created_at":"2026-05-18T00:08:19Z","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":"98ab056dced71bcb08518e7c578db78a87df505ad62a2f7d249be630b81537a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T05:38:41Z","title_canon_sha256":"f2305b1b1cacde4c99e9806c7c44aef7d84f71c061df015be7ad226b9939dc47"},"schema_version":"1.0","source":{"id":"1808.03893","kind":"arxiv","version":1}},"canonical_sha256":"fe23e49dfbcfbd3eb79a33fcc9bb8d6b232f21b64c49c9e4d6eda3f9bd0b63a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe23e49dfbcfbd3eb79a33fcc9bb8d6b232f21b64c49c9e4d6eda3f9bd0b63a2","first_computed_at":"2026-05-18T00:08:19.401566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.401566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkRUyoS5/HMvxnxQ+PsDqUfk2CXzX7EErIc7Kug3siSctqRofvngmi5VwNHxiAXqo4AQ7PlWrRMfd+uwpjeMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.402047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:105b55b0420ec9be3b6c85cb1c483b592d36c09ccde3f8aade34da98d27978b1","sha256:72de71b929e482d8743292e5467a0fcdc7797e04c275195068fc62c266ab9ef2"],"state_sha256":"4bb6b3d7cd731cb6d2da4da6126c3208a7c23a63345c8d9afd5e6378283c6271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yA3dfxRV3nwSqtLYRDPerZsutaRU61VqC3cSoXathWFOAu/skFsn+rhc2eoylhzhTZSthHMUUZqAVCT7uoZfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:39:01.482462Z","bundle_sha256":"e5735c3f22c62eb2e46421421707cf772861cd9c0773f2a62ec1e9c1f63220c0"}}