{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZSQC7CGU3CHUK4SCEEAALA2EQA","short_pith_number":"pith:ZSQC7CGU","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"},"canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","source":{"kind":"arxiv","id":"1505.01889","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01889","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01889v2","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01889","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZSQC7CGU3CHU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSQC7CGU3CHUK4SC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSQC7CGU","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZSQC7CGU3CHUK4SCEEAALA2EQA","target":"record","payload":{"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"},"canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","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"},"source_kind":"arxiv","source_id":"1505.01889","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-18T02:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Z5Bj0qDqoNJrhueFCtreGMda9IK8/BJypA9VtSbh1O6sutuM2kLXiOi9L2PWw26yU5DHJwajHdKQ1qN3pBKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:17:04.834252Z"},"content_sha256":"806533988ca594e198c9450beda04bf454a4ee0185ed62da88f52ff6a617f813","schema_version":"1.0","event_id":"sha256:806533988ca594e198c9450beda04bf454a4ee0185ed62da88f52ff6a617f813"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZSQC7CGU3CHUK4SCEEAALA2EQA","target":"graph","payload":{"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"},"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-18T02:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGWZXHH3Y254pSXySkRjtpKJc+PHDVMD0JpknmDC4SkIo9EhrHYhyW8JYvTuA/nn0Ur3fSkxlAq22i89O+gUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:17:04.834627Z"},"content_sha256":"2bc293cd31dbc6e7d6840fe76508c37119c1dae48537fc0d85b61672530fc07f","schema_version":"1.0","event_id":"sha256:2bc293cd31dbc6e7d6840fe76508c37119c1dae48537fc0d85b61672530fc07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/bundle.json","state_url":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/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-01T19:17:04Z","links":{"resolver":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA","bundle":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/bundle.json","state":"https://pith.science/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSQC7CGU3CHUK4SCEEAALA2EQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZSQC7CGU3CHUK4SCEEAALA2EQA","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":"48cebcb73bdc0863898226154659b35bb605494d678cca9142f1e005492f00a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T23:27:55Z","title_canon_sha256":"b2fa4a4ffbe6cbe39f5514e917665c29cd3be2a8be45fd96d83e82c4abdd6517"},"schema_version":"1.0","source":{"id":"1505.01889","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01889","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01889v2","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01889","created_at":"2026-05-18T02:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZSQC7CGU3CHU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSQC7CGU3CHUK4SC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSQC7CGU","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:2bc293cd31dbc6e7d6840fe76508c37119c1dae48537fc0d85b61672530fc07f","target":"graph","created_at":"2026-05-18T02:14:16Z","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":"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. ","authors_text":"Isaac Smith, Peter Tian, Zane Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T23:27:55Z","title":"Symmetric Chromatic Polynomial of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01889","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:806533988ca594e198c9450beda04bf454a4ee0185ed62da88f52ff6a617f813","target":"record","created_at":"2026-05-18T02:14:16Z","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":"48cebcb73bdc0863898226154659b35bb605494d678cca9142f1e005492f00a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T23:27:55Z","title_canon_sha256":"b2fa4a4ffbe6cbe39f5514e917665c29cd3be2a8be45fd96d83e82c4abdd6517"},"schema_version":"1.0","source":{"id":"1505.01889","kind":"arxiv","version":2}},"canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca02f88d4d88f4572422100058344803db28d9d9e86ef13adaaea898be7ebfb","first_computed_at":"2026-05-18T02:14:16.304510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:16.304510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lDr/Qmzwb1WHct6LHZrAXOZOo2z8wh4cxxUhYCUV0xkMNiDUIqUSutkdIZl+/1IEq0HedqEldKZcVkGb90qkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:16.305122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01889","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:806533988ca594e198c9450beda04bf454a4ee0185ed62da88f52ff6a617f813","sha256:2bc293cd31dbc6e7d6840fe76508c37119c1dae48537fc0d85b61672530fc07f"],"state_sha256":"a8c4af29e9d541f006acd6c0e41cc57ec97a5063df30ac44ed0349f8b61a93b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeI8hkKAXTxrsza1qXd0j/Ih5UdSSU1ly6r72wK3VSpXHUr8/IhoUO96qoQwPZtF6LVxz5qgb5gyruCaithnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:17:04.836627Z","bundle_sha256":"e456b2ef9f5aa05fd86923df4d975111d98ff238f593b6e0da6ebed1e295fd80"}}