{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6NYM5H62PMILWDRV6TT33QL5HN","short_pith_number":"pith:6NYM5H62","schema_version":"1.0","canonical_sha256":"f370ce9fda7b10bb0e35f4e7bdc17d3b7bae05c9302721dd5d358c7ba155a98c","source":{"kind":"arxiv","id":"1205.1727","version":1},"attestation_state":"computed","paper":{"title":"Partitions of graphs into small and large sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Asen Bojilov, Nedyalko Nenov, Yair Caro","submitted_at":"2012-05-08T15:32:00Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V(G)$ \\emph{$k$-small} if, for every vertex $v \\in A$, $\\deg(v) \\le n - |A| + k$. A subset $B \\subseteq V(G)$ is called \\emph{$k$-large} if, for every vertex $u \\in B$, $\\deg(u) \\ge |B| - k - 1$. Moreover, we denote by $\\varphi_k(G)$ the minimum integer $t$ such that there is a partition of $V(G)$ into $t$ $k$-small sets, and by $\\Omega_k(G)$ the minimum integer $t$ such that there is a partition of $V(G)$ into $t$ $k$-large sets. In this paper, we will show tight connections between $k$-small sets, respectively $k$-la"},"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":"1205.1727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-08T15:32:00Z","cross_cats_sorted":[],"title_canon_sha256":"c21fd2da39bdad71f748d32f0ca27e362bb69a1869d318cc5a75a4493773e883","abstract_canon_sha256":"a742ff9c8141a2ede20762e1328d643853ccc80aee23acf55a3ad0a31474e1ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:09.290897Z","signature_b64":"3jkTB0VOmcYfWcHnSPmD6qvX3s/KPE6ma0esSo9Nxm6H2woyejUYaslKuqXUpeF7o5k5R9wVuuiBrRnLAhDSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f370ce9fda7b10bb0e35f4e7bdc17d3b7bae05c9302721dd5d358c7ba155a98c","last_reissued_at":"2026-05-18T03:56:09.290273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:09.290273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitions of graphs into small and large sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Asen Bojilov, Nedyalko Nenov, Yair Caro","submitted_at":"2012-05-08T15:32:00Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V(G)$ \\emph{$k$-small} if, for every vertex $v \\in A$, $\\deg(v) \\le n - |A| + k$. A subset $B \\subseteq V(G)$ is called \\emph{$k$-large} if, for every vertex $u \\in B$, $\\deg(u) \\ge |B| - k - 1$. Moreover, we denote by $\\varphi_k(G)$ the minimum integer $t$ such that there is a partition of $V(G)$ into $t$ $k$-small sets, and by $\\Omega_k(G)$ the minimum integer $t$ such that there is a partition of $V(G)$ into $t$ $k$-large sets. In this paper, we will show tight connections between $k$-small sets, respectively $k$-la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1727","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":"1205.1727","created_at":"2026-05-18T03:56:09.290385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1727v1","created_at":"2026-05-18T03:56:09.290385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1727","created_at":"2026-05-18T03:56:09.290385+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NYM5H62PMIL","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NYM5H62PMILWDRV","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NYM5H62","created_at":"2026-05-18T12:26:56.085431+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/6NYM5H62PMILWDRV6TT33QL5HN","json":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN.json","graph_json":"https://pith.science/api/pith-number/6NYM5H62PMILWDRV6TT33QL5HN/graph.json","events_json":"https://pith.science/api/pith-number/6NYM5H62PMILWDRV6TT33QL5HN/events.json","paper":"https://pith.science/paper/6NYM5H62"},"agent_actions":{"view_html":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN","download_json":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN.json","view_paper":"https://pith.science/paper/6NYM5H62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1727&json=true","fetch_graph":"https://pith.science/api/pith-number/6NYM5H62PMILWDRV6TT33QL5HN/graph.json","fetch_events":"https://pith.science/api/pith-number/6NYM5H62PMILWDRV6TT33QL5HN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN/action/storage_attestation","attest_author":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN/action/author_attestation","sign_citation":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN/action/citation_signature","submit_replication":"https://pith.science/pith/6NYM5H62PMILWDRV6TT33QL5HN/action/replication_record"}},"created_at":"2026-05-18T03:56:09.290385+00:00","updated_at":"2026-05-18T03:56:09.290385+00:00"}