{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:4TK5KDNQYOAS4EE4SLZ5P5KW4H","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":"9bc77bb1fde91d3958740cbbd3908fd9448b1b4569c6f12749616ece24ead836","cross_cats_sorted":[],"license":"","primary_cat":"math.FA","submitted_at":"1995-09-27T00:00:00Z","title_canon_sha256":"d513e9900552bb353e7ae713313b80e840a71af1b772d41faa357c6365dcc34c"},"schema_version":"1.0","source":{"id":"math/9509217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9509217","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"math/9509217v1","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9509217","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"4TK5KDNQYOAS","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"4TK5KDNQYOAS4EE4","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"4TK5KDNQ","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:0e14a6949c4af95bdfc00303f0fcc579e4c51025e6bf5174edcc876de8bfafa9","target":"graph","created_at":"2026-05-18T01:05:48Z","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":"Trees are very agreeable objects to work with, offering a diversity of behaviour within a structure that is sufficiently simple to admit precise analysis. Thus we are able to offer fairly satisfactory necessary and sufficient conditions on a tree $\\Upsilon $ for the existence of equivalent LUR or strictly convex norms on $\\C_0(\\Upsilon )$ and for norms with the Kadec Property. In particular, we show that for a {\\sl finitely branching} tree $\\Upsilon $ the space $\\C_0(\\Upsilon )$ admits a Kadec renorming. Since some finitely branching trees fail the condition for strictly convex renormability, ","authors_text":"Richard Haydon","cross_cats":[],"headline":"","license":"","primary_cat":"math.FA","submitted_at":"1995-09-27T00:00:00Z","title":"Trees in renorming theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9509217","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:571a17cfff4255104ecb5b41ed3aea4bc2d05fdcbada5d4e385aee7a831c69e3","target":"record","created_at":"2026-05-18T01:05:48Z","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":"9bc77bb1fde91d3958740cbbd3908fd9448b1b4569c6f12749616ece24ead836","cross_cats_sorted":[],"license":"","primary_cat":"math.FA","submitted_at":"1995-09-27T00:00:00Z","title_canon_sha256":"d513e9900552bb353e7ae713313b80e840a71af1b772d41faa357c6365dcc34c"},"schema_version":"1.0","source":{"id":"math/9509217","kind":"arxiv","version":1}},"canonical_sha256":"e4d5d50db0c3812e109c92f3d7f556e1f668e435736eb336f6558ba33cf40290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4d5d50db0c3812e109c92f3d7f556e1f668e435736eb336f6558ba33cf40290","first_computed_at":"2026-05-18T01:05:48.319923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:48.319923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Y8MMJrNT/p7UjH1rLstN2huECqOUtxd7tGjvIfVNYoeUJE4Tr6n5FreWN1C2iD9MGpnDyprmejj4VgMn8P7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:48.320518Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9509217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:571a17cfff4255104ecb5b41ed3aea4bc2d05fdcbada5d4e385aee7a831c69e3","sha256:0e14a6949c4af95bdfc00303f0fcc579e4c51025e6bf5174edcc876de8bfafa9"],"state_sha256":"fe908d7b74bdcfb56c18690f76161002a707fc6c243578c13155c5e08ed4a0bb"}