{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7LRWBIV6GND6ZFS2NHPG2FYK4P","short_pith_number":"pith:7LRWBIV6","schema_version":"1.0","canonical_sha256":"fae360a2be3347ec965a69de6d170ae3dbddf49a17d899f3528e9e51751b5709","source":{"kind":"arxiv","id":"1105.2169","version":1},"attestation_state":"computed","paper":{"title":"Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dennis Cheung, Felipe Cucker","submitted_at":"2011-05-11T12:11:11Z","abstract_excerpt":"We prove an O(log n) bound for the expectation of the logarithm of the condition number K for the computation of optimizers of linear programs."},"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":"1105.2169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T12:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"648ca65c3cd277d4d27a782f3126acd5abb30fe5cdb5145598825d813f819240","abstract_canon_sha256":"fff957d0fd0c883e82f86f2799a1a76d359efda647a5eb50d047ad68e48781de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:21.376310Z","signature_b64":"X6GJQ68+QdrmRFH+CSxFgZ8qtaKZpK9LxFNp8ym2udBepRuSnaGW4ln5h7EDoLE+ZqDDq6Mw5x1VM2k8meXpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae360a2be3347ec965a69de6d170ae3dbddf49a17d899f3528e9e51751b5709","last_reissued_at":"2026-05-18T04:22:21.375680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:21.375680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dennis Cheung, Felipe Cucker","submitted_at":"2011-05-11T12:11:11Z","abstract_excerpt":"We prove an O(log n) bound for the expectation of the logarithm of the condition number K for the computation of optimizers of linear programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2169","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":"1105.2169","created_at":"2026-05-18T04:22:21.375765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2169v1","created_at":"2026-05-18T04:22:21.375765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2169","created_at":"2026-05-18T04:22:21.375765+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LRWBIV6GND6","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LRWBIV6GND6ZFS2","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LRWBIV6","created_at":"2026-05-18T12:26:22.705136+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/7LRWBIV6GND6ZFS2NHPG2FYK4P","json":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P.json","graph_json":"https://pith.science/api/pith-number/7LRWBIV6GND6ZFS2NHPG2FYK4P/graph.json","events_json":"https://pith.science/api/pith-number/7LRWBIV6GND6ZFS2NHPG2FYK4P/events.json","paper":"https://pith.science/paper/7LRWBIV6"},"agent_actions":{"view_html":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P","download_json":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P.json","view_paper":"https://pith.science/paper/7LRWBIV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2169&json=true","fetch_graph":"https://pith.science/api/pith-number/7LRWBIV6GND6ZFS2NHPG2FYK4P/graph.json","fetch_events":"https://pith.science/api/pith-number/7LRWBIV6GND6ZFS2NHPG2FYK4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P/action/storage_attestation","attest_author":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P/action/author_attestation","sign_citation":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P/action/citation_signature","submit_replication":"https://pith.science/pith/7LRWBIV6GND6ZFS2NHPG2FYK4P/action/replication_record"}},"created_at":"2026-05-18T04:22:21.375765+00:00","updated_at":"2026-05-18T04:22:21.375765+00:00"}