{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7SHTV3BZGNNIXQGGKUEFMQOCQG","short_pith_number":"pith:7SHTV3BZ","schema_version":"1.0","canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","source":{"kind":"arxiv","id":"1604.05958","version":1},"attestation_state":"computed","paper":{"title":"Circular Backbone Colorings: on matching and tree backbones of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Cezar, Ana Silva, Fabricio Benevides, Julio Araujo","submitted_at":"2016-04-20T13:50:14Z","abstract_excerpt":"Given a graph $G$, and a spanning subgraph $H$ of $G$, a circular $q$-backbone $k$-coloring of $(G,H)$ is a proper $k$-coloring $c$ of $G$ such that $q\\le \\lvert c(u)-c(v)\\rvert \\le k-q$, for every edge $uv\\in E(H)$. The circular $q$-backbone chromatic number of $(G,H)$, denoted by $CBC_q(G,H)$, is the minimum integer $k$ for which there exists a circular $q$-backbone $k$-coloring of $(G,H)$.\n  The Four Color Theorem implies that whenever $G$ is planar, we have $CBC_2(G,H)\\le 8$. It is conjectured that this upper bound can be improved to 7 when $H$ is a tree, and to 6 when $H$ is a matching. I"},"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":"1604.05958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-20T13:50:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2e0493bce7d5c43542209f9582d8a7761e85bc2bca700358cac4ee9730fc7190","abstract_canon_sha256":"a40483c5a12d9d06f9716a85c8678460ddc821b6c988daa3f1cf364225f29fd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:34.094510Z","signature_b64":"qCahif0BCmtFEBKbOCPx9dNX0opCo8wh7g9wEENWKKZdhsEZzcCDCP6lrkW6np2XaNADiYy3QE6dYB5uiYByCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","last_reissued_at":"2026-05-18T01:16:34.093882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:34.093882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular Backbone Colorings: on matching and tree backbones of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Cezar, Ana Silva, Fabricio Benevides, Julio Araujo","submitted_at":"2016-04-20T13:50:14Z","abstract_excerpt":"Given a graph $G$, and a spanning subgraph $H$ of $G$, a circular $q$-backbone $k$-coloring of $(G,H)$ is a proper $k$-coloring $c$ of $G$ such that $q\\le \\lvert c(u)-c(v)\\rvert \\le k-q$, for every edge $uv\\in E(H)$. The circular $q$-backbone chromatic number of $(G,H)$, denoted by $CBC_q(G,H)$, is the minimum integer $k$ for which there exists a circular $q$-backbone $k$-coloring of $(G,H)$.\n  The Four Color Theorem implies that whenever $G$ is planar, we have $CBC_2(G,H)\\le 8$. It is conjectured that this upper bound can be improved to 7 when $H$ is a tree, and to 6 when $H$ is a matching. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05958","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":"1604.05958","created_at":"2026-05-18T01:16:34.093985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05958v1","created_at":"2026-05-18T01:16:34.093985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05958","created_at":"2026-05-18T01:16:34.093985+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SHTV3BZGNNI","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SHTV3BZGNNIXQGG","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SHTV3BZ","created_at":"2026-05-18T12:30:04.600751+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/7SHTV3BZGNNIXQGGKUEFMQOCQG","json":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG.json","graph_json":"https://pith.science/api/pith-number/7SHTV3BZGNNIXQGGKUEFMQOCQG/graph.json","events_json":"https://pith.science/api/pith-number/7SHTV3BZGNNIXQGGKUEFMQOCQG/events.json","paper":"https://pith.science/paper/7SHTV3BZ"},"agent_actions":{"view_html":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG","download_json":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG.json","view_paper":"https://pith.science/paper/7SHTV3BZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05958&json=true","fetch_graph":"https://pith.science/api/pith-number/7SHTV3BZGNNIXQGGKUEFMQOCQG/graph.json","fetch_events":"https://pith.science/api/pith-number/7SHTV3BZGNNIXQGGKUEFMQOCQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/action/storage_attestation","attest_author":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/action/author_attestation","sign_citation":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/action/citation_signature","submit_replication":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/action/replication_record"}},"created_at":"2026-05-18T01:16:34.093985+00:00","updated_at":"2026-05-18T01:16:34.093985+00:00"}