{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2I7C5NBMJT7UOPIGHETRWIHXPL","short_pith_number":"pith:2I7C5NBM","schema_version":"1.0","canonical_sha256":"d23e2eb42c4cff473d0639271b20f77ae34aa55983d905a54dd5b9fbc979990e","source":{"kind":"arxiv","id":"1609.06869","version":1},"attestation_state":"computed","paper":{"title":"On the denseness of minimum attaining operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"G. Ramesh, S. H. Kulkarni","submitted_at":"2016-09-22T08:38:11Z","abstract_excerpt":"Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\\epsilon>0$, there exists a bounded operator $S$ with $\\|S\\|\\leq \\epsilon$ such that $T+S$ is minimum attaining. Further, if $T$ is bounded below, then $S$ can be chosen to be rank one."},"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":"1609.06869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-09-22T08:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"41e1efc4d9376444dc74f5ce81c78f5ed68019308fe58d373d2cf391d2c94f3e","abstract_canon_sha256":"69faacd913ea6d938ba0a9c3b860688d18def38d1b8408560e1c202851d7a8ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:04.909748Z","signature_b64":"qy51P4C+O8XnOFQB9fuAlZiZdowP/37Mgv2yNpibarlfC5Eq2FqIqITotNL408Pi5gceYmDHPW1FDV6LgpYzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d23e2eb42c4cff473d0639271b20f77ae34aa55983d905a54dd5b9fbc979990e","last_reissued_at":"2026-05-18T01:04:04.909276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:04.909276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the denseness of minimum attaining operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"G. Ramesh, S. H. Kulkarni","submitted_at":"2016-09-22T08:38:11Z","abstract_excerpt":"Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\\epsilon>0$, there exists a bounded operator $S$ with $\\|S\\|\\leq \\epsilon$ such that $T+S$ is minimum attaining. Further, if $T$ is bounded below, then $S$ can be chosen to be rank one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06869","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":"1609.06869","created_at":"2026-05-18T01:04:04.909360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06869v1","created_at":"2026-05-18T01:04:04.909360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06869","created_at":"2026-05-18T01:04:04.909360+00:00"},{"alias_kind":"pith_short_12","alias_value":"2I7C5NBMJT7U","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2I7C5NBMJT7UOPIG","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2I7C5NBM","created_at":"2026-05-18T12:29:55.572404+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/2I7C5NBMJT7UOPIGHETRWIHXPL","json":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL.json","graph_json":"https://pith.science/api/pith-number/2I7C5NBMJT7UOPIGHETRWIHXPL/graph.json","events_json":"https://pith.science/api/pith-number/2I7C5NBMJT7UOPIGHETRWIHXPL/events.json","paper":"https://pith.science/paper/2I7C5NBM"},"agent_actions":{"view_html":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL","download_json":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL.json","view_paper":"https://pith.science/paper/2I7C5NBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06869&json=true","fetch_graph":"https://pith.science/api/pith-number/2I7C5NBMJT7UOPIGHETRWIHXPL/graph.json","fetch_events":"https://pith.science/api/pith-number/2I7C5NBMJT7UOPIGHETRWIHXPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL/action/storage_attestation","attest_author":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL/action/author_attestation","sign_citation":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL/action/citation_signature","submit_replication":"https://pith.science/pith/2I7C5NBMJT7UOPIGHETRWIHXPL/action/replication_record"}},"created_at":"2026-05-18T01:04:04.909360+00:00","updated_at":"2026-05-18T01:04:04.909360+00:00"}