{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XYC6AX4P6CH47PIKZBJMMWHWIJ","short_pith_number":"pith:XYC6AX4P","canonical_record":{"source":{"id":"1505.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-19T23:12:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56c5eec80039669d07bd5ddb8cb280fac928b0efab77d055bbfde49e01237a8b","abstract_canon_sha256":"c87fb2cfb8577e014f1e18f807dfa0d618a71d55e2db65f94f034ff61db26d63"},"schema_version":"1.0"},"canonical_sha256":"be05e05f8ff08fcfbd0ac852c658f6427cc39989afa888c6e3a25a0b4315f8b0","source":{"kind":"arxiv","id":"1505.05208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05208","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05208v1","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05208","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"XYC6AX4P6CH4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XYC6AX4P6CH47PIK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XYC6AX4P","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XYC6AX4P6CH47PIKZBJMMWHWIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-19T23:12:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56c5eec80039669d07bd5ddb8cb280fac928b0efab77d055bbfde49e01237a8b","abstract_canon_sha256":"c87fb2cfb8577e014f1e18f807dfa0d618a71d55e2db65f94f034ff61db26d63"},"schema_version":"1.0"},"canonical_sha256":"be05e05f8ff08fcfbd0ac852c658f6427cc39989afa888c6e3a25a0b4315f8b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:59.097655Z","signature_b64":"DJd4hM4VhTQ/1Ze81uDrqR4yNIzSUYZEhMnNKfvZwxcANLlPECW7qczc1C1kpysaMeKzilNriw8apUacRlWjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be05e05f8ff08fcfbd0ac852c658f6427cc39989afa888c6e3a25a0b4315f8b0","last_reissued_at":"2026-05-18T02:03:59.096877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:59.096877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05208","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-18T02:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bIHl5stPqyNKUrHsTn2JrtlNefhM6lT9QbLYDqPehWZii7EwUq6Aka9Pk6o2SXQPzHAggQAGPaSHj0FoVCTiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:24:38.572151Z"},"content_sha256":"86b77a0e23e1c5e1ae6cc24733c909e6c8bf33c0a816ac007487f0979795fdc4","schema_version":"1.0","event_id":"sha256:86b77a0e23e1c5e1ae6cc24733c909e6c8bf33c0a816ac007487f0979795fdc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XYC6AX4P6CH47PIKZBJMMWHWIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"oASIS: Adaptive Column Sampling for Kernel Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Azalia Mirhoseini, Eva L. Dyer, Raajen Patel, Richard G. Baraniuk, Thomas A. Goldstein","submitted_at":"2015-05-19T23:12:01Z","abstract_excerpt":"Kernel matrices (e.g. Gram or similarity matrices) are essential for many state-of-the-art approaches to classification, clustering, and dimensionality reduction. For large datasets, the cost of forming and factoring such kernel matrices becomes intractable. To address this challenge, we introduce a new adaptive sampling algorithm called Accelerated Sequential Incoherence Selection (oASIS) that samples columns without explicitly computing the entire kernel matrix. We provide conditions under which oASIS is guaranteed to exactly recover the kernel matrix with an optimal number of columns select"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05208","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-18T02:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUzCfzWbydypWZJ2DBBGPEi67dab8kGEonAcu5h32bt2k/+ByY9eSosk2gfO7A6zh+aYElhDHgfcF5jAkN09Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:24:38.572726Z"},"content_sha256":"d7a94c0bfcbde445c13dd0f04c53c4b2f35ffa1f412285ace4ae402b875501fe","schema_version":"1.0","event_id":"sha256:d7a94c0bfcbde445c13dd0f04c53c4b2f35ffa1f412285ace4ae402b875501fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/bundle.json","state_url":"https://pith.science/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/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-05-18T19:24:38Z","links":{"resolver":"https://pith.science/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ","bundle":"https://pith.science/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/bundle.json","state":"https://pith.science/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYC6AX4P6CH47PIKZBJMMWHWIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XYC6AX4P6CH47PIKZBJMMWHWIJ","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":"c87fb2cfb8577e014f1e18f807dfa0d618a71d55e2db65f94f034ff61db26d63","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-19T23:12:01Z","title_canon_sha256":"56c5eec80039669d07bd5ddb8cb280fac928b0efab77d055bbfde49e01237a8b"},"schema_version":"1.0","source":{"id":"1505.05208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05208","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05208v1","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05208","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"XYC6AX4P6CH4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XYC6AX4P6CH47PIK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XYC6AX4P","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:d7a94c0bfcbde445c13dd0f04c53c4b2f35ffa1f412285ace4ae402b875501fe","target":"graph","created_at":"2026-05-18T02:03:59Z","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":"Kernel matrices (e.g. Gram or similarity matrices) are essential for many state-of-the-art approaches to classification, clustering, and dimensionality reduction. For large datasets, the cost of forming and factoring such kernel matrices becomes intractable. To address this challenge, we introduce a new adaptive sampling algorithm called Accelerated Sequential Incoherence Selection (oASIS) that samples columns without explicitly computing the entire kernel matrix. We provide conditions under which oASIS is guaranteed to exactly recover the kernel matrix with an optimal number of columns select","authors_text":"Azalia Mirhoseini, Eva L. Dyer, Raajen Patel, Richard G. Baraniuk, Thomas A. Goldstein","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-19T23:12:01Z","title":"oASIS: Adaptive Column Sampling for Kernel Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05208","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:86b77a0e23e1c5e1ae6cc24733c909e6c8bf33c0a816ac007487f0979795fdc4","target":"record","created_at":"2026-05-18T02:03:59Z","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":"c87fb2cfb8577e014f1e18f807dfa0d618a71d55e2db65f94f034ff61db26d63","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-19T23:12:01Z","title_canon_sha256":"56c5eec80039669d07bd5ddb8cb280fac928b0efab77d055bbfde49e01237a8b"},"schema_version":"1.0","source":{"id":"1505.05208","kind":"arxiv","version":1}},"canonical_sha256":"be05e05f8ff08fcfbd0ac852c658f6427cc39989afa888c6e3a25a0b4315f8b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be05e05f8ff08fcfbd0ac852c658f6427cc39989afa888c6e3a25a0b4315f8b0","first_computed_at":"2026-05-18T02:03:59.096877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:59.096877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DJd4hM4VhTQ/1Ze81uDrqR4yNIzSUYZEhMnNKfvZwxcANLlPECW7qczc1C1kpysaMeKzilNriw8apUacRlWjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:59.097655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86b77a0e23e1c5e1ae6cc24733c909e6c8bf33c0a816ac007487f0979795fdc4","sha256:d7a94c0bfcbde445c13dd0f04c53c4b2f35ffa1f412285ace4ae402b875501fe"],"state_sha256":"772758782f6d57411b3b3302885d914bff92c9e05496f9ca73d4113134b28bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2y5aXPVltqIDl+q7nZL8ILNSKLEL/QmsTUK7+DO0pOAumf/XeuZxv093HOZETsI7MTdoRd0r4ZgXLlC3jlVtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:24:38.574523Z","bundle_sha256":"fb1622b13347f41ad37450d72c0bc75b17c52c64edb79f51f6632de507f6034f"}}