{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZSQC7CGU3CHUK4SCEEAALA2EQA","short_pith_number":"pith:ZSQC7CGU","schema_version":"1.0","canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","source":{"kind":"arxiv","id":"1505.01889","version":2},"attestation_state":"computed","paper":{"title":"Symmetric Chromatic Polynomial of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Isaac Smith, Peter Tian, Zane Smith","submitted_at":"2015-05-07T23:27:55Z","abstract_excerpt":"In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain collection of integer partitions of $|V|$ induced by each $S\\subseteq E$, which is very approachable with the aid of a computer. Our research involved writing a computer program for efficient verification of this conjecture for trees up to 23 vertices. In this process, we also gather trees with matching collections of integer partitions of a fixed number of parts. "},"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":"1505.01889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T23:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"b2fa4a4ffbe6cbe39f5514e917665c29cd3be2a8be45fd96d83e82c4abdd6517","abstract_canon_sha256":"48cebcb73bdc0863898226154659b35bb605494d678cca9142f1e005492f00a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:16.305122Z","signature_b64":"lDr/Qmzwb1WHct6LHZrAXOZOo2z8wh4cxxUhYCUV0xkMNiDUIqUSutkdIZl+/1IEq0HedqEldKZcVkGb90qkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","last_reissued_at":"2026-05-18T02:14:16.304510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:16.304510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Chromatic Polynomial of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Isaac Smith, Peter Tian, Zane Smith","submitted_at":"2015-05-07T23:27:55Z","abstract_excerpt":"In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain collection of integer partitions of $|V|$ induced by each $S\\subseteq E$, which is very approachable with the aid of a computer. Our research involved writing a computer program for efficient verification of this conjecture for trees up to 23 vertices. In this process, we also gather trees with matching collections of integer partitions of a fixed number of parts. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01889","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":"1505.01889","created_at":"2026-05-18T02:14:16.304617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01889v2","created_at":"2026-05-18T02:14:16.304617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01889","created_at":"2026-05-18T02:14:16.304617+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSQC7CGU3CHU","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSQC7CGU3CHUK4SC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSQC7CGU","created_at":"2026-05-18T12:29:52.810259+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/ZSQC7CGU3CHUK4SCEEAALA2EQA","json":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA.json","graph_json":"https://pith.science/api/pith-number/ZSQC7CGU3CHUK4SCEEAALA2EQA/graph.json","events_json":"https://pith.science/api/pith-number/ZSQC7CGU3CHUK4SCEEAALA2EQA/events.json","paper":"https://pith.science/paper/ZSQC7CGU"},"agent_actions":{"view_html":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA","download_json":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA.json","view_paper":"https://pith.science/paper/ZSQC7CGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01889&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSQC7CGU3CHUK4SCEEAALA2EQA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSQC7CGU3CHUK4SCEEAALA2EQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/action/storage_attestation","attest_author":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/action/author_attestation","sign_citation":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/action/citation_signature","submit_replication":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/action/replication_record"}},"created_at":"2026-05-18T02:14:16.304617+00:00","updated_at":"2026-05-18T02:14:16.304617+00:00"}