{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZVC4MDHCERZPWVQHPB5PJKS5RE","short_pith_number":"pith:ZVC4MDHC","schema_version":"1.0","canonical_sha256":"cd45c60ce22472fb5607787af4aa5d892b1398306b8ba82afa2f9abfb376e04a","source":{"kind":"arxiv","id":"1908.04091","version":1},"attestation_state":"computed","paper":{"title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Trevor Squires, Yuyuan Ouyang","submitted_at":"2019-08-12T11:17:45Z","abstract_excerpt":"We present in this paper some worst-case datasets of deterministic first-order methods for solving large-scale binary logistic regression problems. Under the assumption that the number of algorithm iterations is much smaller than the problem dimension, with our worst-case datasets it requires at least $\\mathcal{O}(1/\\sqrt{\\varepsilon})$ first-order oracle inquiries to compute an $\\varepsilon$-approximate solution. From traditional iteration complexity analysis point of view, the binary logistic regression loss functions with our worst-case datasets are new worst-case function instances among t"},"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":"1908.04091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-12T11:17:45Z","cross_cats_sorted":[],"title_canon_sha256":"b9671c0887f18249474f9d4d8e133afccfef792de456ff48238f0abe516ef4fb","abstract_canon_sha256":"5f20d70c40394782389b1ed04d304a8eb5bffdc8f5fc842feb1f9378678e2bfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:20.648218Z","signature_b64":"aJj6kkI0pmhRUrNzaqgUF1Lk2RjU9MtWFXxjsb7yhL/vn3ah/zauy1Q50a7AjxtlYULye7ASAZ2NDWHVENgdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd45c60ce22472fb5607787af4aa5d892b1398306b8ba82afa2f9abfb376e04a","last_reissued_at":"2026-07-04T23:53:20.647814Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:20.647814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Trevor Squires, Yuyuan Ouyang","submitted_at":"2019-08-12T11:17:45Z","abstract_excerpt":"We present in this paper some worst-case datasets of deterministic first-order methods for solving large-scale binary logistic regression problems. Under the assumption that the number of algorithm iterations is much smaller than the problem dimension, with our worst-case datasets it requires at least $\\mathcal{O}(1/\\sqrt{\\varepsilon})$ first-order oracle inquiries to compute an $\\varepsilon$-approximate solution. From traditional iteration complexity analysis point of view, the binary logistic regression loss functions with our worst-case datasets are new worst-case function instances among t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04091","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/1908.04091/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":"1908.04091","created_at":"2026-07-04T23:53:20.647873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04091v1","created_at":"2026-07-04T23:53:20.647873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04091","created_at":"2026-07-04T23:53:20.647873+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVC4MDHCERZP","created_at":"2026-07-04T23:53:20.647873+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVC4MDHCERZPWVQH","created_at":"2026-07-04T23:53:20.647873+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVC4MDHC","created_at":"2026-07-04T23:53:20.647873+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/ZVC4MDHCERZPWVQHPB5PJKS5RE","json":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE.json","graph_json":"https://pith.science/api/pith-number/ZVC4MDHCERZPWVQHPB5PJKS5RE/graph.json","events_json":"https://pith.science/api/pith-number/ZVC4MDHCERZPWVQHPB5PJKS5RE/events.json","paper":"https://pith.science/paper/ZVC4MDHC"},"agent_actions":{"view_html":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE","download_json":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE.json","view_paper":"https://pith.science/paper/ZVC4MDHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04091&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVC4MDHCERZPWVQHPB5PJKS5RE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVC4MDHCERZPWVQHPB5PJKS5RE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE/action/storage_attestation","attest_author":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE/action/author_attestation","sign_citation":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE/action/citation_signature","submit_replication":"https://pith.science/pith/ZVC4MDHCERZPWVQHPB5PJKS5RE/action/replication_record"}},"created_at":"2026-07-04T23:53:20.647873+00:00","updated_at":"2026-07-04T23:53:20.647873+00:00"}