{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ODNGVOPBPY6UBPFPCPNG5ZHMFJ","short_pith_number":"pith:ODNGVOPB","canonical_record":{"source":{"id":"1304.1250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T05:57:56Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"830c612b21c458fa4133d98161ac3e4733089055ca39f444aba5363a6db51f2e","abstract_canon_sha256":"f39b3cd8ba95e909f2151d370012fc5b8cace987e04fb96f2345d393c0fadffb"},"schema_version":"1.0"},"canonical_sha256":"70da6ab9e17e3d40bcaf13da6ee4ec2a58527c7689929433975aca47321d3e4c","source":{"kind":"arxiv","id":"1304.1250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1250","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1250v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1250","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"ODNGVOPBPY6U","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODNGVOPBPY6UBPFP","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODNGVOPB","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ODNGVOPBPY6UBPFPCPNG5ZHMFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T05:57:56Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"830c612b21c458fa4133d98161ac3e4733089055ca39f444aba5363a6db51f2e","abstract_canon_sha256":"f39b3cd8ba95e909f2151d370012fc5b8cace987e04fb96f2345d393c0fadffb"},"schema_version":"1.0"},"canonical_sha256":"70da6ab9e17e3d40bcaf13da6ee4ec2a58527c7689929433975aca47321d3e4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.159487Z","signature_b64":"Xvc7dd+PVibFosQfsQCcfv/NvcZKgjlTWyj/wfSTX+FEVKB4WZaNHNcJNESsuGE74XA6ZvmPef0hnL3vPe/yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70da6ab9e17e3d40bcaf13da6ee4ec2a58527c7689929433975aca47321d3e4c","last_reissued_at":"2026-05-18T03:29:04.158944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.158944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1250","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-18T03:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+LwyGmDaaaipS8IssrKuex3N46zxMuwU4MKcO93AeXAtNY7IhE3RX4WJQn2T+ka5ts8wpMLzzKX9qpQlmdKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:36:46.460620Z"},"content_sha256":"42328732df9bc4b1c3a75a41e7dbb4817d997317cdaf8e8fd434ee0ef17708cd","schema_version":"1.0","event_id":"sha256:42328732df9bc4b1c3a75a41e7dbb4817d997317cdaf8e8fd434ee0ef17708cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ODNGVOPBPY6UBPFPCPNG5ZHMFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Approximate L_infty Minimization: Speeding Up Robust Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Fumin Shen, Rhys Hill, Zhenmin Tang","submitted_at":"2013-04-04T05:57:56Z","abstract_excerpt":"Minimization of the $L_\\infty$ norm, which can be viewed as approximately solving the non-convex least median estimation problem, is a powerful method for outlier removal and hence robust regression. However, current techniques for solving the problem at the heart of $L_\\infty$ norm minimization are slow, and therefore cannot scale to large problems. A new method for the minimization of the $L_\\infty$ norm is presented here, which provides a speedup of multiple orders of magnitude for data with high dimension. This method, termed Fast $L_\\infty$ Minimization, allows robust regression to be app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1250","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-18T03:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCL64OU+FOKT5dyh/w7a9U4BBVQLK/tymPyCL2uq08lW/hlYFnP5i0TW5YcChT5SVTAKbncFJ4vhJcW+3Z+wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:36:46.460980Z"},"content_sha256":"173b703b4c0341381bbb9a2500fcf96f059330454ee81fba2c94f57939d5c3dd","schema_version":"1.0","event_id":"sha256:173b703b4c0341381bbb9a2500fcf96f059330454ee81fba2c94f57939d5c3dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/bundle.json","state_url":"https://pith.science/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/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-30T01:36:46Z","links":{"resolver":"https://pith.science/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ","bundle":"https://pith.science/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/bundle.json","state":"https://pith.science/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODNGVOPBPY6UBPFPCPNG5ZHMFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ODNGVOPBPY6UBPFPCPNG5ZHMFJ","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":"f39b3cd8ba95e909f2151d370012fc5b8cace987e04fb96f2345d393c0fadffb","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T05:57:56Z","title_canon_sha256":"830c612b21c458fa4133d98161ac3e4733089055ca39f444aba5363a6db51f2e"},"schema_version":"1.0","source":{"id":"1304.1250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1250","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1250v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1250","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"ODNGVOPBPY6U","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"ODNGVOPBPY6UBPFP","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"ODNGVOPB","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:173b703b4c0341381bbb9a2500fcf96f059330454ee81fba2c94f57939d5c3dd","target":"graph","created_at":"2026-05-18T03:29:04Z","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":"Minimization of the $L_\\infty$ norm, which can be viewed as approximately solving the non-convex least median estimation problem, is a powerful method for outlier removal and hence robust regression. However, current techniques for solving the problem at the heart of $L_\\infty$ norm minimization are slow, and therefore cannot scale to large problems. A new method for the minimization of the $L_\\infty$ norm is presented here, which provides a speedup of multiple orders of magnitude for data with high dimension. This method, termed Fast $L_\\infty$ Minimization, allows robust regression to be app","authors_text":"Anton van den Hengel, Chunhua Shen, Fumin Shen, Rhys Hill, Zhenmin Tang","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T05:57:56Z","title":"Fast Approximate L_infty Minimization: Speeding Up Robust Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1250","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:42328732df9bc4b1c3a75a41e7dbb4817d997317cdaf8e8fd434ee0ef17708cd","target":"record","created_at":"2026-05-18T03:29:04Z","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":"f39b3cd8ba95e909f2151d370012fc5b8cace987e04fb96f2345d393c0fadffb","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-04-04T05:57:56Z","title_canon_sha256":"830c612b21c458fa4133d98161ac3e4733089055ca39f444aba5363a6db51f2e"},"schema_version":"1.0","source":{"id":"1304.1250","kind":"arxiv","version":1}},"canonical_sha256":"70da6ab9e17e3d40bcaf13da6ee4ec2a58527c7689929433975aca47321d3e4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70da6ab9e17e3d40bcaf13da6ee4ec2a58527c7689929433975aca47321d3e4c","first_computed_at":"2026-05-18T03:29:04.158944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:04.158944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xvc7dd+PVibFosQfsQCcfv/NvcZKgjlTWyj/wfSTX+FEVKB4WZaNHNcJNESsuGE74XA6ZvmPef0hnL3vPe/yCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:04.159487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42328732df9bc4b1c3a75a41e7dbb4817d997317cdaf8e8fd434ee0ef17708cd","sha256:173b703b4c0341381bbb9a2500fcf96f059330454ee81fba2c94f57939d5c3dd"],"state_sha256":"d858ad63af419ce9c4c1aaad16d977f3ca6e1c7efc148f5148639025155a7c2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIpNwPgegZAP2FK6YLkEIBnxSOTO7ziNI5MFtfNRiCFDJOZD9YcwgnG1TjzoTPfuBqpQmaHMyRTj6zyBovNiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:36:46.462983Z","bundle_sha256":"516bef727c6d379f002adc5d462b409cd704dde08d0fa534053ddbfdaec1267e"}}