{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E6FZKS5FJC4XP3NYEU5XGX2C4M","short_pith_number":"pith:E6FZKS5F","canonical_record":{"source":{"id":"1204.6717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T18:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"a6723bd2a35c3b625b8f3368588a2081bbb1bf574fea84b3c1ccac3a26c6fd3e","abstract_canon_sha256":"c2e43d8347ba2ee63d3fe275befb226c5c7540c8d5de9e29658f9d00465c25a9"},"schema_version":"1.0"},"canonical_sha256":"278b954ba548b977edb8253b735f42e31042a95e2fcebd05807634afa9c7a758","source":{"kind":"arxiv","id":"1204.6717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6717","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6717v2","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6717","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"E6FZKS5FJC4X","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E6FZKS5FJC4XP3NY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E6FZKS5F","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E6FZKS5FJC4XP3NYEU5XGX2C4M","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T18:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"a6723bd2a35c3b625b8f3368588a2081bbb1bf574fea84b3c1ccac3a26c6fd3e","abstract_canon_sha256":"c2e43d8347ba2ee63d3fe275befb226c5c7540c8d5de9e29658f9d00465c25a9"},"schema_version":"1.0"},"canonical_sha256":"278b954ba548b977edb8253b735f42e31042a95e2fcebd05807634afa9c7a758","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.843340Z","signature_b64":"H6el9mzul/PCgfAgJO+4tq2jvYiyKyb7POYAE+BSAekcRzrzgUsPa985QEOh86TIW+qiG2697ijjBtyL/BmHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"278b954ba548b977edb8253b735f42e31042a95e2fcebd05807634afa9c7a758","last_reissued_at":"2026-05-18T02:21:15.842731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.842731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6717","source_version":2,"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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMq9WKxREFhk+xMMtmH7TKQi1lAjQ09ZMZ1NYJm+e/+wCDIDn6Y1BD/c/X1cbKRTWUyeIazs45R4OSq1pRyhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:20:46.463713Z"},"content_sha256":"325fea7da974d2a510f0a1ef57ee35dfd1a3ab199baf5f3041b463ea565b8a35","schema_version":"1.0","event_id":"sha256:325fea7da974d2a510f0a1ef57ee35dfd1a3ab199baf5f3041b463ea565b8a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E6FZKS5FJC4XP3NYEU5XGX2C4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Time Algorithm for Projective Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hu Ding, Jinhui Xu","submitted_at":"2012-04-30T18:06:53Z","abstract_excerpt":"Projective clustering is a problem with both theoretical and practical importance and has received a great deal of attentions in recent years. Given a set of points $P$ in $\\mathbb{R}^{d}$ space, projective clustering is to find a set $\\mathbb{F}$ of $k$ lower dimensional $j$-flats so that the average distance (or squared distance) from points in $P$ to their closest flats is minimized. Existing approaches for this problem are mainly based on adaptive/volume sampling or core-sets techniques which suffer from several limitations. In this paper, we present the first uniform random sampling based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6717","kind":"arxiv","version":2},"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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fo2kyIqZJ/tOEqcEcrisSPNIUIGlTvr2hVzHe09jorcCUZa9h1i/geHVjU8bnIgRerbtczflR3b7sRaWqDQ2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:20:46.464293Z"},"content_sha256":"0fb207dcb3b37264b35eca9654dbc0d5b58ae474a4ca5edbc14b62d6bc468a48","schema_version":"1.0","event_id":"sha256:0fb207dcb3b37264b35eca9654dbc0d5b58ae474a4ca5edbc14b62d6bc468a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/bundle.json","state_url":"https://pith.science/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/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-07-04T02:20:46Z","links":{"resolver":"https://pith.science/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M","bundle":"https://pith.science/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/bundle.json","state":"https://pith.science/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6FZKS5FJC4XP3NYEU5XGX2C4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E6FZKS5FJC4XP3NYEU5XGX2C4M","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":"c2e43d8347ba2ee63d3fe275befb226c5c7540c8d5de9e29658f9d00465c25a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T18:06:53Z","title_canon_sha256":"a6723bd2a35c3b625b8f3368588a2081bbb1bf574fea84b3c1ccac3a26c6fd3e"},"schema_version":"1.0","source":{"id":"1204.6717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6717","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6717v2","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6717","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"E6FZKS5FJC4X","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E6FZKS5FJC4XP3NY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E6FZKS5F","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:0fb207dcb3b37264b35eca9654dbc0d5b58ae474a4ca5edbc14b62d6bc468a48","target":"graph","created_at":"2026-05-18T02:21:15Z","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":"Projective clustering is a problem with both theoretical and practical importance and has received a great deal of attentions in recent years. Given a set of points $P$ in $\\mathbb{R}^{d}$ space, projective clustering is to find a set $\\mathbb{F}$ of $k$ lower dimensional $j$-flats so that the average distance (or squared distance) from points in $P$ to their closest flats is minimized. Existing approaches for this problem are mainly based on adaptive/volume sampling or core-sets techniques which suffer from several limitations. In this paper, we present the first uniform random sampling based","authors_text":"Hu Ding, Jinhui Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T18:06:53Z","title":"Linear Time Algorithm for Projective Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6717","kind":"arxiv","version":2},"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:325fea7da974d2a510f0a1ef57ee35dfd1a3ab199baf5f3041b463ea565b8a35","target":"record","created_at":"2026-05-18T02:21:15Z","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":"c2e43d8347ba2ee63d3fe275befb226c5c7540c8d5de9e29658f9d00465c25a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-30T18:06:53Z","title_canon_sha256":"a6723bd2a35c3b625b8f3368588a2081bbb1bf574fea84b3c1ccac3a26c6fd3e"},"schema_version":"1.0","source":{"id":"1204.6717","kind":"arxiv","version":2}},"canonical_sha256":"278b954ba548b977edb8253b735f42e31042a95e2fcebd05807634afa9c7a758","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"278b954ba548b977edb8253b735f42e31042a95e2fcebd05807634afa9c7a758","first_computed_at":"2026-05-18T02:21:15.842731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.842731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H6el9mzul/PCgfAgJO+4tq2jvYiyKyb7POYAE+BSAekcRzrzgUsPa985QEOh86TIW+qiG2697ijjBtyL/BmHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:15.843340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:325fea7da974d2a510f0a1ef57ee35dfd1a3ab199baf5f3041b463ea565b8a35","sha256:0fb207dcb3b37264b35eca9654dbc0d5b58ae474a4ca5edbc14b62d6bc468a48"],"state_sha256":"32bbd762ecd76259f75b67c85780228674f1acd949510113fcbe84c9b0aec03a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkXLS3rvh6y11aRDAOZQXDcrRLOcJhYkmH1Qlxe4iAgZUs5cMNuPZ8bVCPsUX9r8iCEAX0SdePYUbE8o/A38Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:20:46.466935Z","bundle_sha256":"da355e8293494e9ac416595f775cce4df72d5d56813c8d1fbb3244884df5683b"}}