{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3UXYWGRV2YGAZFDML5EXDGQDCB","short_pith_number":"pith:3UXYWGRV","schema_version":"1.0","canonical_sha256":"dd2f8b1a35d60c0c946c5f49719a03106e78cc23569decd2b0a96e85058cff67","source":{"kind":"arxiv","id":"2308.01242","version":3},"attestation_state":"computed","paper":{"title":"Balanced-chromatic number and Hadwiger-like conjectures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, Daniel A. Quiroz, Jessica McDonald, Kathryn Nurse, Reza Naserasr","submitted_at":"2023-08-02T15:57:18Z","abstract_excerpt":"Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the \\emph{balanced chromatic number}, $\\chi_b(\\hat{G})$, of a signed graph $\\hat{G}$. This is the minimum number of parts into which the vertices of a signed graph can be partitioned so that none of the parts induces a negative cycle. This extends the notion of the chromatic number of a graph since $\\chi(G)=\\chi_b(\\tilde{G})$, where $\\tilde{G}$ denotes the signed graph"},"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":"2308.01242","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-02T15:57:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c08e1ba351486e4a56df2c86536f669cfc7965cba95f5fcce2b8e6d6d5c4d0cc","abstract_canon_sha256":"bfd4136f68a7c77b434a6eb1aa1fe48c78698d9b1efaae7771a9b625a59499e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:00.456647Z","signature_b64":"pjsDFtJWKnMte3KmIkg1wJDQLnjOEURcGotv4nJDpnbAUZ/KZG/M8IWwjIST1KckT3sDgrkAA8B6d1U8k4YXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd2f8b1a35d60c0c946c5f49719a03106e78cc23569decd2b0a96e85058cff67","last_reissued_at":"2026-07-02T01:18:00.456252Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:00.456252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced-chromatic number and Hadwiger-like conjectures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, Daniel A. Quiroz, Jessica McDonald, Kathryn Nurse, Reza Naserasr","submitted_at":"2023-08-02T15:57:18Z","abstract_excerpt":"Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the \\emph{balanced chromatic number}, $\\chi_b(\\hat{G})$, of a signed graph $\\hat{G}$. This is the minimum number of parts into which the vertices of a signed graph can be partitioned so that none of the parts induces a negative cycle. This extends the notion of the chromatic number of a graph since $\\chi(G)=\\chi_b(\\tilde{G})$, where $\\tilde{G}$ denotes the signed graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01242","kind":"arxiv","version":3},"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/2308.01242/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":"2308.01242","created_at":"2026-07-02T01:18:00.456311+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.01242v3","created_at":"2026-07-02T01:18:00.456311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01242","created_at":"2026-07-02T01:18:00.456311+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UXYWGRV2YGA","created_at":"2026-07-02T01:18:00.456311+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UXYWGRV2YGAZFDM","created_at":"2026-07-02T01:18:00.456311+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UXYWGRV","created_at":"2026-07-02T01:18:00.456311+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/3UXYWGRV2YGAZFDML5EXDGQDCB","json":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB.json","graph_json":"https://pith.science/api/pith-number/3UXYWGRV2YGAZFDML5EXDGQDCB/graph.json","events_json":"https://pith.science/api/pith-number/3UXYWGRV2YGAZFDML5EXDGQDCB/events.json","paper":"https://pith.science/paper/3UXYWGRV"},"agent_actions":{"view_html":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB","download_json":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB.json","view_paper":"https://pith.science/paper/3UXYWGRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/3UXYWGRV2YGAZFDML5EXDGQDCB/graph.json","fetch_events":"https://pith.science/api/pith-number/3UXYWGRV2YGAZFDML5EXDGQDCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB/action/storage_attestation","attest_author":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB/action/author_attestation","sign_citation":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB/action/citation_signature","submit_replication":"https://pith.science/pith/3UXYWGRV2YGAZFDML5EXDGQDCB/action/replication_record"}},"created_at":"2026-07-02T01:18:00.456311+00:00","updated_at":"2026-07-02T01:18:00.456311+00:00"}