{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CRWG7CVP4PNCYCJ26BXYDQD7M3","short_pith_number":"pith:CRWG7CVP","canonical_record":{"source":{"id":"1509.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T15:10:51Z","cross_cats_sorted":[],"title_canon_sha256":"8dcfd8f8a8862e1363422bfbd3f7143cf6473f23502ab459ecced80fd12d5254","abstract_canon_sha256":"59cf818bb668f6ec2062e021401954008198940238114e74bb33657252eb5ce4"},"schema_version":"1.0"},"canonical_sha256":"146c6f8aafe3da2c093af06f81c07f66dfdd2b154af501ae3ea35cd7d3786f0f","source":{"kind":"arxiv","id":"1509.09210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09210","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09210v1","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09210","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"pith_short_12","alias_value":"CRWG7CVP4PNC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRWG7CVP4PNCYCJ2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRWG7CVP","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CRWG7CVP4PNCYCJ26BXYDQD7M3","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T15:10:51Z","cross_cats_sorted":[],"title_canon_sha256":"8dcfd8f8a8862e1363422bfbd3f7143cf6473f23502ab459ecced80fd12d5254","abstract_canon_sha256":"59cf818bb668f6ec2062e021401954008198940238114e74bb33657252eb5ce4"},"schema_version":"1.0"},"canonical_sha256":"146c6f8aafe3da2c093af06f81c07f66dfdd2b154af501ae3ea35cd7d3786f0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:26.816730Z","signature_b64":"jJxyIyF8whF9dGnqEdiEWY/MgYFJwWI5Xs5ab84Tuv0FWwT3iU1bv6tBmrBROzef0TPA67kxDfhSNdB3KhfpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146c6f8aafe3da2c093af06f81c07f66dfdd2b154af501ae3ea35cd7d3786f0f","last_reissued_at":"2026-05-18T01:31:26.816094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:26.816094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09210","source_version":1,"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-18T01:31:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jh6RXyWhO/eRkfn8L2QTCQoGheod6tyovoHLaEXJUa0TAvtgsYxH8D8o1o8naXeKax4ZDLEGda1ovRwQLBqwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:11.081348Z"},"content_sha256":"496a7e8a536a4e62f785f6fd92cf598b89b56de15e6d22c263446f11f4e6925f","schema_version":"1.0","event_id":"sha256:496a7e8a536a4e62f785f6fd92cf598b89b56de15e6d22c263446f11f4e6925f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CRWG7CVP4PNCYCJ26BXYDQD7M3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna de Mier, Jos\\'e Aliste-Prieto, Jos\\'e Zamora","submitted_at":"2015-09-30T15:10:51Z","abstract_excerpt":"This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same $U$-polynomial (or, equivalently, the same chromatic symmetric function). We consider the $U_k$-polynomial, which is a restricted version of $U$-polynomial, and construct with the help of solutions of the Prouhet-Tarry-Escott problem, non-isomorphic trees with the same $U_k$-polynomial for any given $k$. By doing so, we also find a new class of trees that are distinguished by the $U$-polynomial up to isomorphism."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09210","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"},"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-18T01:31:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEvWNYd8dU8p/r3llU6oFL05P2TC8yWd0PH3EzVbDar0chTnr3pA6IEQNguPPAUn11n21K734TjlgN5Zu1zTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:11.081705Z"},"content_sha256":"b0adb3ae848b22f95fdd3075e05e790680b98c31bc29e9995886efe12500f140","schema_version":"1.0","event_id":"sha256:b0adb3ae848b22f95fdd3075e05e790680b98c31bc29e9995886efe12500f140"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/bundle.json","state_url":"https://pith.science/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/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-02T17:49:11Z","links":{"resolver":"https://pith.science/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3","bundle":"https://pith.science/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/bundle.json","state":"https://pith.science/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRWG7CVP4PNCYCJ26BXYDQD7M3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CRWG7CVP4PNCYCJ26BXYDQD7M3","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":"59cf818bb668f6ec2062e021401954008198940238114e74bb33657252eb5ce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T15:10:51Z","title_canon_sha256":"8dcfd8f8a8862e1363422bfbd3f7143cf6473f23502ab459ecced80fd12d5254"},"schema_version":"1.0","source":{"id":"1509.09210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09210","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09210v1","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09210","created_at":"2026-05-18T01:31:26Z"},{"alias_kind":"pith_short_12","alias_value":"CRWG7CVP4PNC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRWG7CVP4PNCYCJ2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRWG7CVP","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b0adb3ae848b22f95fdd3075e05e790680b98c31bc29e9995886efe12500f140","target":"graph","created_at":"2026-05-18T01:31:26Z","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":"This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same $U$-polynomial (or, equivalently, the same chromatic symmetric function). We consider the $U_k$-polynomial, which is a restricted version of $U$-polynomial, and construct with the help of solutions of the Prouhet-Tarry-Escott problem, non-isomorphic trees with the same $U_k$-polynomial for any given $k$. By doing so, we also find a new class of trees that are distinguished by the $U$-polynomial up to isomorphism.","authors_text":"Anna de Mier, Jos\\'e Aliste-Prieto, Jos\\'e Zamora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T15:10:51Z","title":"On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09210","kind":"arxiv","version":1},"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:496a7e8a536a4e62f785f6fd92cf598b89b56de15e6d22c263446f11f4e6925f","target":"record","created_at":"2026-05-18T01:31:26Z","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":"59cf818bb668f6ec2062e021401954008198940238114e74bb33657252eb5ce4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T15:10:51Z","title_canon_sha256":"8dcfd8f8a8862e1363422bfbd3f7143cf6473f23502ab459ecced80fd12d5254"},"schema_version":"1.0","source":{"id":"1509.09210","kind":"arxiv","version":1}},"canonical_sha256":"146c6f8aafe3da2c093af06f81c07f66dfdd2b154af501ae3ea35cd7d3786f0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"146c6f8aafe3da2c093af06f81c07f66dfdd2b154af501ae3ea35cd7d3786f0f","first_computed_at":"2026-05-18T01:31:26.816094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:26.816094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jJxyIyF8whF9dGnqEdiEWY/MgYFJwWI5Xs5ab84Tuv0FWwT3iU1bv6tBmrBROzef0TPA67kxDfhSNdB3KhfpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:26.816730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:496a7e8a536a4e62f785f6fd92cf598b89b56de15e6d22c263446f11f4e6925f","sha256:b0adb3ae848b22f95fdd3075e05e790680b98c31bc29e9995886efe12500f140"],"state_sha256":"e056ecf6a681e4890d72fad23c9bce20c54b52178ef0f6e7e3ff1fefd81a93f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piRFuuOYcLndZ80XZFMwircgCuLj+JF1lRFbQU0aRygZtDT7/rwwgYTnKrVUNppZu0ZGIvcNzuAvviSQXtW+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:49:11.083735Z","bundle_sha256":"3fc9792866ffb0ed37db597666a531584c5b258c672b102758f926d08f4a7f7e"}}