{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N447XFUBGJ3IDBYB5KY63CYCUQ","short_pith_number":"pith:N447XFUB","schema_version":"1.0","canonical_sha256":"6f39fb96813276818701eab1ed8b02a411ce8c87a271e971319b3bdc2b9a0a93","source":{"kind":"arxiv","id":"1111.4989","version":1},"attestation_state":"computed","paper":{"title":"List Distinguishing Parameters of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Ellen Gethner, Michael Ferrara, Paul S. Wenger, Stephen G. Hartke","submitted_at":"2011-11-21T19:58:24Z","abstract_excerpt":"A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G. The distinguishing chromatic number of G, chi_D(G), is the minimum number of colors in a distinguishing coloring of G that is also a proper coloring.\n  Recently the notion of a distinguishing coloring was extended to that of a list distinguishing coloring. Given an assignment L= {L(v) : v in V(G)} of lists of available colors to the vertices of G"},"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":"1111.4989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-21T19:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"78a947105afb0bd6b2f1676a25361ee401d7b46b256cfb5d59a593b870ef67c5","abstract_canon_sha256":"4f600d934450b1dc386da7328f8d41da1bf7f69f2b3a27a8d56df27b8da65d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:54.577569Z","signature_b64":"jH7cZ3G2WsyWrD70k9kVIkkXeTVOt85S0nLbUwMaAbQkQjMvJLqLpofxum1dmvy3wbj3dxzSwGpJ1BWLJ5kCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f39fb96813276818701eab1ed8b02a411ce8c87a271e971319b3bdc2b9a0a93","last_reissued_at":"2026-05-18T04:07:54.577082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:54.577082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Distinguishing Parameters of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Ellen Gethner, Michael Ferrara, Paul S. Wenger, Stephen G. Hartke","submitted_at":"2011-11-21T19:58:24Z","abstract_excerpt":"A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G. The distinguishing chromatic number of G, chi_D(G), is the minimum number of colors in a distinguishing coloring of G that is also a proper coloring.\n  Recently the notion of a distinguishing coloring was extended to that of a list distinguishing coloring. Given an assignment L= {L(v) : v in V(G)} of lists of available colors to the vertices of G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4989","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.4989","created_at":"2026-05-18T04:07:54.577158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4989v1","created_at":"2026-05-18T04:07:54.577158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4989","created_at":"2026-05-18T04:07:54.577158+00:00"},{"alias_kind":"pith_short_12","alias_value":"N447XFUBGJ3I","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N447XFUBGJ3IDBYB","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N447XFUB","created_at":"2026-05-18T12:26:37.096874+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/N447XFUBGJ3IDBYB5KY63CYCUQ","json":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ.json","graph_json":"https://pith.science/api/pith-number/N447XFUBGJ3IDBYB5KY63CYCUQ/graph.json","events_json":"https://pith.science/api/pith-number/N447XFUBGJ3IDBYB5KY63CYCUQ/events.json","paper":"https://pith.science/paper/N447XFUB"},"agent_actions":{"view_html":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ","download_json":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ.json","view_paper":"https://pith.science/paper/N447XFUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4989&json=true","fetch_graph":"https://pith.science/api/pith-number/N447XFUBGJ3IDBYB5KY63CYCUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N447XFUBGJ3IDBYB5KY63CYCUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ/action/storage_attestation","attest_author":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ/action/author_attestation","sign_citation":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ/action/citation_signature","submit_replication":"https://pith.science/pith/N447XFUBGJ3IDBYB5KY63CYCUQ/action/replication_record"}},"created_at":"2026-05-18T04:07:54.577158+00:00","updated_at":"2026-05-18T04:07:54.577158+00:00"}