{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCH2UKU76KYFVCFE4NACE366TA","short_pith_number":"pith:XCH2UKU7","schema_version":"1.0","canonical_sha256":"b88faa2a9ff2b05a88a4e340226fde982bb1b48c3d527eba269c5b102afe760d","source":{"kind":"arxiv","id":"1702.04538","version":1},"attestation_state":"computed","paper":{"title":"A core-set approach for distributed quadratic programming in big-data classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Giuseppe Notarstefano","submitted_at":"2017-02-15T10:36:05Z","abstract_excerpt":"A new challenge for learning algorithms in cyber-physical network systems is the distributed solution of big-data classification problems, i.e., problems in which both the number of training samples and their dimension is high. Motivated by several problem set-ups in Machine Learning, in this paper we consider a special class of quadratic optimization problems involving a \"large\" number of input data, whose dimension is \"big\". To solve these quadratic optimization problems over peer-to-peer networks, we propose an asynchronous, distributed algorithm that scales with both the number and the dim"},"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":"1702.04538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T10:36:05Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"fd31f471ccc208bfc8f92afe583bf0e4a19369bcc58a41d0b3ed96378caca1b5","abstract_canon_sha256":"c1d76feb12123b42867e734240d6d6d042dac4003c528dbcba0d124d893a9bdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:41.344486Z","signature_b64":"QtQovTzvSsv8kd0sGRfgbZPMFBzl3X3W4TeNLzWa+Zvpwxx0LU9LT4w8skjVjI4ts2TuFMjhkYYL2MKK8VdkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b88faa2a9ff2b05a88a4e340226fde982bb1b48c3d527eba269c5b102afe760d","last_reissued_at":"2026-05-18T00:50:41.343761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:41.343761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A core-set approach for distributed quadratic programming in big-data classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Giuseppe Notarstefano","submitted_at":"2017-02-15T10:36:05Z","abstract_excerpt":"A new challenge for learning algorithms in cyber-physical network systems is the distributed solution of big-data classification problems, i.e., problems in which both the number of training samples and their dimension is high. Motivated by several problem set-ups in Machine Learning, in this paper we consider a special class of quadratic optimization problems involving a \"large\" number of input data, whose dimension is \"big\". To solve these quadratic optimization problems over peer-to-peer networks, we propose an asynchronous, distributed algorithm that scales with both the number and the dim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04538","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":"1702.04538","created_at":"2026-05-18T00:50:41.343840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04538v1","created_at":"2026-05-18T00:50:41.343840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04538","created_at":"2026-05-18T00:50:41.343840+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCH2UKU76KYF","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCH2UKU76KYFVCFE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCH2UKU7","created_at":"2026-05-18T12:31:53.515858+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/XCH2UKU76KYFVCFE4NACE366TA","json":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA.json","graph_json":"https://pith.science/api/pith-number/XCH2UKU76KYFVCFE4NACE366TA/graph.json","events_json":"https://pith.science/api/pith-number/XCH2UKU76KYFVCFE4NACE366TA/events.json","paper":"https://pith.science/paper/XCH2UKU7"},"agent_actions":{"view_html":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA","download_json":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA.json","view_paper":"https://pith.science/paper/XCH2UKU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04538&json=true","fetch_graph":"https://pith.science/api/pith-number/XCH2UKU76KYFVCFE4NACE366TA/graph.json","fetch_events":"https://pith.science/api/pith-number/XCH2UKU76KYFVCFE4NACE366TA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA/action/storage_attestation","attest_author":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA/action/author_attestation","sign_citation":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA/action/citation_signature","submit_replication":"https://pith.science/pith/XCH2UKU76KYFVCFE4NACE366TA/action/replication_record"}},"created_at":"2026-05-18T00:50:41.343840+00:00","updated_at":"2026-05-18T00:50:41.343840+00:00"}