{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EDMDRXJI3IAFKXOXQ7ZZN635LG","short_pith_number":"pith:EDMDRXJI","canonical_record":{"source":{"id":"1807.09034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T11:08:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5c7f2d2a57276a71ef450daf8d44eb9c45d351f8c3da43da8f24d2e0f7fff5eb","abstract_canon_sha256":"96bc224ecf35ef4eaa0c4db948d6652105432efe0c9ed2f5b11051c93ce51cbc"},"schema_version":"1.0"},"canonical_sha256":"20d838dd28da00555dd787f396fb7d599231861c2dd2e317e16d8c2f80a0507a","source":{"kind":"arxiv","id":"1807.09034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09034","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09034v1","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09034","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"EDMDRXJI3IAF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EDMDRXJI3IAFKXOX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EDMDRXJI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EDMDRXJI3IAFKXOXQ7ZZN635LG","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T11:08:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5c7f2d2a57276a71ef450daf8d44eb9c45d351f8c3da43da8f24d2e0f7fff5eb","abstract_canon_sha256":"96bc224ecf35ef4eaa0c4db948d6652105432efe0c9ed2f5b11051c93ce51cbc"},"schema_version":"1.0"},"canonical_sha256":"20d838dd28da00555dd787f396fb7d599231861c2dd2e317e16d8c2f80a0507a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:56.975965Z","signature_b64":"1MEhSPmZKnT1FskP11K+7LUyEEUhksNKY+JVONToc7bjjAnOEBtKlkyHsmG4LV62/KrXQw3RyGXjZUI3UVnsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d838dd28da00555dd787f396fb7d599231861c2dd2e317e16d8c2f80a0507a","last_reissued_at":"2026-05-18T00:09:56.975341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:56.975341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09034","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-18T00:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6lgjSnTMiRXwwYshNCU05PuTZah9sdYwbdI07mb/EwsSi/gye9hjs/gcwDHfLEPHY7/Lo58vx/29zjGnIQXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:00:31.372502Z"},"content_sha256":"bbb5c15584bd80eadb4db324b26209f115acda1993b9ea17261336e20c9a9f9b","schema_version":"1.0","event_id":"sha256:bbb5c15584bd80eadb4db324b26209f115acda1993b9ea17261336e20c9a9f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EDMDRXJI3IAFKXOXQ7ZZN635LG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected greedy coloring $H$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ana Silva, Esdras Mota, Leonardo Sampaio","submitted_at":"2018-07-24T11:08:32Z","abstract_excerpt":"A connected ordering $(v_1, v_2, \\ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\\{v_1, \\ldots, v_{i - 1}\\}$ for every $i \\in \\{2, \\ldots, n\\}$. A connected greedy coloring (CGC for short) is a coloring obtained by applying the greedy algorithm to a connected ordering. This has been first introduced in 1989 by Hertz and de Werra, but still very little is known about this problem. An interesting aspect is that, contrary to the traditional greedy coloring, it is not always true that a graph has a connected ordering that produces an optimal co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09034","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-18T00:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEkRsi++1g2wwrjiT+3WvoE+NOmTcyyVvX7C3Tgez6/yUuaL+KBKst8FK//Off9snWxEgGTaZfvVSW0fglOLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:00:31.373217Z"},"content_sha256":"57e12dd03637a112b1341fdf35b705b8ff9d05670e65137c06022889ce2f17ba","schema_version":"1.0","event_id":"sha256:57e12dd03637a112b1341fdf35b705b8ff9d05670e65137c06022889ce2f17ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/bundle.json","state_url":"https://pith.science/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/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-06T21:00:31Z","links":{"resolver":"https://pith.science/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG","bundle":"https://pith.science/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/bundle.json","state":"https://pith.science/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDMDRXJI3IAFKXOXQ7ZZN635LG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EDMDRXJI3IAFKXOXQ7ZZN635LG","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":"96bc224ecf35ef4eaa0c4db948d6652105432efe0c9ed2f5b11051c93ce51cbc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T11:08:32Z","title_canon_sha256":"5c7f2d2a57276a71ef450daf8d44eb9c45d351f8c3da43da8f24d2e0f7fff5eb"},"schema_version":"1.0","source":{"id":"1807.09034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09034","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09034v1","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09034","created_at":"2026-05-18T00:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"EDMDRXJI3IAF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EDMDRXJI3IAFKXOX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EDMDRXJI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:57e12dd03637a112b1341fdf35b705b8ff9d05670e65137c06022889ce2f17ba","target":"graph","created_at":"2026-05-18T00:09:56Z","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":"A connected ordering $(v_1, v_2, \\ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\\{v_1, \\ldots, v_{i - 1}\\}$ for every $i \\in \\{2, \\ldots, n\\}$. A connected greedy coloring (CGC for short) is a coloring obtained by applying the greedy algorithm to a connected ordering. This has been first introduced in 1989 by Hertz and de Werra, but still very little is known about this problem. An interesting aspect is that, contrary to the traditional greedy coloring, it is not always true that a graph has a connected ordering that produces an optimal co","authors_text":"Ana Silva, Esdras Mota, Leonardo Sampaio","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T11:08:32Z","title":"Connected greedy coloring $H$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09034","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:bbb5c15584bd80eadb4db324b26209f115acda1993b9ea17261336e20c9a9f9b","target":"record","created_at":"2026-05-18T00:09:56Z","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":"96bc224ecf35ef4eaa0c4db948d6652105432efe0c9ed2f5b11051c93ce51cbc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-24T11:08:32Z","title_canon_sha256":"5c7f2d2a57276a71ef450daf8d44eb9c45d351f8c3da43da8f24d2e0f7fff5eb"},"schema_version":"1.0","source":{"id":"1807.09034","kind":"arxiv","version":1}},"canonical_sha256":"20d838dd28da00555dd787f396fb7d599231861c2dd2e317e16d8c2f80a0507a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d838dd28da00555dd787f396fb7d599231861c2dd2e317e16d8c2f80a0507a","first_computed_at":"2026-05-18T00:09:56.975341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:56.975341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1MEhSPmZKnT1FskP11K+7LUyEEUhksNKY+JVONToc7bjjAnOEBtKlkyHsmG4LV62/KrXQw3RyGXjZUI3UVnsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:56.975965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb5c15584bd80eadb4db324b26209f115acda1993b9ea17261336e20c9a9f9b","sha256:57e12dd03637a112b1341fdf35b705b8ff9d05670e65137c06022889ce2f17ba"],"state_sha256":"118bd3164ede899a008f62446754844ad9a76f1a5fbab633c4287ab748e9a283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWKEHTwdd18nNy9Q/mYtJRiOFbZAFXM9K3qCWuVxB/14wF53qXeC6NcEVtSngeZ6v3qBXaQEPP2D0OJATY7WDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:00:31.376853Z","bundle_sha256":"85119b5793775d8e4c2d089fe2e6360b534c7c7f5db750b4607eaa11abc690d5"}}