{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7THQMWKLVLMZ45V2KNTA4TA4CR","short_pith_number":"pith:7THQMWKL","canonical_record":{"source":{"id":"2311.14468","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-24T13:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"e6f5e0166c4eebc793c8a4792659dd33f10164bbd33ff8e91b0a477e4c7c4b9b","abstract_canon_sha256":"436c05800f323401b780214fb365806fcddecad93504ac0ba5737fd1b7b4b7e6"},"schema_version":"1.0"},"canonical_sha256":"fccf06594baad99e76ba53660e4c1c1457b13470dc42224c43e1c3adce93c888","source":{"kind":"arxiv","id":"2311.14468","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.14468","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.14468v3","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14468","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_12","alias_value":"7THQMWKLVLMZ","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_16","alias_value":"7THQMWKLVLMZ45V2","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_8","alias_value":"7THQMWKL","created_at":"2026-07-05T10:06:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7THQMWKLVLMZ45V2KNTA4TA4CR","target":"record","payload":{"canonical_record":{"source":{"id":"2311.14468","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-24T13:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"e6f5e0166c4eebc793c8a4792659dd33f10164bbd33ff8e91b0a477e4c7c4b9b","abstract_canon_sha256":"436c05800f323401b780214fb365806fcddecad93504ac0ba5737fd1b7b4b7e6"},"schema_version":"1.0"},"canonical_sha256":"fccf06594baad99e76ba53660e4c1c1457b13470dc42224c43e1c3adce93c888","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:02.066934Z","signature_b64":"DB08OmDj9J0YopLaycvfrDesWLoodsQNaojiL4iM+6dt19/aycNYJm0sFA1tgGxGbCFu83qlRFcsZV3kkun/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fccf06594baad99e76ba53660e4c1c1457b13470dc42224c43e1c3adce93c888","last_reissued_at":"2026-07-05T10:06:02.066449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:02.066449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.14468","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-05T10:06:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73kyMsf902Z70phhhFnU5U/866Up1qFEitaQGZryGgR55pCxY071lKs5SCHk7KR2DSXwdopZy203lX1iRsydDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T20:28:29.110688Z"},"content_sha256":"bb13a67b068000cd06b10639abd003278792ea1f4a7d15fc8a8ffbd12197ad36","schema_version":"1.0","event_id":"sha256:bb13a67b068000cd06b10639abd003278792ea1f4a7d15fc8a8ffbd12197ad36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7THQMWKLVLMZ45V2KNTA4TA4CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Importance Sampling for Stochastic Gradient Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Corentin Sala\\\"un, Gurprit Singh, Iliyan Georgiev, Niloy J. Mitra, Xingchang Huang","submitted_at":"2023-11-24T13:21:35Z","abstract_excerpt":"Machine learning optimization often depends on stochastic gradient descent, where the precision of gradient estimation is vital for model performance. Gradients are calculated from mini-batches formed by uniformly selecting data samples from the training dataset. However, not all data samples contribute equally to gradient estimation. To address this, various importance sampling strategies have been developed to prioritize more significant samples. Despite these advancements, all current importance sampling methods encounter challenges related to computational efficiency and seamless integrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14468","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/2311.14468/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-05T10:06:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDjulM+JkEhdhJiOrP1qPJTjphKr8z5nJtm0bkZkxkOlVLk6gt2qlYbzNn6aokpYvvlzwDYCziFCq+QM6twvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T20:28:29.111219Z"},"content_sha256":"a8c13bb26495a4e78832305c3f5742baf1a623477c3e8fa0c1393ac7f2e08de1","schema_version":"1.0","event_id":"sha256:a8c13bb26495a4e78832305c3f5742baf1a623477c3e8fa0c1393ac7f2e08de1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/bundle.json","state_url":"https://pith.science/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/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-06T20:28:29Z","links":{"resolver":"https://pith.science/pith/7THQMWKLVLMZ45V2KNTA4TA4CR","bundle":"https://pith.science/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/bundle.json","state":"https://pith.science/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7THQMWKLVLMZ45V2KNTA4TA4CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7THQMWKLVLMZ45V2KNTA4TA4CR","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":"436c05800f323401b780214fb365806fcddecad93504ac0ba5737fd1b7b4b7e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-24T13:21:35Z","title_canon_sha256":"e6f5e0166c4eebc793c8a4792659dd33f10164bbd33ff8e91b0a477e4c7c4b9b"},"schema_version":"1.0","source":{"id":"2311.14468","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.14468","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"arxiv_version","alias_value":"2311.14468v3","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14468","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_12","alias_value":"7THQMWKLVLMZ","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_16","alias_value":"7THQMWKLVLMZ45V2","created_at":"2026-07-05T10:06:02Z"},{"alias_kind":"pith_short_8","alias_value":"7THQMWKL","created_at":"2026-07-05T10:06:02Z"}],"graph_snapshots":[{"event_id":"sha256:a8c13bb26495a4e78832305c3f5742baf1a623477c3e8fa0c1393ac7f2e08de1","target":"graph","created_at":"2026-07-05T10:06:02Z","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/2311.14468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine learning optimization often depends on stochastic gradient descent, where the precision of gradient estimation is vital for model performance. Gradients are calculated from mini-batches formed by uniformly selecting data samples from the training dataset. However, not all data samples contribute equally to gradient estimation. To address this, various importance sampling strategies have been developed to prioritize more significant samples. Despite these advancements, all current importance sampling methods encounter challenges related to computational efficiency and seamless integrati","authors_text":"Corentin Sala\\\"un, Gurprit Singh, Iliyan Georgiev, Niloy J. Mitra, Xingchang Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-24T13:21:35Z","title":"Online Importance Sampling for Stochastic Gradient Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14468","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:bb13a67b068000cd06b10639abd003278792ea1f4a7d15fc8a8ffbd12197ad36","target":"record","created_at":"2026-07-05T10:06:02Z","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":"436c05800f323401b780214fb365806fcddecad93504ac0ba5737fd1b7b4b7e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-24T13:21:35Z","title_canon_sha256":"e6f5e0166c4eebc793c8a4792659dd33f10164bbd33ff8e91b0a477e4c7c4b9b"},"schema_version":"1.0","source":{"id":"2311.14468","kind":"arxiv","version":3}},"canonical_sha256":"fccf06594baad99e76ba53660e4c1c1457b13470dc42224c43e1c3adce93c888","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fccf06594baad99e76ba53660e4c1c1457b13470dc42224c43e1c3adce93c888","first_computed_at":"2026-07-05T10:06:02.066449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:06:02.066449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DB08OmDj9J0YopLaycvfrDesWLoodsQNaojiL4iM+6dt19/aycNYJm0sFA1tgGxGbCFu83qlRFcsZV3kkun/Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:06:02.066934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.14468","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb13a67b068000cd06b10639abd003278792ea1f4a7d15fc8a8ffbd12197ad36","sha256:a8c13bb26495a4e78832305c3f5742baf1a623477c3e8fa0c1393ac7f2e08de1"],"state_sha256":"ff30c7bfd209406fae817d7587f5b6f7e7807ef979b4154b0428b949e7ed9ea6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riQ0x9WfQEd5Tlg3u7c/u0w3aNIkvIaW3uQm8nM+5XoxSCKtMpJ/jUMQe3470QyQSNZLBbdUVlBiqDMiISUQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T20:28:29.116680Z","bundle_sha256":"149155b720a1396253855310c546f720000b03e9e82c33738fb79ac9d6c3dfe4"}}