{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UCZNU2TYIPQKSJVQBKPIRXC63M","short_pith_number":"pith:UCZNU2TY","canonical_record":{"source":{"id":"2511.11331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-14T14:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"a4088ad9de378b5fd6028140e58bc03fcdf7ea64e57a73b8ea3027b84cf11eec","abstract_canon_sha256":"aea828b1667f606760bb25d8fbd914f162e8543015210ed8dd9039d9cb849031"},"schema_version":"1.0"},"canonical_sha256":"a0b2da6a7843e0a926b00a9e88dc5edb1a15e617e283cfaafc08bd0324c295d5","source":{"kind":"arxiv","id":"2511.11331","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.11331","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"2511.11331v2","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.11331","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"UCZNU2TYIPQK","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_16","alias_value":"UCZNU2TYIPQKSJVQ","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_8","alias_value":"UCZNU2TY","created_at":"2026-08-03T01:12:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UCZNU2TYIPQKSJVQBKPIRXC63M","target":"record","payload":{"canonical_record":{"source":{"id":"2511.11331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-14T14:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"a4088ad9de378b5fd6028140e58bc03fcdf7ea64e57a73b8ea3027b84cf11eec","abstract_canon_sha256":"aea828b1667f606760bb25d8fbd914f162e8543015210ed8dd9039d9cb849031"},"schema_version":"1.0"},"canonical_sha256":"a0b2da6a7843e0a926b00a9e88dc5edb1a15e617e283cfaafc08bd0324c295d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:12:14.729377Z","signature_b64":"Vz/panwaP4fjFZyyAyhS/ljpa9oDqvE0erOdUs6DcyKrPIS1OAxO8eDQ5k0fcOStH9mRwR7iMRT1SylXogBHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b2da6a7843e0a926b00a9e88dc5edb1a15e617e283cfaafc08bd0324c295d5","last_reissued_at":"2026-08-03T01:12:14.727674Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:12:14.727674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.11331","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-08-03T01:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JyKFFwjeQvEQ+5ISmfLNH5ov5lgZPez/txtO92Sg5aON5bWG1IhW537qBsVoeToHiFflBrTXjzX9C0GLU7GqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:19:14.303695Z"},"content_sha256":"fc8c13157e4a6f5ce6da683d4cf2ec4db78eb3e43d84faa24e66fc9aa4d023c9","schema_version":"1.0","event_id":"sha256:fc8c13157e4a6f5ce6da683d4cf2ec4db78eb3e43d84faa24e66fc9aa4d023c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UCZNU2TYIPQKSJVQBKPIRXC63M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the gracesize of trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Ella Williams, Shoham Letzter","submitted_at":"2025-11-14T14:05:02Z","abstract_excerpt":"An $n$-vertex tree $T$ is said to be $\\textit{graceful}$ if there exists a bijective labelling $\\phi:V(T)\\to \\{1,\\ldots,n\\}$ such that the edge-differences $\\{|\\phi(x)-\\phi(y)| : xy\\in E(T)\\}$ are pairwise distinct. The longstanding graceful tree conjecture, posed by R\\'{o}sa in the 1960s, asserts that every tree is graceful. The $\\textit{graceful}$ of an $n$-vertex tree $T$, denoted $\\operatorname{gs}(T)$, is the maximum possible number of distinct edge-differences over all bijective labellings $\\phi:V(T)\\to \\{1,\\ldots,n\\}$. The graceful tree conjecture is therefore equivalent to the statemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.11331","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.11331/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-03T01:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1QILkBLe6e2xvl7x+JkyMGkThjoq2aKSq/HU0+lkHvwSATRKStLajFZ/mVjoV3yDn2P6B/2xqve2uMvtPfCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:19:14.304548Z"},"content_sha256":"83cb2dc54f8b6ba28c3a900e24ce39e761b96fdba7daa200117587f1ff9937c9","schema_version":"1.0","event_id":"sha256:83cb2dc54f8b6ba28c3a900e24ce39e761b96fdba7daa200117587f1ff9937c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/bundle.json","state_url":"https://pith.science/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/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-08-08T18:19:14Z","links":{"resolver":"https://pith.science/pith/UCZNU2TYIPQKSJVQBKPIRXC63M","bundle":"https://pith.science/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/bundle.json","state":"https://pith.science/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCZNU2TYIPQKSJVQBKPIRXC63M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UCZNU2TYIPQKSJVQBKPIRXC63M","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":"aea828b1667f606760bb25d8fbd914f162e8543015210ed8dd9039d9cb849031","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-14T14:05:02Z","title_canon_sha256":"a4088ad9de378b5fd6028140e58bc03fcdf7ea64e57a73b8ea3027b84cf11eec"},"schema_version":"1.0","source":{"id":"2511.11331","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.11331","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"2511.11331v2","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.11331","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"UCZNU2TYIPQK","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_16","alias_value":"UCZNU2TYIPQKSJVQ","created_at":"2026-08-03T01:12:14Z"},{"alias_kind":"pith_short_8","alias_value":"UCZNU2TY","created_at":"2026-08-03T01:12:14Z"}],"graph_snapshots":[{"event_id":"sha256:83cb2dc54f8b6ba28c3a900e24ce39e761b96fdba7daa200117587f1ff9937c9","target":"graph","created_at":"2026-08-03T01:12:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.11331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $n$-vertex tree $T$ is said to be $\\textit{graceful}$ if there exists a bijective labelling $\\phi:V(T)\\to \\{1,\\ldots,n\\}$ such that the edge-differences $\\{|\\phi(x)-\\phi(y)| : xy\\in E(T)\\}$ are pairwise distinct. The longstanding graceful tree conjecture, posed by R\\'{o}sa in the 1960s, asserts that every tree is graceful. The $\\textit{graceful}$ of an $n$-vertex tree $T$, denoted $\\operatorname{gs}(T)$, is the maximum possible number of distinct edge-differences over all bijective labellings $\\phi:V(T)\\to \\{1,\\ldots,n\\}$. The graceful tree conjecture is therefore equivalent to the statemen","authors_text":"Alexey Pokrovskiy, Ella Williams, Shoham Letzter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-14T14:05:02Z","title":"On the gracesize of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.11331","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:fc8c13157e4a6f5ce6da683d4cf2ec4db78eb3e43d84faa24e66fc9aa4d023c9","target":"record","created_at":"2026-08-03T01:12:14Z","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":"aea828b1667f606760bb25d8fbd914f162e8543015210ed8dd9039d9cb849031","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-14T14:05:02Z","title_canon_sha256":"a4088ad9de378b5fd6028140e58bc03fcdf7ea64e57a73b8ea3027b84cf11eec"},"schema_version":"1.0","source":{"id":"2511.11331","kind":"arxiv","version":2}},"canonical_sha256":"a0b2da6a7843e0a926b00a9e88dc5edb1a15e617e283cfaafc08bd0324c295d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0b2da6a7843e0a926b00a9e88dc5edb1a15e617e283cfaafc08bd0324c295d5","first_computed_at":"2026-08-03T01:12:14.727674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:12:14.727674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vz/panwaP4fjFZyyAyhS/ljpa9oDqvE0erOdUs6DcyKrPIS1OAxO8eDQ5k0fcOStH9mRwR7iMRT1SylXogBHCw==","signature_status":"signed_v1","signed_at":"2026-08-03T01:12:14.729377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.11331","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8c13157e4a6f5ce6da683d4cf2ec4db78eb3e43d84faa24e66fc9aa4d023c9","sha256:83cb2dc54f8b6ba28c3a900e24ce39e761b96fdba7daa200117587f1ff9937c9"],"state_sha256":"002b978a0f7ecd855fc496195860bb8c4e0ee2d3b52736c82f9071f1e61c49d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVZSrsz5TBf5xORUHKnOxzolkZutF3MqMvaTuxZOawNZF0jMwRkSZ4Zkv/7rikXK+HEorlRKLawR2ezkf/O2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T18:19:14.310170Z","bundle_sha256":"9f30bb859b24d078f0d98b7646c23841c4e554373a1f914581237e634c484664"}}