{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RXV7TTHPORUO55LKHUWIU7TNVJ","short_pith_number":"pith:RXV7TTHP","schema_version":"1.0","canonical_sha256":"8debf9ccef7468eef56a3d2c8a7e6daa64f2e3ee75c0e901e5d31340536d7f9b","source":{"kind":"arxiv","id":"1705.05804","version":1},"attestation_state":"computed","paper":{"title":"The Incremental Multiresolution Matrix Factorization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.CV","authors_text":"Risi Kondor, Sterling C. Johnson, Vamsi K. Ithapu, Vikas Singh","submitted_at":"2017-05-16T17:10:05Z","abstract_excerpt":"Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric matrices -- an important aspect in the success of many vision problems. Our new algorithm, the incremental multiresolution matrix factorization, uncovers such structure one feature at a time, and hence scales well to large matrices. We describe how this multiscale analysis goes much farther than what a direct global factorization of the data can identify. We "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.05804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-16T17:10:05Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"1976a991270c32553a7f9d8cc2d9c5d715f5952b84cbaee8344d6945d3be20c5","abstract_canon_sha256":"386d0aca8e39a471a6ae046e93bdd19d385d6a4ac961fef275e8e75fd839dc39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:20.139305Z","signature_b64":"v4iMohBRP42hgE+P97w39UqcnXYDVCLLnp3r122NZpNoMmJw1gkVkhUeESLQ56wz0Lqpf76XCKSotE2CfXPJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8debf9ccef7468eef56a3d2c8a7e6daa64f2e3ee75c0e901e5d31340536d7f9b","last_reissued_at":"2026-05-18T00:44:20.138845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:20.138845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Incremental Multiresolution Matrix Factorization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.CV","authors_text":"Risi Kondor, Sterling C. Johnson, Vamsi K. Ithapu, Vikas Singh","submitted_at":"2017-05-16T17:10:05Z","abstract_excerpt":"Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric matrices -- an important aspect in the success of many vision problems. Our new algorithm, the incremental multiresolution matrix factorization, uncovers such structure one feature at a time, and hence scales well to large matrices. We describe how this multiscale analysis goes much farther than what a direct global factorization of the data can identify. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05804","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.05804","created_at":"2026-05-18T00:44:20.138922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05804v1","created_at":"2026-05-18T00:44:20.138922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05804","created_at":"2026-05-18T00:44:20.138922+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXV7TTHPORUO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXV7TTHPORUO55LK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXV7TTHP","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ","json":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ.json","graph_json":"https://pith.science/api/pith-number/RXV7TTHPORUO55LKHUWIU7TNVJ/graph.json","events_json":"https://pith.science/api/pith-number/RXV7TTHPORUO55LKHUWIU7TNVJ/events.json","paper":"https://pith.science/paper/RXV7TTHP"},"agent_actions":{"view_html":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ","download_json":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ.json","view_paper":"https://pith.science/paper/RXV7TTHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05804&json=true","fetch_graph":"https://pith.science/api/pith-number/RXV7TTHPORUO55LKHUWIU7TNVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RXV7TTHPORUO55LKHUWIU7TNVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ/action/storage_attestation","attest_author":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ/action/author_attestation","sign_citation":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ/action/citation_signature","submit_replication":"https://pith.science/pith/RXV7TTHPORUO55LKHUWIU7TNVJ/action/replication_record"}},"created_at":"2026-05-18T00:44:20.138922+00:00","updated_at":"2026-05-18T00:44:20.138922+00:00"}