{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5XDML4NZK2A77572LBCDBHWY6A","short_pith_number":"pith:5XDML4NZ","schema_version":"1.0","canonical_sha256":"edc6c5f1b95681fff7fa5844309ed8f01ff6ee7b09ad6db2440b9dc303ede46f","source":{"kind":"arxiv","id":"2605.21232","version":1},"attestation_state":"computed","paper":{"title":"On the nonnegative rank of positive operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Marko Kandi\\'c, Roman Drnov\\v{s}ek","submitted_at":"2026-05-20T14:22:59Z","abstract_excerpt":"In this paper we introduce the concept of a nonnegative rank of a positive operator $T\\colon X\\to Y$ between ordered vector spaces. In the case of nonnegative matrices, our definition agrees with the standard definition of a nonnegative rank. Under some natural and mild assumptions on the cone $Y_+$, we prove that the nonnegative rank and the rank agree whenever the rank is at most two. This can be considered as the infinite-dimensional version of \\cite[Theorem 4.1]{CR93}. We also provide an example of a positive rank-three operator on the Banach lattice $C[0,1]$ with an infinite nonnegative r"},"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":"2605.21232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2026-05-20T14:22:59Z","cross_cats_sorted":[],"title_canon_sha256":"cd8ef977f2aa1ae8a9743e7eebfad6831f7175f7c389bba8abec7fbe60509867","abstract_canon_sha256":"b609856d7bb6a39eab93141edd4dfb5f60bffe54fddb1ad46c2d4f67eb41dc2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:44.726703Z","signature_b64":"q16ejsKn/AweOJxZpQnITcpIkbhILwGAnV3rR20slmfkI7m7ClPPs0NO7LInNKzOXbDywJbqjsY0w0KeYgxZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edc6c5f1b95681fff7fa5844309ed8f01ff6ee7b09ad6db2440b9dc303ede46f","last_reissued_at":"2026-05-21T01:05:44.726034Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:44.726034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the nonnegative rank of positive operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Marko Kandi\\'c, Roman Drnov\\v{s}ek","submitted_at":"2026-05-20T14:22:59Z","abstract_excerpt":"In this paper we introduce the concept of a nonnegative rank of a positive operator $T\\colon X\\to Y$ between ordered vector spaces. In the case of nonnegative matrices, our definition agrees with the standard definition of a nonnegative rank. Under some natural and mild assumptions on the cone $Y_+$, we prove that the nonnegative rank and the rank agree whenever the rank is at most two. This can be considered as the infinite-dimensional version of \\cite[Theorem 4.1]{CR93}. We also provide an example of a positive rank-three operator on the Banach lattice $C[0,1]$ with an infinite nonnegative r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21232","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21232/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21232","created_at":"2026-05-21T01:05:44.726160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21232v1","created_at":"2026-05-21T01:05:44.726160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21232","created_at":"2026-05-21T01:05:44.726160+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XDML4NZK2A7","created_at":"2026-05-21T01:05:44.726160+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XDML4NZK2A77572","created_at":"2026-05-21T01:05:44.726160+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XDML4NZ","created_at":"2026-05-21T01:05:44.726160+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/5XDML4NZK2A77572LBCDBHWY6A","json":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A.json","graph_json":"https://pith.science/api/pith-number/5XDML4NZK2A77572LBCDBHWY6A/graph.json","events_json":"https://pith.science/api/pith-number/5XDML4NZK2A77572LBCDBHWY6A/events.json","paper":"https://pith.science/paper/5XDML4NZ"},"agent_actions":{"view_html":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A","download_json":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A.json","view_paper":"https://pith.science/paper/5XDML4NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21232&json=true","fetch_graph":"https://pith.science/api/pith-number/5XDML4NZK2A77572LBCDBHWY6A/graph.json","fetch_events":"https://pith.science/api/pith-number/5XDML4NZK2A77572LBCDBHWY6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A/action/storage_attestation","attest_author":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A/action/author_attestation","sign_citation":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A/action/citation_signature","submit_replication":"https://pith.science/pith/5XDML4NZK2A77572LBCDBHWY6A/action/replication_record"}},"created_at":"2026-05-21T01:05:44.726160+00:00","updated_at":"2026-05-21T01:05:44.726160+00:00"}