{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EMDOBJSPWQWNVSNO7Z3W56L3QQ","short_pith_number":"pith:EMDOBJSP","canonical_record":{"source":{"id":"1604.03034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-11T17:12:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"df126f93b92afbc245f5eba4e505ba4654e5d98eb906a2240e9d86e31603d493","abstract_canon_sha256":"2cb728acb15ac247ccaeb4b17ee5d88dd2daec85b95e78bc911d639b7a4cfeb4"},"schema_version":"1.0"},"canonical_sha256":"2306e0a64fb42cdac9aefe776ef97b840eadce020e972be44c853b15acb89588","source":{"kind":"arxiv","id":"1604.03034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03034","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03034v1","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03034","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"EMDOBJSPWQWN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMDOBJSPWQWNVSNO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMDOBJSP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EMDOBJSPWQWNVSNO7Z3W56L3QQ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-11T17:12:14Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"df126f93b92afbc245f5eba4e505ba4654e5d98eb906a2240e9d86e31603d493","abstract_canon_sha256":"2cb728acb15ac247ccaeb4b17ee5d88dd2daec85b95e78bc911d639b7a4cfeb4"},"schema_version":"1.0"},"canonical_sha256":"2306e0a64fb42cdac9aefe776ef97b840eadce020e972be44c853b15acb89588","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:21.603749Z","signature_b64":"nq1R+8Ij5oIBDqJ5UKTi9jAHs6MTqXOxGDLQlwsj21MyJdrfzEXrFR3LTtzCogQK93sSOi6qwDpTIcOnGrYLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2306e0a64fb42cdac9aefe776ef97b840eadce020e972be44c853b15acb89588","last_reissued_at":"2026-05-18T01:17:21.603257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:21.603257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03034","source_version":1,"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-05-18T01:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79XceMiBjTu+9zEZJtVsjGNfba94gzdaRP6wX7IQJLx9w7E0UYSa0n8BIDJSCWvJwDXgHejLgVPivcp+8iIEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:29:48.091815Z"},"content_sha256":"b840b64151e0d36079a0e958208fb10473a1924d1c09e90f72a8cee956873a74","schema_version":"1.0","event_id":"sha256:b840b64151e0d36079a0e958208fb10473a1924d1c09e90f72a8cee956873a74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EMDOBJSPWQWNVSNO7Z3W56L3QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"M3: Scaling Up Machine Learning via Memory Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Dezhi Fang, Duen Horng Chau","submitted_at":"2016-04-11T17:12:14Z","abstract_excerpt":"To process data that do not fit in RAM, conventional wisdom would suggest using distributed approaches. However, recent research has demonstrated virtual memory's strong potential in scaling up graph mining algorithms on a single machine. We propose to use a similar approach for general machine learning. We contribute: (1) our latest finding that memory mapping is also a feasible technique for scaling up general machine learning algorithms like logistic regression and k-means, when data fits in or exceeds RAM (we tested datasets up to 190GB); (2) an approach, called M3, that enables existing m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03034","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"},"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-05-18T01:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sit1ucxR0cp276Y1poLveyDnf/d70bG+71LY0QJZwRsCaTF3fk2UAlfKGhcC+94l0p13Fz5d0Rass3t+zxdMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:29:48.092163Z"},"content_sha256":"a6a1758b10fb3d68c0143aeb914a80fea458c2314ef3463e99dea110f7d439da","schema_version":"1.0","event_id":"sha256:a6a1758b10fb3d68c0143aeb914a80fea458c2314ef3463e99dea110f7d439da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/bundle.json","state_url":"https://pith.science/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/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-06-22T15:29:48Z","links":{"resolver":"https://pith.science/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ","bundle":"https://pith.science/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/bundle.json","state":"https://pith.science/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMDOBJSPWQWNVSNO7Z3W56L3QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EMDOBJSPWQWNVSNO7Z3W56L3QQ","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":"2cb728acb15ac247ccaeb4b17ee5d88dd2daec85b95e78bc911d639b7a4cfeb4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-11T17:12:14Z","title_canon_sha256":"df126f93b92afbc245f5eba4e505ba4654e5d98eb906a2240e9d86e31603d493"},"schema_version":"1.0","source":{"id":"1604.03034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03034","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03034v1","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03034","created_at":"2026-05-18T01:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"EMDOBJSPWQWN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMDOBJSPWQWNVSNO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMDOBJSP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:a6a1758b10fb3d68c0143aeb914a80fea458c2314ef3463e99dea110f7d439da","target":"graph","created_at":"2026-05-18T01:17:21Z","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"},"paper":{"abstract_excerpt":"To process data that do not fit in RAM, conventional wisdom would suggest using distributed approaches. However, recent research has demonstrated virtual memory's strong potential in scaling up graph mining algorithms on a single machine. We propose to use a similar approach for general machine learning. We contribute: (1) our latest finding that memory mapping is also a feasible technique for scaling up general machine learning algorithms like logistic regression and k-means, when data fits in or exceeds RAM (we tested datasets up to 190GB); (2) an approach, called M3, that enables existing m","authors_text":"Dezhi Fang, Duen Horng Chau","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-11T17:12:14Z","title":"M3: Scaling Up Machine Learning via Memory Mapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03034","kind":"arxiv","version":1},"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:b840b64151e0d36079a0e958208fb10473a1924d1c09e90f72a8cee956873a74","target":"record","created_at":"2026-05-18T01:17:21Z","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":"2cb728acb15ac247ccaeb4b17ee5d88dd2daec85b95e78bc911d639b7a4cfeb4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-11T17:12:14Z","title_canon_sha256":"df126f93b92afbc245f5eba4e505ba4654e5d98eb906a2240e9d86e31603d493"},"schema_version":"1.0","source":{"id":"1604.03034","kind":"arxiv","version":1}},"canonical_sha256":"2306e0a64fb42cdac9aefe776ef97b840eadce020e972be44c853b15acb89588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2306e0a64fb42cdac9aefe776ef97b840eadce020e972be44c853b15acb89588","first_computed_at":"2026-05-18T01:17:21.603257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:21.603257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nq1R+8Ij5oIBDqJ5UKTi9jAHs6MTqXOxGDLQlwsj21MyJdrfzEXrFR3LTtzCogQK93sSOi6qwDpTIcOnGrYLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:21.603749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b840b64151e0d36079a0e958208fb10473a1924d1c09e90f72a8cee956873a74","sha256:a6a1758b10fb3d68c0143aeb914a80fea458c2314ef3463e99dea110f7d439da"],"state_sha256":"2468559d2d082b5dac154cae92030b093cdb33b5c71705accaab6c4f456a691e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChzrP6r6HOPrjinc7J1X9/OO0upY/InX13OJ48IdumIm7FnY2Q7yzAwmxfMg6nXTcMy5VtaPNPUgpF3s5RpRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:29:48.094321Z","bundle_sha256":"140f6e096f9a9a310ac9cb092e313eeeae46eb9b39477fb6d150cb9a0646246d"}}