{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J6PBBJNN64UZSIYV6UKVDMAVQX","short_pith_number":"pith:J6PBBJNN","schema_version":"1.0","canonical_sha256":"4f9e10a5adf729992315f51551b01585ecaa1ff4d044dd4e304242a9910263d6","source":{"kind":"arxiv","id":"1503.03272","version":5},"attestation_state":"computed","paper":{"title":"On the existence of vertex-disjoint subgraphs with high degree sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Lichiardopol, Shuya Chiba","submitted_at":"2015-03-11T11:10:24Z","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 $"},"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":"1503.03272","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T11:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"4b0b9daa5d1bc1256b8f79cacd357459c4215ba62f467d3ce36b26d9ea29a4f5","abstract_canon_sha256":"ea1e76472c1bc6ede72b2ff011cdfaeca77b08890844dde8b00391363e76ff65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:54.613123Z","signature_b64":"MmQxUnChzKsWgjyWmbOl/Mb4kkMQ6WjPeJ2CQUkdsRMOCZlABZirf8a8EiZTB7Ne1MZjnpFOQH51qFVLVJr/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f9e10a5adf729992315f51551b01585ecaa1ff4d044dd4e304242a9910263d6","last_reissued_at":"2026-05-18T00:45:54.612518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:54.612518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the existence of vertex-disjoint subgraphs with high degree sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicolas Lichiardopol, Shuya Chiba","submitted_at":"2015-03-11T11:10:24Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03272","kind":"arxiv","version":5},"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":"1503.03272","created_at":"2026-05-18T00:45:54.612605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03272v5","created_at":"2026-05-18T00:45:54.612605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03272","created_at":"2026-05-18T00:45:54.612605+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6PBBJNN64UZ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6PBBJNN64UZSIYV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6PBBJNN","created_at":"2026-05-18T12:29:27.538025+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/J6PBBJNN64UZSIYV6UKVDMAVQX","json":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX.json","graph_json":"https://pith.science/api/pith-number/J6PBBJNN64UZSIYV6UKVDMAVQX/graph.json","events_json":"https://pith.science/api/pith-number/J6PBBJNN64UZSIYV6UKVDMAVQX/events.json","paper":"https://pith.science/paper/J6PBBJNN"},"agent_actions":{"view_html":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX","download_json":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX.json","view_paper":"https://pith.science/paper/J6PBBJNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03272&json=true","fetch_graph":"https://pith.science/api/pith-number/J6PBBJNN64UZSIYV6UKVDMAVQX/graph.json","fetch_events":"https://pith.science/api/pith-number/J6PBBJNN64UZSIYV6UKVDMAVQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX/action/storage_attestation","attest_author":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX/action/author_attestation","sign_citation":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX/action/citation_signature","submit_replication":"https://pith.science/pith/J6PBBJNN64UZSIYV6UKVDMAVQX/action/replication_record"}},"created_at":"2026-05-18T00:45:54.612605+00:00","updated_at":"2026-05-18T00:45:54.612605+00:00"}