{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4J4GUPJEZEPGAF2UNRN3KD456W","short_pith_number":"pith:4J4GUPJE","schema_version":"1.0","canonical_sha256":"e2786a3d24c91e6017546c5bb50f9df5b4eb8c26fa0e7d706a40e5f1ad710a03","source":{"kind":"arxiv","id":"1511.05398","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre A. Cezar, Ana Silva, Julio Araujo","submitted_at":"2015-11-17T13:45:14Z","abstract_excerpt":"A proper $k$-coloring of a graph $G=(V,E)$ is a function $c: V(G)\\to \\{1,\\ldots,k\\}$ such that $c(u)\\neq c(v)$, for every $uv\\in E(G)$. The chromatic number $\\chi(G)$ is the minimum $k$ such that there exists a proper $k$-coloring of $G$. Given a spanning subgraph $H$ of $G$, a $q$-backbone $k$-coloring of $(G,H)$ is a proper $k$-coloring $c$ of $V(G)$ such that $\\lvert c(u)-c(v)\\rvert \\ge q$, for every edge $uv\\in E(H)$. The $q$-backbone chromatic number $BBC_q(G,H)$ is the smallest $k$ for which there exists a $q$-backbone $k$-coloring of $(G,H)$. In this work, we show that every connected g"},"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":"1511.05398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-17T13:45:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e44bcb205562078abb3304d15d1c13d85e9e2f0dd3ebd713c4f52030fe80593a","abstract_canon_sha256":"ce318b126e7b5982e902743cd960f63835a6b28814bafe8ccddc991770b5c466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:40.355546Z","signature_b64":"3FARAB6c3nXAQalLuC1adaNMhYOuKIzfj9D6/HoDcB3guSnrQQpz+zORkEd0PbbgtpOc8xaVxeIbiD1CG+krAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2786a3d24c91e6017546c5bb50f9df5b4eb8c26fa0e7d706a40e5f1ad710a03","last_reissued_at":"2026-05-18T01:26:40.354857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:40.354857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre A. Cezar, Ana Silva, Julio Araujo","submitted_at":"2015-11-17T13:45:14Z","abstract_excerpt":"A proper $k$-coloring of a graph $G=(V,E)$ is a function $c: V(G)\\to \\{1,\\ldots,k\\}$ such that $c(u)\\neq c(v)$, for every $uv\\in E(G)$. The chromatic number $\\chi(G)$ is the minimum $k$ such that there exists a proper $k$-coloring of $G$. Given a spanning subgraph $H$ of $G$, a $q$-backbone $k$-coloring of $(G,H)$ is a proper $k$-coloring $c$ of $V(G)$ such that $\\lvert c(u)-c(v)\\rvert \\ge q$, for every edge $uv\\in E(H)$. The $q$-backbone chromatic number $BBC_q(G,H)$ is the smallest $k$ for which there exists a $q$-backbone $k$-coloring of $(G,H)$. In this work, we show that every connected g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05398","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":"1511.05398","created_at":"2026-05-18T01:26:40.354968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05398v1","created_at":"2026-05-18T01:26:40.354968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05398","created_at":"2026-05-18T01:26:40.354968+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J4GUPJEZEPG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J4GUPJEZEPGAF2U","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J4GUPJE","created_at":"2026-05-18T12:29:05.191682+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/4J4GUPJEZEPGAF2UNRN3KD456W","json":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W.json","graph_json":"https://pith.science/api/pith-number/4J4GUPJEZEPGAF2UNRN3KD456W/graph.json","events_json":"https://pith.science/api/pith-number/4J4GUPJEZEPGAF2UNRN3KD456W/events.json","paper":"https://pith.science/paper/4J4GUPJE"},"agent_actions":{"view_html":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W","download_json":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W.json","view_paper":"https://pith.science/paper/4J4GUPJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05398&json=true","fetch_graph":"https://pith.science/api/pith-number/4J4GUPJEZEPGAF2UNRN3KD456W/graph.json","fetch_events":"https://pith.science/api/pith-number/4J4GUPJEZEPGAF2UNRN3KD456W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W/action/storage_attestation","attest_author":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W/action/author_attestation","sign_citation":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W/action/citation_signature","submit_replication":"https://pith.science/pith/4J4GUPJEZEPGAF2UNRN3KD456W/action/replication_record"}},"created_at":"2026-05-18T01:26:40.354968+00:00","updated_at":"2026-05-18T01:26:40.354968+00:00"}