{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SJACX2SUYKAESHS5XUCTQBQRLM","short_pith_number":"pith:SJACX2SU","schema_version":"1.0","canonical_sha256":"92402bea54c280491e5dbd053806115b1e8e166f5453710b96a5aaf93782747a","source":{"kind":"arxiv","id":"1608.07170","version":1},"attestation_state":"computed","paper":{"title":"A bound on the Carath\\'eodory number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bruno F. Louren\\c{c}o, Masaru Ito","submitted_at":"2016-08-25T14:27:45Z","abstract_excerpt":"The Carath\\'eodory number k(K) of a pointed closed convex cone K is the minimum among all the k for which every element of K can be written as a nonnegative linear combination of at most k elements belonging to extreme rays. Carath\\'eodory's Theorem gives the bound k(K) <= dim (K). In this work we observe that this bound can be sharpened to k(K) <= l-1, where l is the length of the longest chain of nonempty faces contained in K, thus tying the Carath\\'eodory number with a key quantity that appears in the analysis of facial reduction algorithms. We show that this bound is tight for several fami"},"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":"1608.07170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-25T14:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"3d914967be3044db90265d0e8a6478110408180470defe953f19e6b66108ed1f","abstract_canon_sha256":"43ee1832442802ad750274d0954fdf7b1b9a7971514d6874ab5a31199a1e53ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:54.643950Z","signature_b64":"QkrHiZt5vqWYdeQcsnP3fTsi5m7upb9AmS/C7XptQYGpVRZ82nOYKLyFqUACsikiktK0w2XXa8nM72c6gLPMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92402bea54c280491e5dbd053806115b1e8e166f5453710b96a5aaf93782747a","last_reissued_at":"2026-05-18T01:07:54.643543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:54.643543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bound on the Carath\\'eodory number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bruno F. Louren\\c{c}o, Masaru Ito","submitted_at":"2016-08-25T14:27:45Z","abstract_excerpt":"The Carath\\'eodory number k(K) of a pointed closed convex cone K is the minimum among all the k for which every element of K can be written as a nonnegative linear combination of at most k elements belonging to extreme rays. Carath\\'eodory's Theorem gives the bound k(K) <= dim (K). In this work we observe that this bound can be sharpened to k(K) <= l-1, where l is the length of the longest chain of nonempty faces contained in K, thus tying the Carath\\'eodory number with a key quantity that appears in the analysis of facial reduction algorithms. We show that this bound is tight for several fami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07170","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":"1608.07170","created_at":"2026-05-18T01:07:54.643604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07170v1","created_at":"2026-05-18T01:07:54.643604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07170","created_at":"2026-05-18T01:07:54.643604+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJACX2SUYKAE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJACX2SUYKAESHS5","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJACX2SU","created_at":"2026-05-18T12:30:44.179134+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/SJACX2SUYKAESHS5XUCTQBQRLM","json":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM.json","graph_json":"https://pith.science/api/pith-number/SJACX2SUYKAESHS5XUCTQBQRLM/graph.json","events_json":"https://pith.science/api/pith-number/SJACX2SUYKAESHS5XUCTQBQRLM/events.json","paper":"https://pith.science/paper/SJACX2SU"},"agent_actions":{"view_html":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM","download_json":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM.json","view_paper":"https://pith.science/paper/SJACX2SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07170&json=true","fetch_graph":"https://pith.science/api/pith-number/SJACX2SUYKAESHS5XUCTQBQRLM/graph.json","fetch_events":"https://pith.science/api/pith-number/SJACX2SUYKAESHS5XUCTQBQRLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM/action/storage_attestation","attest_author":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM/action/author_attestation","sign_citation":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM/action/citation_signature","submit_replication":"https://pith.science/pith/SJACX2SUYKAESHS5XUCTQBQRLM/action/replication_record"}},"created_at":"2026-05-18T01:07:54.643604+00:00","updated_at":"2026-05-18T01:07:54.643604+00:00"}