{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CAU32FEO3VXVFJ6YC2QAP5DJNJ","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":"dfbdfd01716151d592197bedc3959503a9a25a53c1f73300cd01479e8975e0e8","cross_cats_sorted":["math.CA","math.DS","math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2025-06-27T15:51:22Z","title_canon_sha256":"3cd8f06265c342612020be42eddaa841831f894b7d2e7de9888f8064fcda875e"},"schema_version":"1.0","source":{"id":"2506.22341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22341","created_at":"2026-07-05T11:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22341v1","created_at":"2026-07-05T11:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22341","created_at":"2026-07-05T11:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"CAU32FEO3VXV","created_at":"2026-07-05T11:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CAU32FEO3VXVFJ6Y","created_at":"2026-07-05T11:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CAU32FEO","created_at":"2026-07-05T11:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:ac3a57c694c4607d79c5c95e16269cfdec28223cfe534f14556296b6266f92f2","target":"graph","created_at":"2026-07-05T11:28:25Z","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/2506.22341/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a continuous linear operator $T:X\\to X$, where $X$ is a topological vector space, let $\\mathrm{UFHC}(T)$ be the set of upper frequently hypercyclic vectors, that is, the set of vectors $x \\in X$ such that $\\{n \\in \\omega: T^nx \\in U\\}$ has positive upper asymptotic density for all nonempty open sets $U\\subseteq X$. It is known that $\\mathrm{UFHC}(T)$ is a $G_{\\delta\\sigma\\delta}$-set which is either empty or contains a dense $G_{\\delta}$-set. Using a purely topological proof, we improve it by showing that $\\mathrm{UFHC}(T)$ is always a $G_{\\delta\\sigma}$-set.\n  Bonilla and Grosse-Erdmann","authors_text":"Paolo Leonetti, Szymon Glab","cross_cats":["math.CA","math.DS","math.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2025-06-27T15:51:22Z","title":"On the complexity of upper frequently hypercyclic vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22341","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:dc0eb6e0854c99bbbff2be7a09de5d6e3658bb0a08a8d851936598ac9d489382","target":"record","created_at":"2026-07-05T11:28:25Z","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":"dfbdfd01716151d592197bedc3959503a9a25a53c1f73300cd01479e8975e0e8","cross_cats_sorted":["math.CA","math.DS","math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2025-06-27T15:51:22Z","title_canon_sha256":"3cd8f06265c342612020be42eddaa841831f894b7d2e7de9888f8064fcda875e"},"schema_version":"1.0","source":{"id":"2506.22341","kind":"arxiv","version":1}},"canonical_sha256":"1029bd148edd6f52a7d816a007f4696a6fa44b085956bd6f5f868505c6107634","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1029bd148edd6f52a7d816a007f4696a6fa44b085956bd6f5f868505c6107634","first_computed_at":"2026-07-05T11:28:25.506636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:25.506636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LGaaUZ9+XM6F2gAmRcLw1jxb+V/sfQ2mPCeWAXtB9SFMD8cMmhUGmbGY/yD4Ndp6+ZYvaViwgagjbhYByFTVBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:25.507109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.22341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0eb6e0854c99bbbff2be7a09de5d6e3658bb0a08a8d851936598ac9d489382","sha256:ac3a57c694c4607d79c5c95e16269cfdec28223cfe534f14556296b6266f92f2"],"state_sha256":"e7eb893634e12ba4b22b2135703445c56397e166279c4ee57d0b60ab5ac2de71"}