{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UQS4KUAPRQMTT5EYB2N43TEV3I","short_pith_number":"pith:UQS4KUAP","schema_version":"1.0","canonical_sha256":"a425c5500f8c1939f4980e9bcdcc95da23f50fc5c6b14e439e4021352f66b83c","source":{"kind":"arxiv","id":"1206.5568","version":1},"attestation_state":"computed","paper":{"title":"Isometric tuples are hyperreflexive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OA","authors_text":"Adam H. Fuller, Matthew Kennedy","submitted_at":"2012-06-25T03:34:24Z","abstract_excerpt":"An $n$-tuple of operators $(V_1,...,V_n)$ acting on a Hilbert space $H$ is said to be isometric if the row operator $(V_1,...,V_n) : H^n \\to H$ is an isometry. We prove that every isometric $n$-tuple is hyperreflexive, in the sense of Arveson. For $n = 1$, the hyperreflexivity constant is at most 95. For $n \\geq 2$, the hyperreflexivity constant is at most 6."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1206.5568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2012-06-25T03:34:24Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"16098ff02809b084fa68c1a03b45983d328c2ba98ac420e76f2d9a4b47994a00","abstract_canon_sha256":"6807360450636b42794b7a87478764e884d44a2dc9f165ada1a0a02049e5700d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:17.072974Z","signature_b64":"VhzEtLOdA5MKATn8ihj+td8xLKxX+TfAOZI4FUBU6UIZo3AUbUaBJfpondJYfxac8zM/AgRNO1bqIGns9IAICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a425c5500f8c1939f4980e9bcdcc95da23f50fc5c6b14e439e4021352f66b83c","last_reissued_at":"2026-05-18T01:33:17.072481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:17.072481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isometric tuples are hyperreflexive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OA","authors_text":"Adam H. Fuller, Matthew Kennedy","submitted_at":"2012-06-25T03:34:24Z","abstract_excerpt":"An $n$-tuple of operators $(V_1,...,V_n)$ acting on a Hilbert space $H$ is said to be isometric if the row operator $(V_1,...,V_n) : H^n \\to H$ is an isometry. We prove that every isometric $n$-tuple is hyperreflexive, in the sense of Arveson. For $n = 1$, the hyperreflexivity constant is at most 95. For $n \\geq 2$, the hyperreflexivity constant is at most 6."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5568","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5568","created_at":"2026-05-18T01:33:17.072544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5568v1","created_at":"2026-05-18T01:33:17.072544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5568","created_at":"2026-05-18T01:33:17.072544+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQS4KUAPRQMT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQS4KUAPRQMTT5EY","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQS4KUAP","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I","json":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I.json","graph_json":"https://pith.science/api/pith-number/UQS4KUAPRQMTT5EYB2N43TEV3I/graph.json","events_json":"https://pith.science/api/pith-number/UQS4KUAPRQMTT5EYB2N43TEV3I/events.json","paper":"https://pith.science/paper/UQS4KUAP"},"agent_actions":{"view_html":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I","download_json":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I.json","view_paper":"https://pith.science/paper/UQS4KUAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5568&json=true","fetch_graph":"https://pith.science/api/pith-number/UQS4KUAPRQMTT5EYB2N43TEV3I/graph.json","fetch_events":"https://pith.science/api/pith-number/UQS4KUAPRQMTT5EYB2N43TEV3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I/action/storage_attestation","attest_author":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I/action/author_attestation","sign_citation":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I/action/citation_signature","submit_replication":"https://pith.science/pith/UQS4KUAPRQMTT5EYB2N43TEV3I/action/replication_record"}},"created_at":"2026-05-18T01:33:17.072544+00:00","updated_at":"2026-05-18T01:33:17.072544+00:00"}