{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TMPQIXR7DUUQZ7DLWYLJXRR57S","short_pith_number":"pith:TMPQIXR7","schema_version":"1.0","canonical_sha256":"9b1f045e3f1d290cfc6bb6169bc63dfc8fdcd5062ee04fa0a646231638292a04","source":{"kind":"arxiv","id":"2004.10358","version":2},"attestation_state":"computed","paper":{"title":"Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Sun, Danny H.K. Tsang, Ying Cao","submitted_at":"2020-04-22T01:34:22Z","abstract_excerpt":"We study two canonical online optimization problems under capacity/budget constraints: the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) under an infinitesimal assumption. Under the competitive analysis framework, it is well-known that both problems have the same optimal competitive ratio. However, these two problems are investigated by distinct approaches under separate contexts in the literature. There is a gap in understanding the connection between these two problems and the nature of their online algorithm design. This paper provides a unified fra"},"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":"2004.10358","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-22T01:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"7eb4f5cd77f14bb3aad6bb5fe3d3c794a87f936d84fa13b134c2f409c1512fff","abstract_canon_sha256":"24d72e6929c24e39d38d48db9a632881a001cbbb68785f854f199dbe3ae623d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:09.014642Z","signature_b64":"U3H8VU0/rbthyVC/JZ2I1QEc5aTeNAz1przdEDqM7gsknILg/SOjC0+L2LsGHe+JbIFi7IDxq7W9LJctwCq4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1f045e3f1d290cfc6bb6169bc63dfc8fdcd5062ee04fa0a646231638292a04","last_reissued_at":"2026-07-05T01:37:09.014241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:09.014241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Sun, Danny H.K. Tsang, Ying Cao","submitted_at":"2020-04-22T01:34:22Z","abstract_excerpt":"We study two canonical online optimization problems under capacity/budget constraints: the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) under an infinitesimal assumption. Under the competitive analysis framework, it is well-known that both problems have the same optimal competitive ratio. However, these two problems are investigated by distinct approaches under separate contexts in the literature. There is a gap in understanding the connection between these two problems and the nature of their online algorithm design. This paper provides a unified fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.10358","kind":"arxiv","version":2},"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/2004.10358/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":"2004.10358","created_at":"2026-07-05T01:37:09.014294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.10358v2","created_at":"2026-07-05T01:37:09.014294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.10358","created_at":"2026-07-05T01:37:09.014294+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMPQIXR7DUUQ","created_at":"2026-07-05T01:37:09.014294+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMPQIXR7DUUQZ7DL","created_at":"2026-07-05T01:37:09.014294+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMPQIXR7","created_at":"2026-07-05T01:37:09.014294+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/TMPQIXR7DUUQZ7DLWYLJXRR57S","json":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S.json","graph_json":"https://pith.science/api/pith-number/TMPQIXR7DUUQZ7DLWYLJXRR57S/graph.json","events_json":"https://pith.science/api/pith-number/TMPQIXR7DUUQZ7DLWYLJXRR57S/events.json","paper":"https://pith.science/paper/TMPQIXR7"},"agent_actions":{"view_html":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S","download_json":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S.json","view_paper":"https://pith.science/paper/TMPQIXR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.10358&json=true","fetch_graph":"https://pith.science/api/pith-number/TMPQIXR7DUUQZ7DLWYLJXRR57S/graph.json","fetch_events":"https://pith.science/api/pith-number/TMPQIXR7DUUQZ7DLWYLJXRR57S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S/action/storage_attestation","attest_author":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S/action/author_attestation","sign_citation":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S/action/citation_signature","submit_replication":"https://pith.science/pith/TMPQIXR7DUUQZ7DLWYLJXRR57S/action/replication_record"}},"created_at":"2026-07-05T01:37:09.014294+00:00","updated_at":"2026-07-05T01:37:09.014294+00:00"}