{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RCHSW64P2ULK3VKA4WXCOUUZ6S","short_pith_number":"pith:RCHSW64P","schema_version":"1.0","canonical_sha256":"888f2b7b8fd516add540e5ae275299f492b69528c878c202d474c34eb5a57ffb","source":{"kind":"arxiv","id":"1309.7084","version":1},"attestation_state":"computed","paper":{"title":"How good is the Chord algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis","submitted_at":"2013-09-26T22:44:21Z","abstract_excerpt":"The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and graphics. We analyze the performance of the Chord algorithm, as compared to the optimal approximation that achieves a desired accuracy with the minimum number of points. We prove sharp upper and lower bounds, both in the worst case and average case setting."},"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":"1309.7084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-26T22:44:21Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5cef6e78d5312dc30dec55446c264120913158354c7c9703700d5c4200847dd4","abstract_canon_sha256":"c774382fb99ec34cbd9d9664b8091e161a9d735b30269ff63cb3e676e5571b21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:08.106899Z","signature_b64":"YwgxQqeYfBmgneqV9NfDKKuEgPSnO1vxcteI4phu1dBY2EB/yxEZLPq6S/EW2FPe4Hq/dAiG0yzOtipehiSqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888f2b7b8fd516add540e5ae275299f492b69528c878c202d474c34eb5a57ffb","last_reissued_at":"2026-05-18T03:12:08.106123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:08.106123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How good is the Chord algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis","submitted_at":"2013-09-26T22:44:21Z","abstract_excerpt":"The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and graphics. We analyze the performance of the Chord algorithm, as compared to the optimal approximation that achieves a desired accuracy with the minimum number of points. We prove sharp upper and lower bounds, both in the worst case and average case setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7084","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":"1309.7084","created_at":"2026-05-18T03:12:08.106274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7084v1","created_at":"2026-05-18T03:12:08.106274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7084","created_at":"2026-05-18T03:12:08.106274+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCHSW64P2ULK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCHSW64P2ULK3VKA","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCHSW64P","created_at":"2026-05-18T12:27:57.521954+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/RCHSW64P2ULK3VKA4WXCOUUZ6S","json":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S.json","graph_json":"https://pith.science/api/pith-number/RCHSW64P2ULK3VKA4WXCOUUZ6S/graph.json","events_json":"https://pith.science/api/pith-number/RCHSW64P2ULK3VKA4WXCOUUZ6S/events.json","paper":"https://pith.science/paper/RCHSW64P"},"agent_actions":{"view_html":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S","download_json":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S.json","view_paper":"https://pith.science/paper/RCHSW64P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7084&json=true","fetch_graph":"https://pith.science/api/pith-number/RCHSW64P2ULK3VKA4WXCOUUZ6S/graph.json","fetch_events":"https://pith.science/api/pith-number/RCHSW64P2ULK3VKA4WXCOUUZ6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S/action/storage_attestation","attest_author":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S/action/author_attestation","sign_citation":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S/action/citation_signature","submit_replication":"https://pith.science/pith/RCHSW64P2ULK3VKA4WXCOUUZ6S/action/replication_record"}},"created_at":"2026-05-18T03:12:08.106274+00:00","updated_at":"2026-05-18T03:12:08.106274+00:00"}