{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7SHTV3BZGNNIXQGGKUEFMQOCQG","short_pith_number":"pith:7SHTV3BZ","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"},"canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","source":{"kind":"arxiv","id":"1604.05958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05958","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05958v1","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05958","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"7SHTV3BZGNNI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7SHTV3BZGNNIXQGG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7SHTV3BZ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7SHTV3BZGNNIXQGGKUEFMQOCQG","target":"record","payload":{"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"},"canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","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"},"source_kind":"arxiv","source_id":"1604.05958","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8b1HSYJLDKiKhtgt8OcHTshCh00E4LUmtowW1a3sN5Exs16JP5kfPuwDISv5xonvaKSkOO2RFyVZGBH+iGttBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:13:09.312150Z"},"content_sha256":"2e5de3005bedee36f751597ab90a0895cbd37b017a0c52497810a5849a4f45b4","schema_version":"1.0","event_id":"sha256:2e5de3005bedee36f751597ab90a0895cbd37b017a0c52497810a5849a4f45b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7SHTV3BZGNNIXQGGKUEFMQOCQG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Qve/zADBBMtnwTvsZAhMt+LvCXmo7VEFACQd8293dRaoWMc/BcVT6LkB81KwNjcjzU5b2nromE0OcEOqd0sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:13:09.312511Z"},"content_sha256":"eb1808aaea121edf4619874284f96bae6531de8f2729ced807004040972ba7ab","schema_version":"1.0","event_id":"sha256:eb1808aaea121edf4619874284f96bae6531de8f2729ced807004040972ba7ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/bundle.json","state_url":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T20:13:09Z","links":{"resolver":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG","bundle":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/bundle.json","state":"https://pith.science/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SHTV3BZGNNIXQGGKUEFMQOCQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7SHTV3BZGNNIXQGGKUEFMQOCQG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a40483c5a12d9d06f9716a85c8678460ddc821b6c988daa3f1cf364225f29fd4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-20T13:50:14Z","title_canon_sha256":"2e0493bce7d5c43542209f9582d8a7761e85bc2bca700358cac4ee9730fc7190"},"schema_version":"1.0","source":{"id":"1604.05958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05958","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05958v1","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05958","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"7SHTV3BZGNNI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7SHTV3BZGNNIXQGG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7SHTV3BZ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:eb1808aaea121edf4619874284f96bae6531de8f2729ced807004040972ba7ab","target":"graph","created_at":"2026-05-18T01:16:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre Cezar, Ana Silva, Fabricio Benevides, Julio Araujo","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-20T13:50:14Z","title":"Circular Backbone Colorings: on matching and tree backbones of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05958","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e5de3005bedee36f751597ab90a0895cbd37b017a0c52497810a5849a4f45b4","target":"record","created_at":"2026-05-18T01:16:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a40483c5a12d9d06f9716a85c8678460ddc821b6c988daa3f1cf364225f29fd4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-20T13:50:14Z","title_canon_sha256":"2e0493bce7d5c43542209f9582d8a7761e85bc2bca700358cac4ee9730fc7190"},"schema_version":"1.0","source":{"id":"1604.05958","kind":"arxiv","version":1}},"canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc8f3aec39335a8bc0c655085641c281add11bbc830d8ae2bcb632292a759e5c","first_computed_at":"2026-05-18T01:16:34.093882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:34.093882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qCahif0BCmtFEBKbOCPx9dNX0opCo8wh7g9wEENWKKZdhsEZzcCDCP6lrkW6np2XaNADiYy3QE6dYB5uiYByCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:34.094510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e5de3005bedee36f751597ab90a0895cbd37b017a0c52497810a5849a4f45b4","sha256:eb1808aaea121edf4619874284f96bae6531de8f2729ced807004040972ba7ab"],"state_sha256":"6a036a01e170f758263d3128baac82e0c1861d9950aac98b93937842b3e42cc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKByvvDf3WXE8/ZEiWeG+MnAKkpzuHjaPd100yEYuO6KlvoXXmcmitqUyqAhuoWrnDUvCqhq2pcBX5Ko8VDbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:13:09.314598Z","bundle_sha256":"fe25cd46300e7ef04d91e2461edf3f36ab2c2d06092f7d96fac13017e0f69bc0"}}