{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SJS7FNDXDSR465ZVVZ4BKWZPOE","short_pith_number":"pith:SJS7FNDX","canonical_record":{"source":{"id":"1908.05069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:05:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e34abdb8fc6181be6e155e7426c3d9a35d51f999be67e788fc92166a5d7f4b12","abstract_canon_sha256":"7938558a0ccc64fc57b851bff218bd4c761980a04b5b52b4bac1b6b09c70911e"},"schema_version":"1.0"},"canonical_sha256":"9265f2b4771ca3cf7735ae78155b2f710bfa42c788d2436b44394fb4d1d2c048","source":{"kind":"arxiv","id":"1908.05069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05069","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05069v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05069","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"SJS7FNDXDSR4","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"SJS7FNDXDSR465ZV","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"SJS7FNDX","created_at":"2026-07-04T23:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SJS7FNDXDSR465ZVVZ4BKWZPOE","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:05:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e34abdb8fc6181be6e155e7426c3d9a35d51f999be67e788fc92166a5d7f4b12","abstract_canon_sha256":"7938558a0ccc64fc57b851bff218bd4c761980a04b5b52b4bac1b6b09c70911e"},"schema_version":"1.0"},"canonical_sha256":"9265f2b4771ca3cf7735ae78155b2f710bfa42c788d2436b44394fb4d1d2c048","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:59.588477Z","signature_b64":"yIX2WhWCLNOQJgZL0EPQ+L2f1x8hAVCHjNqiJIcjxTJGJSVZsNXFfxbiuvlBJV4zIFcsbyFcEyA2iZhlmGzjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9265f2b4771ca3cf7735ae78155b2f710bfa42c788d2436b44394fb4d1d2c048","last_reissued_at":"2026-07-04T23:55:59.588133Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:59.588133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05069","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-07-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66xFoQ7ydj0tg6Dtc1eEq2QnP3IyiqEX/TO6bG4Y1mjhulW4xfDdEdBWxKLgiX2w0SeHYiBjbAGQXkIVH6N/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:33:02.471716Z"},"content_sha256":"2595f0910fea3612b1ff9e3887bbbfa6fcd9597a3032b5df5ba0d6eb851dfadd","schema_version":"1.0","event_id":"sha256:2595f0910fea3612b1ff9e3887bbbfa6fcd9597a3032b5df5ba0d6eb851dfadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SJS7FNDXDSR465ZVVZ4BKWZPOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equitable tree-$O(d)$-coloring of $d$-degenerate graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bei Niu, Xin Zhang","submitted_at":"2019-08-14T11:05:37Z","abstract_excerpt":"An equitable tree-$k$-coloring of a graph is a vertex coloring on $k$ colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one.This kind of coloring was first introduced in 2013 and can be used to formulate the structure decomposition problem on the communication network with some security considerations. In 2015, Esperet, Lemoine and Maffray showed that every $d$-degenerate graph admits an equitable tree-$k$-coloring for every $k\\geq 3^{d-1}$. Motivated by this result, we attempt to lower their exponential bound to a linear bound. Precisel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05069","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05069/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"},"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-07-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhP70zgDopZGefn/KcwT9h4b9H0FYVmbnaUXicGVneCB2oefTSND2SIvHjOU+GMvRuGDsmmj8CvARhnSIF7YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:33:02.472253Z"},"content_sha256":"65ab3dcdc31d2d88173147c9ec455bf7f76b5f7f8d05bb368ec4a22d8ce55fb7","schema_version":"1.0","event_id":"sha256:65ab3dcdc31d2d88173147c9ec455bf7f76b5f7f8d05bb368ec4a22d8ce55fb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/bundle.json","state_url":"https://pith.science/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/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-08-16T06:33:02Z","links":{"resolver":"https://pith.science/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE","bundle":"https://pith.science/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/bundle.json","state":"https://pith.science/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJS7FNDXDSR465ZVVZ4BKWZPOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SJS7FNDXDSR465ZVVZ4BKWZPOE","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":"7938558a0ccc64fc57b851bff218bd4c761980a04b5b52b4bac1b6b09c70911e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:05:37Z","title_canon_sha256":"e34abdb8fc6181be6e155e7426c3d9a35d51f999be67e788fc92166a5d7f4b12"},"schema_version":"1.0","source":{"id":"1908.05069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05069","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05069v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05069","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"SJS7FNDXDSR4","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"SJS7FNDXDSR465ZV","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"SJS7FNDX","created_at":"2026-07-04T23:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:65ab3dcdc31d2d88173147c9ec455bf7f76b5f7f8d05bb368ec4a22d8ce55fb7","target":"graph","created_at":"2026-07-04T23:55:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05069/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An equitable tree-$k$-coloring of a graph is a vertex coloring on $k$ colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one.This kind of coloring was first introduced in 2013 and can be used to formulate the structure decomposition problem on the communication network with some security considerations. In 2015, Esperet, Lemoine and Maffray showed that every $d$-degenerate graph admits an equitable tree-$k$-coloring for every $k\\geq 3^{d-1}$. Motivated by this result, we attempt to lower their exponential bound to a linear bound. Precisel","authors_text":"Bei Niu, Xin Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:05:37Z","title":"Equitable tree-$O(d)$-coloring of $d$-degenerate graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05069","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:2595f0910fea3612b1ff9e3887bbbfa6fcd9597a3032b5df5ba0d6eb851dfadd","target":"record","created_at":"2026-07-04T23:55:59Z","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":"7938558a0ccc64fc57b851bff218bd4c761980a04b5b52b4bac1b6b09c70911e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:05:37Z","title_canon_sha256":"e34abdb8fc6181be6e155e7426c3d9a35d51f999be67e788fc92166a5d7f4b12"},"schema_version":"1.0","source":{"id":"1908.05069","kind":"arxiv","version":1}},"canonical_sha256":"9265f2b4771ca3cf7735ae78155b2f710bfa42c788d2436b44394fb4d1d2c048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9265f2b4771ca3cf7735ae78155b2f710bfa42c788d2436b44394fb4d1d2c048","first_computed_at":"2026-07-04T23:55:59.588133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:59.588133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yIX2WhWCLNOQJgZL0EPQ+L2f1x8hAVCHjNqiJIcjxTJGJSVZsNXFfxbiuvlBJV4zIFcsbyFcEyA2iZhlmGzjAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:59.588477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2595f0910fea3612b1ff9e3887bbbfa6fcd9597a3032b5df5ba0d6eb851dfadd","sha256:65ab3dcdc31d2d88173147c9ec455bf7f76b5f7f8d05bb368ec4a22d8ce55fb7"],"state_sha256":"7ebdbe14c0806aef5eb1e377ffb2500e88da84da093d460f1c65654bae5e5e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cr7IoPyAIhPdXM0FuXzFQ/C67BiJoEGQhYBAgHNKYdICGlgtPB0CTqBiAK3EMUHAkcvHc4+Rn6Sc888m7losDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:33:02.477170Z","bundle_sha256":"0674cadf7261158e2ea0812a2c60bf0ea4f516b7dbf93f4470af5916b8b936df"}}