{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FNH2AHV2GR7RUT6QDO5GJRH73C","short_pith_number":"pith:FNH2AHV2","schema_version":"1.0","canonical_sha256":"2b4fa01eba347f1a4fd01bba64c4ffd88680de51583da9c8d63bbbe4e2c8025a","source":{"kind":"arxiv","id":"2311.08772","version":1},"attestation_state":"computed","paper":{"title":"Borodin-Kostochka conjecture and Partitioning a graph into classes with no clique of specified size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yaser Rowshan","submitted_at":"2023-11-15T08:35:34Z","abstract_excerpt":"For a given graph $H$ and the graphical properties $P_1, P_2,\\ldots,P_k$, a graph $H$ is said to be $(V_1, V_2,\\ldots,V_k)$-partitionable if there exists a partition of $V(H)$ into $k$-sets $V_1, V_2\\ldots,V_k$, such that for each $i\\in[k]$, the subgraph induced by $V_i$ has the property $P_i$. In $1979$, Bollob\\'{a}s and Manvel showed that for a graph $H$ with maximum degree $\\Delta(H)\\geq 3$ and clique number $\\omega(H)\\leq \\Delta(H)$, if $\\Delta(H)= p+q$, then there exists a $(V_1,V_2)$-partition of $V(H)$, such that $\\Delta(H[V_1])\\leq p$, $\\Delta(H[V_2])\\leq q$, $H[V_1]$ is $(p-1)$-degene"},"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":"2311.08772","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-15T08:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"05298cbc4389a079769e4273dd7f6fa44d8c137bad265553ae545f18fd5527d5","abstract_canon_sha256":"7365065152900e8cd7c70f8414a1249148967100616181d1214cdc59abdbbfe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:03.187545Z","signature_b64":"OY+dk/ezIIXrTkFs8SHr6Ki2zfc/vkf9ySu6xb6mcj3OcLlZuZGq9ZoiOuy33Rc0AXHWXm8T/zlUs0N4lut/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b4fa01eba347f1a4fd01bba64c4ffd88680de51583da9c8d63bbbe4e2c8025a","last_reissued_at":"2026-07-05T07:13:03.187089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:03.187089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Borodin-Kostochka conjecture and Partitioning a graph into classes with no clique of specified size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yaser Rowshan","submitted_at":"2023-11-15T08:35:34Z","abstract_excerpt":"For a given graph $H$ and the graphical properties $P_1, P_2,\\ldots,P_k$, a graph $H$ is said to be $(V_1, V_2,\\ldots,V_k)$-partitionable if there exists a partition of $V(H)$ into $k$-sets $V_1, V_2\\ldots,V_k$, such that for each $i\\in[k]$, the subgraph induced by $V_i$ has the property $P_i$. In $1979$, Bollob\\'{a}s and Manvel showed that for a graph $H$ with maximum degree $\\Delta(H)\\geq 3$ and clique number $\\omega(H)\\leq \\Delta(H)$, if $\\Delta(H)= p+q$, then there exists a $(V_1,V_2)$-partition of $V(H)$, such that $\\Delta(H[V_1])\\leq p$, $\\Delta(H[V_2])\\leq q$, $H[V_1]$ is $(p-1)$-degene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08772","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.08772/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.08772","created_at":"2026-07-05T07:13:03.187150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.08772v1","created_at":"2026-07-05T07:13:03.187150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08772","created_at":"2026-07-05T07:13:03.187150+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNH2AHV2GR7R","created_at":"2026-07-05T07:13:03.187150+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNH2AHV2GR7RUT6Q","created_at":"2026-07-05T07:13:03.187150+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNH2AHV2","created_at":"2026-07-05T07:13:03.187150+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13710","citing_title":"SoftPipe: A Soft-Guided Reinforcement Learning Framework for Automated Data Preparation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C","json":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C.json","graph_json":"https://pith.science/api/pith-number/FNH2AHV2GR7RUT6QDO5GJRH73C/graph.json","events_json":"https://pith.science/api/pith-number/FNH2AHV2GR7RUT6QDO5GJRH73C/events.json","paper":"https://pith.science/paper/FNH2AHV2"},"agent_actions":{"view_html":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C","download_json":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C.json","view_paper":"https://pith.science/paper/FNH2AHV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.08772&json=true","fetch_graph":"https://pith.science/api/pith-number/FNH2AHV2GR7RUT6QDO5GJRH73C/graph.json","fetch_events":"https://pith.science/api/pith-number/FNH2AHV2GR7RUT6QDO5GJRH73C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C/action/storage_attestation","attest_author":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C/action/author_attestation","sign_citation":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C/action/citation_signature","submit_replication":"https://pith.science/pith/FNH2AHV2GR7RUT6QDO5GJRH73C/action/replication_record"}},"created_at":"2026-07-05T07:13:03.187150+00:00","updated_at":"2026-07-05T07:13:03.187150+00:00"}