{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3MGTDXIN25NRBO5EGJPRVSTS4P","short_pith_number":"pith:3MGTDXIN","schema_version":"1.0","canonical_sha256":"db0d31dd0dd75b10bba4325f1aca72e3e4a1566a44c55b895ff1808fdf99c663","source":{"kind":"arxiv","id":"2206.07250","version":1},"attestation_state":"computed","paper":{"title":"Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Max Ovsiankin, Naren Sarayu Manoj, Yury Makarychev","submitted_at":"2022-06-15T02:22:09Z","abstract_excerpt":"We give efficient deterministic one-pass streaming algorithms for finding an ellipsoidal approximation of a symmetric convex polytope. The algorithms are near-optimal in that their approximation factors differ from that of the optimal offline solution only by a factor sub-logarithmic in the aspect ratio of the polytope."},"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":"2206.07250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-06-15T02:22:09Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f59ba22dc2f99692f0ca188d339a63ab579c578b1f54581e5fe921fbbe9774af","abstract_canon_sha256":"5458e071a9338c1c00c9a4792089dc8800c2fbbaf452b19f2526f574292df69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:02.691585Z","signature_b64":"B0MlKkL5sGmvsutIFJTZ1Vv0sANSY2KNFlzW1eVriOCfzu5snK3iS+w6EOzxfuoxPNYz1erWCOZFkcM5q96fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db0d31dd0dd75b10bba4325f1aca72e3e4a1566a44c55b895ff1808fdf99c663","last_reissued_at":"2026-07-05T04:32:02.691169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:02.691169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Max Ovsiankin, Naren Sarayu Manoj, Yury Makarychev","submitted_at":"2022-06-15T02:22:09Z","abstract_excerpt":"We give efficient deterministic one-pass streaming algorithms for finding an ellipsoidal approximation of a symmetric convex polytope. The algorithms are near-optimal in that their approximation factors differ from that of the optimal offline solution only by a factor sub-logarithmic in the aspect ratio of the polytope."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07250","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/2206.07250/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":"2206.07250","created_at":"2026-07-05T04:32:02.691225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07250v1","created_at":"2026-07-05T04:32:02.691225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07250","created_at":"2026-07-05T04:32:02.691225+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MGTDXIN25NR","created_at":"2026-07-05T04:32:02.691225+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MGTDXIN25NRBO5E","created_at":"2026-07-05T04:32:02.691225+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MGTDXIN","created_at":"2026-07-05T04:32:02.691225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16270","citing_title":"A Geometric Approach to Problems in Optimization and Data Science","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P","json":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P.json","graph_json":"https://pith.science/api/pith-number/3MGTDXIN25NRBO5EGJPRVSTS4P/graph.json","events_json":"https://pith.science/api/pith-number/3MGTDXIN25NRBO5EGJPRVSTS4P/events.json","paper":"https://pith.science/paper/3MGTDXIN"},"agent_actions":{"view_html":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P","download_json":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P.json","view_paper":"https://pith.science/paper/3MGTDXIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07250&json=true","fetch_graph":"https://pith.science/api/pith-number/3MGTDXIN25NRBO5EGJPRVSTS4P/graph.json","fetch_events":"https://pith.science/api/pith-number/3MGTDXIN25NRBO5EGJPRVSTS4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P/action/storage_attestation","attest_author":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P/action/author_attestation","sign_citation":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P/action/citation_signature","submit_replication":"https://pith.science/pith/3MGTDXIN25NRBO5EGJPRVSTS4P/action/replication_record"}},"created_at":"2026-07-05T04:32:02.691225+00:00","updated_at":"2026-07-05T04:32:02.691225+00:00"}