{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FXMQDO4WKDD3EKB3SVIRGHULJK","short_pith_number":"pith:FXMQDO4W","canonical_record":{"source":{"id":"1908.05066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T10:54:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64fe69b788ba4fde74273df96f88bc360d340b40daacc216ade45e725519e45b","abstract_canon_sha256":"8de75b9797c6fe4c4f61cb0f7b4d235deecc7fe6b1a923332c7632145f8a848e"},"schema_version":"1.0"},"canonical_sha256":"2dd901bb9650c7b2283b9551131e8b4a9379dac977629e02e905c020d8ac538e","source":{"kind":"arxiv","id":"1908.05066","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05066","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05066v3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05066","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"FXMQDO4WKDD3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"FXMQDO4WKDD3EKB3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"FXMQDO4W","created_at":"2026-07-05T02:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FXMQDO4WKDD3EKB3SVIRGHULJK","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T10:54:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"64fe69b788ba4fde74273df96f88bc360d340b40daacc216ade45e725519e45b","abstract_canon_sha256":"8de75b9797c6fe4c4f61cb0f7b4d235deecc7fe6b1a923332c7632145f8a848e"},"schema_version":"1.0"},"canonical_sha256":"2dd901bb9650c7b2283b9551131e8b4a9379dac977629e02e905c020d8ac538e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:55.323573Z","signature_b64":"CMuN894B22V6UUAG1kDiGt+K+/LteBREbnt/8EcebiGd8qpGl0sK9pMLhrpImycdGe7idQwDN4Rvi6YNjNXsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd901bb9650c7b2283b9551131e8b4a9379dac977629e02e905c020d8ac538e","last_reissued_at":"2026-07-05T02:30:55.323055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:55.323055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05066","source_version":3,"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-05T02:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYDT3+7RLpn2a1Sj3cTbBkH0aGmtIykX5oQYdxgxlzEM71dVbv+l7YFHsY8h3E2o5lqlB4mmiUDhLteCZAQbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:24:21.260607Z"},"content_sha256":"6c0a1167335c00be89e06add28ce20e0b677c88aa1e2fe9bc3723cb0c57746bc","schema_version":"1.0","event_id":"sha256:6c0a1167335c00be89e06add28ce20e0b677c88aa1e2fe9bc3723cb0c57746bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FXMQDO4WKDD3EKB3SVIRGHULJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equitable vertex arboricity conjecture holds for graphs with low degeneracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bei Niu, Bi Li, Xin Zhang, Yan Li","submitted_at":"2019-08-14T10:54:28Z","abstract_excerpt":"The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations. Namely, an equitable tree-$k$-coloring of a graph is a vertex coloring using $k$ distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one. In this paper, we show some theoretical results on the equitable tree-coloring of graphs by proving that every $d$-degenerate graph with maximum degree at most $\\Delta$ is equitably tree-$k$-colorable for every integer $k\\geq (\\Delta+1)/2$ provided that $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05066","kind":"arxiv","version":3},"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.05066/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-05T02:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+auyFq0EWizCT4OjIioLhXLzLYJF4f66JurgrWdo0Ad/hoqtThi/b3pF23wChCa7G5pBmLi/Xt1OiFSyPr8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:24:21.261098Z"},"content_sha256":"1554e89327a963ac0d2d77e34cc579243ede5048baa6e4e7c84669c231285f20","schema_version":"1.0","event_id":"sha256:1554e89327a963ac0d2d77e34cc579243ede5048baa6e4e7c84669c231285f20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/bundle.json","state_url":"https://pith.science/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/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-16T11:24:21Z","links":{"resolver":"https://pith.science/pith/FXMQDO4WKDD3EKB3SVIRGHULJK","bundle":"https://pith.science/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/bundle.json","state":"https://pith.science/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXMQDO4WKDD3EKB3SVIRGHULJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FXMQDO4WKDD3EKB3SVIRGHULJK","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":"8de75b9797c6fe4c4f61cb0f7b4d235deecc7fe6b1a923332c7632145f8a848e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T10:54:28Z","title_canon_sha256":"64fe69b788ba4fde74273df96f88bc360d340b40daacc216ade45e725519e45b"},"schema_version":"1.0","source":{"id":"1908.05066","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05066","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05066v3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05066","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"FXMQDO4WKDD3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"FXMQDO4WKDD3EKB3","created_at":"2026-07-05T02:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"FXMQDO4W","created_at":"2026-07-05T02:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:1554e89327a963ac0d2d77e34cc579243ede5048baa6e4e7c84669c231285f20","target":"graph","created_at":"2026-07-05T02:30:55Z","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.05066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations. Namely, an equitable tree-$k$-coloring of a graph is a vertex coloring using $k$ distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one. In this paper, we show some theoretical results on the equitable tree-coloring of graphs by proving that every $d$-degenerate graph with maximum degree at most $\\Delta$ is equitably tree-$k$-colorable for every integer $k\\geq (\\Delta+1)/2$ provided that $\\","authors_text":"Bei Niu, Bi Li, Xin Zhang, Yan Li","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T10:54:28Z","title":"Equitable vertex arboricity conjecture holds for graphs with low degeneracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05066","kind":"arxiv","version":3},"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:6c0a1167335c00be89e06add28ce20e0b677c88aa1e2fe9bc3723cb0c57746bc","target":"record","created_at":"2026-07-05T02:30:55Z","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":"8de75b9797c6fe4c4f61cb0f7b4d235deecc7fe6b1a923332c7632145f8a848e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T10:54:28Z","title_canon_sha256":"64fe69b788ba4fde74273df96f88bc360d340b40daacc216ade45e725519e45b"},"schema_version":"1.0","source":{"id":"1908.05066","kind":"arxiv","version":3}},"canonical_sha256":"2dd901bb9650c7b2283b9551131e8b4a9379dac977629e02e905c020d8ac538e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dd901bb9650c7b2283b9551131e8b4a9379dac977629e02e905c020d8ac538e","first_computed_at":"2026-07-05T02:30:55.323055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:55.323055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMuN894B22V6UUAG1kDiGt+K+/LteBREbnt/8EcebiGd8qpGl0sK9pMLhrpImycdGe7idQwDN4Rvi6YNjNXsDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:55.323573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05066","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c0a1167335c00be89e06add28ce20e0b677c88aa1e2fe9bc3723cb0c57746bc","sha256:1554e89327a963ac0d2d77e34cc579243ede5048baa6e4e7c84669c231285f20"],"state_sha256":"40acd988692b81a948b5f9029c90ca33f7c2ee2df7da82441eea10b6c95752ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwP2ScNkcDf8HhqtbzStJEYTScOjLxREvkZh8aCST5N7nyNKtHAW5Nlb8dCOaSieITOj2zxpSigDt26JNjLNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:24:21.264381Z","bundle_sha256":"92ee1026de10b2dcae5234c16df283b50645aeac382c5c77d34c616e6e451807"}}