{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J6PBBJNN64UZSIYV6UKVDMAVQX","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":"ea1e76472c1bc6ede72b2ff011cdfaeca77b08890844dde8b00391363e76ff65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T11:10:24Z","title_canon_sha256":"4b0b9daa5d1bc1256b8f79cacd357459c4215ba62f467d3ce36b26d9ea29a4f5"},"schema_version":"1.0","source":{"id":"1503.03272","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03272","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03272v5","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03272","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"J6PBBJNN64UZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J6PBBJNN64UZSIYV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J6PBBJNN","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:ace95ef2b09dcc3e3e1b77bf2a49f9b6ce7b25c0d8eec650ed74ceb7b3029685","target":"graph","created_at":"2026-05-18T00:45:54Z","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$, we denote by $\\sigma_{2}(G)$ the minimum degree sum of two non-adjacent vertices if $G$ is non-complete; otherwise, $\\sigma_{2}(G) = +\\infty$. In this paper, we prove the following two results: (i) If $s_{1}, s_{2} \\ge 2$ are integers and $G$ is a non-complete graph with $\\sigma_{2}(G) \\ge 2(s_{1} + s_{2} + 1) - 1$, then $G$ contains two vertex-disjoint subgraphs $H_{1}$ and $H_{2}$ such that each $H_{i}$ is a graph of order at least $s_{i}+1$ with $\\sigma_{2}(H_{i}) \\ge 2s_{i} - 1$. (ii) If $s_{1}, s_{2} \\ge 2$ are integers and $G$ is a triangle-free graph of order at least $","authors_text":"Nicolas Lichiardopol, Shuya Chiba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T11:10:24Z","title":"On the existence of vertex-disjoint subgraphs with high degree sum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03272","kind":"arxiv","version":5},"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:fe72eef4849990264d022e9d7e55385e41781cebccd9ff48fae5891aa597f881","target":"record","created_at":"2026-05-18T00:45:54Z","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":"ea1e76472c1bc6ede72b2ff011cdfaeca77b08890844dde8b00391363e76ff65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T11:10:24Z","title_canon_sha256":"4b0b9daa5d1bc1256b8f79cacd357459c4215ba62f467d3ce36b26d9ea29a4f5"},"schema_version":"1.0","source":{"id":"1503.03272","kind":"arxiv","version":5}},"canonical_sha256":"4f9e10a5adf729992315f51551b01585ecaa1ff4d044dd4e304242a9910263d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f9e10a5adf729992315f51551b01585ecaa1ff4d044dd4e304242a9910263d6","first_computed_at":"2026-05-18T00:45:54.612518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:54.612518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmQxUnChzKsWgjyWmbOl/Mb4kkMQ6WjPeJ2CQUkdsRMOCZlABZirf8a8EiZTB7Ne1MZjnpFOQH51qFVLVJr/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:54.613123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03272","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe72eef4849990264d022e9d7e55385e41781cebccd9ff48fae5891aa597f881","sha256:ace95ef2b09dcc3e3e1b77bf2a49f9b6ce7b25c0d8eec650ed74ceb7b3029685"],"state_sha256":"3eaa2eca41a9bd9a8537b5518f65dba0e0c3fbe45ce7aabe5f65f03569a25a4f"}