{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCEXBZBVNW4WGVNURPVLGA4WOX","short_pith_number":"pith:DCEXBZBV","canonical_record":{"source":{"id":"1802.07382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T00:16:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"64b3bf03ae82fcc98fa9dbd8f58bbede9320048aae9e187a75a76b393337a11a","abstract_canon_sha256":"4ee51b36366c659333a086aebe21e80added97f1552278d1a907e544ba13fe92"},"schema_version":"1.0"},"canonical_sha256":"188970e4356db96355b48beab3039675d37a26411a292a957ca7b2e36761d374","source":{"kind":"arxiv","id":"1802.07382","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07382","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07382v3","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07382","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"DCEXBZBVNW4W","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_16","alias_value":"DCEXBZBVNW4WGVNU","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_8","alias_value":"DCEXBZBV","created_at":"2026-07-05T03:43:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCEXBZBVNW4WGVNURPVLGA4WOX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T00:16:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"64b3bf03ae82fcc98fa9dbd8f58bbede9320048aae9e187a75a76b393337a11a","abstract_canon_sha256":"4ee51b36366c659333a086aebe21e80added97f1552278d1a907e544ba13fe92"},"schema_version":"1.0"},"canonical_sha256":"188970e4356db96355b48beab3039675d37a26411a292a957ca7b2e36761d374","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:24.051880Z","signature_b64":"VIS3A6+zTa9ITr45SIfU2azazUXWK3zAGMLiGAjxbbq23/GPWSBpGphQmMOiEUgZu0tJHBVJuK+NHCq9cdWsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188970e4356db96355b48beab3039675d37a26411a292a957ca7b2e36761d374","last_reissued_at":"2026-07-05T03:43:24.051413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:24.051413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07382","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjLSC29Y0AFl7Wf6nEMNBMp60fpUBRyHzWzqXojGwjRY5I3CpliYwPD98451p5mllCucds1QI2FiIPnFN1MOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:34:05.016803Z"},"content_sha256":"4dc59a06397a4f04e1431415dea3800c213e177aecd431a801ce841a968633b3","schema_version":"1.0","event_id":"sha256:4dc59a06397a4f04e1431415dea3800c213e177aecd431a801ce841a968633b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCEXBZBVNW4WGVNURPVLGA4WOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic Regression, Sigmoid and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Elad Tolochinsky, Ibrahim Jubran","submitted_at":"2018-02-21T00:16:53Z","abstract_excerpt":"Coreset (or core-set) is a small weighted \\emph{subset} $Q$ of an input set $P$ with respect to a given \\emph{monotonic} function $f:\\mathbb{R}\\to\\mathbb{R}$ that \\emph{provably} approximates its fitting loss $\\sum_{p\\in P}f(p\\cdot x)$ to \\emph{any} given $x\\in\\mathbb{R}^d$. Using $Q$ we can obtain approximation of $x^*$ that minimizes this loss, by running \\emph{existing} optimization algorithms on $Q$. In this work we provide: (i) A lower bound which proves that there are sets with no coresets smaller than $n=|P|$ for general monotonic loss functions. (ii) A proof that, under a natural assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07382","kind":"arxiv","version":3},"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/1802.07382/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCTA81tukxD+YKaK7462oRAR5Qpc+4/ReRQe/+T9D72KjQF3OwpZorvlTgLCye309BnHzBByLkxXLhmiBn36Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:34:05.017320Z"},"content_sha256":"ad0c11e3e54c75d4866c0215b1bd41512dffcf76aed0f00c8ea64e70d0140be0","schema_version":"1.0","event_id":"sha256:ad0c11e3e54c75d4866c0215b1bd41512dffcf76aed0f00c8ea64e70d0140be0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/bundle.json","state_url":"https://pith.science/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T09:34:05Z","links":{"resolver":"https://pith.science/pith/DCEXBZBVNW4WGVNURPVLGA4WOX","bundle":"https://pith.science/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/bundle.json","state":"https://pith.science/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCEXBZBVNW4WGVNURPVLGA4WOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCEXBZBVNW4WGVNURPVLGA4WOX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4ee51b36366c659333a086aebe21e80added97f1552278d1a907e544ba13fe92","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T00:16:53Z","title_canon_sha256":"64b3bf03ae82fcc98fa9dbd8f58bbede9320048aae9e187a75a76b393337a11a"},"schema_version":"1.0","source":{"id":"1802.07382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07382","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07382v3","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07382","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"DCEXBZBVNW4W","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_16","alias_value":"DCEXBZBVNW4WGVNU","created_at":"2026-07-05T03:43:24Z"},{"alias_kind":"pith_short_8","alias_value":"DCEXBZBV","created_at":"2026-07-05T03:43:24Z"}],"graph_snapshots":[{"event_id":"sha256:ad0c11e3e54c75d4866c0215b1bd41512dffcf76aed0f00c8ea64e70d0140be0","target":"graph","created_at":"2026-07-05T03:43:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1802.07382/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coreset (or core-set) is a small weighted \\emph{subset} $Q$ of an input set $P$ with respect to a given \\emph{monotonic} function $f:\\mathbb{R}\\to\\mathbb{R}$ that \\emph{provably} approximates its fitting loss $\\sum_{p\\in P}f(p\\cdot x)$ to \\emph{any} given $x\\in\\mathbb{R}^d$. Using $Q$ we can obtain approximation of $x^*$ that minimizes this loss, by running \\emph{existing} optimization algorithms on $Q$. In this work we provide: (i) A lower bound which proves that there are sets with no coresets smaller than $n=|P|$ for general monotonic loss functions. (ii) A proof that, under a natural assum","authors_text":"Dan Feldman, Elad Tolochinsky, Ibrahim Jubran","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T00:16:53Z","title":"Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic Regression, Sigmoid and more"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07382","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4dc59a06397a4f04e1431415dea3800c213e177aecd431a801ce841a968633b3","target":"record","created_at":"2026-07-05T03:43:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4ee51b36366c659333a086aebe21e80added97f1552278d1a907e544ba13fe92","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T00:16:53Z","title_canon_sha256":"64b3bf03ae82fcc98fa9dbd8f58bbede9320048aae9e187a75a76b393337a11a"},"schema_version":"1.0","source":{"id":"1802.07382","kind":"arxiv","version":3}},"canonical_sha256":"188970e4356db96355b48beab3039675d37a26411a292a957ca7b2e36761d374","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"188970e4356db96355b48beab3039675d37a26411a292a957ca7b2e36761d374","first_computed_at":"2026-07-05T03:43:24.051413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:43:24.051413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VIS3A6+zTa9ITr45SIfU2azazUXWK3zAGMLiGAjxbbq23/GPWSBpGphQmMOiEUgZu0tJHBVJuK+NHCq9cdWsDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:43:24.051880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc59a06397a4f04e1431415dea3800c213e177aecd431a801ce841a968633b3","sha256:ad0c11e3e54c75d4866c0215b1bd41512dffcf76aed0f00c8ea64e70d0140be0"],"state_sha256":"9d83f408a21ca8f1e9652f4915e0d420bfadfdf4549cafe15983dd12d8ec9b88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roZDuGGNN5ejuSYoD9Zd76mdOnOsFGojdElq2Z4MHWGBCoziP7Ier8VZ/dUh/cBLks2IeuRbzxh5Vwz11RqTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:34:05.023738Z","bundle_sha256":"bcd3e0a97d920d2613d95a14dcd911655db9b6469559a178e60cab5615480ab5"}}