{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BRVUQL6XC3TTABE7TPPHETPMLM","short_pith_number":"pith:BRVUQL6X","canonical_record":{"source":{"id":"1707.03910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T21:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"fddd03c121410a5a207da86748d385ef09fa8003b73ee74925c955076b457eda","abstract_canon_sha256":"06126d4e764c4274be2932c61987555a2d63f31afd3202644ed7bd4a3ac4301b"},"schema_version":"1.0"},"canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","source":{"kind":"arxiv","id":"1707.03910","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03910","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03910v2","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03910","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"BRVUQL6XC3TT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRVUQL6XC3TTABE7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRVUQL6X","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BRVUQL6XC3TTABE7TPPHETPMLM","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T21:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"fddd03c121410a5a207da86748d385ef09fa8003b73ee74925c955076b457eda","abstract_canon_sha256":"06126d4e764c4274be2932c61987555a2d63f31afd3202644ed7bd4a3ac4301b"},"schema_version":"1.0"},"canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:08.799441Z","signature_b64":"Yf8MgIZ+V++srfovOBhtVchnZ2z6/maRCPW7yBQJpNucVwQy5xL5d/1RXTFtX2GgKoz1BkkuVA6UEnU+QB90BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","last_reissued_at":"2026-05-17T23:58:08.798923Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:08.798923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03910","source_version":2,"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-17T23:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+U6q2PQRGQJ5H8c3HZcDF3ErWM/Dp2poY9ggRiFwaJ8QYT1MvCHpD1c/8jmkOSrOMU7glPtESRpaxjYsQImDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:44:06.874906Z"},"content_sha256":"3038acf2b734ed4cbc8622251af90d7a0aa534da439aa3872ac33d5ff9334ae8","schema_version":"1.0","event_id":"sha256:3038acf2b734ed4cbc8622251af90d7a0aa534da439aa3872ac33d5ff9334ae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BRVUQL6XC3TTABE7TPPHETPMLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing and minimizing the number of generalized colorings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Stocker, John Engbers","submitted_at":"2017-07-12T21:04:03Z","abstract_excerpt":"We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and Radcliffe on the maximum and minimum number of existence homomorphisms from a tree to a completely looped graph on $q$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03910","kind":"arxiv","version":2},"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-17T23:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0/qsFTqklF4p9q+YzaipCpIFg6lqEYOajyBYO3HqHOCv7pCdRqnW2YnFmwu8RZcKAr1+BrBhG0X3HoN+sCCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:44:06.875248Z"},"content_sha256":"60f5bd1ec641f836f33f60904ce1baff1039669dcc1d401b75ff1904019438f5","schema_version":"1.0","event_id":"sha256:60f5bd1ec641f836f33f60904ce1baff1039669dcc1d401b75ff1904019438f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/bundle.json","state_url":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRVUQL6XC3TTABE7TPPHETPMLM/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-03T07:44:06Z","links":{"resolver":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM","bundle":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/bundle.json","state":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRVUQL6XC3TTABE7TPPHETPMLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BRVUQL6XC3TTABE7TPPHETPMLM","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":"06126d4e764c4274be2932c61987555a2d63f31afd3202644ed7bd4a3ac4301b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T21:04:03Z","title_canon_sha256":"fddd03c121410a5a207da86748d385ef09fa8003b73ee74925c955076b457eda"},"schema_version":"1.0","source":{"id":"1707.03910","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03910","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03910v2","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03910","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"BRVUQL6XC3TT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRVUQL6XC3TTABE7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRVUQL6X","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:60f5bd1ec641f836f33f60904ce1baff1039669dcc1d401b75ff1904019438f5","target":"graph","created_at":"2026-05-17T23:58:08Z","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":"We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and Radcliffe on the maximum and minimum number of existence homomorphisms from a tree to a completely looped graph on $q$ vertices.","authors_text":"Christopher Stocker, John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T21:04:03Z","title":"Maximizing and minimizing the number of generalized colorings of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03910","kind":"arxiv","version":2},"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:3038acf2b734ed4cbc8622251af90d7a0aa534da439aa3872ac33d5ff9334ae8","target":"record","created_at":"2026-05-17T23:58:08Z","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":"06126d4e764c4274be2932c61987555a2d63f31afd3202644ed7bd4a3ac4301b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T21:04:03Z","title_canon_sha256":"fddd03c121410a5a207da86748d385ef09fa8003b73ee74925c955076b457eda"},"schema_version":"1.0","source":{"id":"1707.03910","kind":"arxiv","version":2}},"canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","first_computed_at":"2026-05-17T23:58:08.798923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:08.798923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yf8MgIZ+V++srfovOBhtVchnZ2z6/maRCPW7yBQJpNucVwQy5xL5d/1RXTFtX2GgKoz1BkkuVA6UEnU+QB90BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:08.799441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03910","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3038acf2b734ed4cbc8622251af90d7a0aa534da439aa3872ac33d5ff9334ae8","sha256:60f5bd1ec641f836f33f60904ce1baff1039669dcc1d401b75ff1904019438f5"],"state_sha256":"f341624f5a715e01354a2959fba2edec1abe744e61f655663a51f75c077837c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xyF0a7n+FN/h5D6pXq/VoPoDYJOpFnqYjwJmCF19DJn1kCNQVzuO7rR+9VnTWoLEGVjPN3AGlJLC2uSogJXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:44:06.877091Z","bundle_sha256":"df0e840470433962aa9e396832dde1d15cdd371d0857bf6355f41db8106ed169"}}