{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GQKNDCKC4AWTBQUHAYHQ3XMAJR","short_pith_number":"pith:GQKNDCKC","canonical_record":{"source":{"id":"1801.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T00:58:21Z","cross_cats_sorted":[],"title_canon_sha256":"d98b8f23346786dd1822eddab155bd5889d076ead3ae5caa7845596019c25c67","abstract_canon_sha256":"f60bf1813fec520dbfeec6784479234d9763137a432a1b8fa58db29b49ea9ef8"},"schema_version":"1.0"},"canonical_sha256":"3414d18942e02d30c287060f0ddd804c5b8e612bd55d7691ffb167769223b85d","source":{"kind":"arxiv","id":"1801.07363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07363","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07363v2","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07363","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"GQKNDCKC4AWT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQKNDCKC4AWTBQUH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQKNDCKC","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GQKNDCKC4AWTBQUHAYHQ3XMAJR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T00:58:21Z","cross_cats_sorted":[],"title_canon_sha256":"d98b8f23346786dd1822eddab155bd5889d076ead3ae5caa7845596019c25c67","abstract_canon_sha256":"f60bf1813fec520dbfeec6784479234d9763137a432a1b8fa58db29b49ea9ef8"},"schema_version":"1.0"},"canonical_sha256":"3414d18942e02d30c287060f0ddd804c5b8e612bd55d7691ffb167769223b85d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:33.205088Z","signature_b64":"daZ8ma2kS+6RELWfguPysS4g07tITKT3asOEXPflH0ESpw4q3eHT5IQ3Se8Jypu8fHKGgQg47zmW1jvMvIBrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3414d18942e02d30c287060f0ddd804c5b8e612bd55d7691ffb167769223b85d","last_reissued_at":"2026-05-18T00:24:33.204524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:33.204524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07363","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-18T00:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPRBgDJE6Q/eYN4mWl6Cck3YOJeX6Y5h7FAtHKWqQB5k+IBmsctmoERRQS7JucYFkDaj0UTBUvggfEvRBVRmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:35:21.298147Z"},"content_sha256":"1e5142ac97b2cb3a5df01ef62152c101694220c8457e8e7cc69bc2ae1fd2265f","schema_version":"1.0","event_id":"sha256:1e5142ac97b2cb3a5df01ef62152c101694220c8457e8e7cc69bc2ae1fd2265f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GQKNDCKC4AWTBQUHAYHQ3XMAJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Ji, Sam Heil","submitted_at":"2018-01-23T00:58:21Z","abstract_excerpt":"It is a long-standing question of Stanley whether or not the chromatic symmetric function (CSF) distinguishes unrooted trees. Previously, the best computational result, due to Russell, proved that it distinguishes all trees with at most $25$ vertices. In this paper, we present a novel probabilistic algorithm which may be used to check more efficiently that the CSF distinguishes a set of trees. Applying it, we verify that the CSF distinguishes all trees with up to $29$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07363","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-18T00:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dKLVFOuaCIJ7nzJAoGZLIoe5hOcjMTheKDrWE4VL0UuIiCwqh+pGsep80KKFQvxc8mRoV7dLbYL1C2YG0/WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:35:21.298495Z"},"content_sha256":"3c7c53ead64cc78dc08cd6e422d7c2c7eff8a691228097956924a98f891da89b","schema_version":"1.0","event_id":"sha256:3c7c53ead64cc78dc08cd6e422d7c2c7eff8a691228097956924a98f891da89b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/bundle.json","state_url":"https://pith.science/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/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-23T11:35:21Z","links":{"resolver":"https://pith.science/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR","bundle":"https://pith.science/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/bundle.json","state":"https://pith.science/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQKNDCKC4AWTBQUHAYHQ3XMAJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GQKNDCKC4AWTBQUHAYHQ3XMAJR","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":"f60bf1813fec520dbfeec6784479234d9763137a432a1b8fa58db29b49ea9ef8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T00:58:21Z","title_canon_sha256":"d98b8f23346786dd1822eddab155bd5889d076ead3ae5caa7845596019c25c67"},"schema_version":"1.0","source":{"id":"1801.07363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07363","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07363v2","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07363","created_at":"2026-05-18T00:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"GQKNDCKC4AWT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GQKNDCKC4AWTBQUH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GQKNDCKC","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:3c7c53ead64cc78dc08cd6e422d7c2c7eff8a691228097956924a98f891da89b","target":"graph","created_at":"2026-05-18T00:24:33Z","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":"It is a long-standing question of Stanley whether or not the chromatic symmetric function (CSF) distinguishes unrooted trees. Previously, the best computational result, due to Russell, proved that it distinguishes all trees with at most $25$ vertices. In this paper, we present a novel probabilistic algorithm which may be used to check more efficiently that the CSF distinguishes a set of trees. Applying it, we verify that the CSF distinguishes all trees with up to $29$ vertices.","authors_text":"Caleb Ji, Sam Heil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T00:58:21Z","title":"On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07363","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:1e5142ac97b2cb3a5df01ef62152c101694220c8457e8e7cc69bc2ae1fd2265f","target":"record","created_at":"2026-05-18T00:24:33Z","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":"f60bf1813fec520dbfeec6784479234d9763137a432a1b8fa58db29b49ea9ef8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T00:58:21Z","title_canon_sha256":"d98b8f23346786dd1822eddab155bd5889d076ead3ae5caa7845596019c25c67"},"schema_version":"1.0","source":{"id":"1801.07363","kind":"arxiv","version":2}},"canonical_sha256":"3414d18942e02d30c287060f0ddd804c5b8e612bd55d7691ffb167769223b85d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3414d18942e02d30c287060f0ddd804c5b8e612bd55d7691ffb167769223b85d","first_computed_at":"2026-05-18T00:24:33.204524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:33.204524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"daZ8ma2kS+6RELWfguPysS4g07tITKT3asOEXPflH0ESpw4q3eHT5IQ3Se8Jypu8fHKGgQg47zmW1jvMvIBrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:33.205088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e5142ac97b2cb3a5df01ef62152c101694220c8457e8e7cc69bc2ae1fd2265f","sha256:3c7c53ead64cc78dc08cd6e422d7c2c7eff8a691228097956924a98f891da89b"],"state_sha256":"530cf0f37501382481cf04fea07327f43ba12e51296005fb1643a6b1443bd25f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFNx8TmXBOzjUfVhgzWKVweODxXf2elPX4PWKXsBzEjwcfK4glHYSx8BkkaFsxEFrn++ADMwwW8aut7ROkIWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T11:35:21.300474Z","bundle_sha256":"c66bc4f64f25fc7458302822fa545aaa1e9f6055b2c2bdbd71d9ae2304d32721"}}