{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BRVUQL6XC3TTABE7TPPHETPMLM","short_pith_number":"pith:BRVUQL6X","schema_version":"1.0","canonical_sha256":"0c6b482fd716e730049f9bde724dec5b0638d13eca08d520be40abc2ab5d4a25","source":{"kind":"arxiv","id":"1707.03910","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03910","created_at":"2026-05-17T23:58:08.799002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03910v2","created_at":"2026-05-17T23:58:08.799002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03910","created_at":"2026-05-17T23:58:08.799002+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRVUQL6XC3TT","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRVUQL6XC3TTABE7","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRVUQL6X","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM","json":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM.json","graph_json":"https://pith.science/api/pith-number/BRVUQL6XC3TTABE7TPPHETPMLM/graph.json","events_json":"https://pith.science/api/pith-number/BRVUQL6XC3TTABE7TPPHETPMLM/events.json","paper":"https://pith.science/paper/BRVUQL6X"},"agent_actions":{"view_html":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM","download_json":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM.json","view_paper":"https://pith.science/paper/BRVUQL6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03910&json=true","fetch_graph":"https://pith.science/api/pith-number/BRVUQL6XC3TTABE7TPPHETPMLM/graph.json","fetch_events":"https://pith.science/api/pith-number/BRVUQL6XC3TTABE7TPPHETPMLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/action/storage_attestation","attest_author":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/action/author_attestation","sign_citation":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/action/citation_signature","submit_replication":"https://pith.science/pith/BRVUQL6XC3TTABE7TPPHETPMLM/action/replication_record"}},"created_at":"2026-05-17T23:58:08.799002+00:00","updated_at":"2026-05-17T23:58:08.799002+00:00"}