{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y5TSSG5M4L344MTS52MSFILLYK","short_pith_number":"pith:Y5TSSG5M","schema_version":"1.0","canonical_sha256":"c767291bace2f7ce3272ee9922a16bc286dc87ad47e541348fe742e1838d50d1","source":{"kind":"arxiv","id":"1311.1406","version":1},"attestation_state":"computed","paper":{"title":"TOP-SPIN: TOPic discovery via Sparse Principal component INterference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Martin Tak\\'a\\v{c}, Ngai-Man Cheung, Peter Richt\\'arik, Selin Damla Ahipa\\c{s}ao\\u{g}lu","submitted_at":"2013-11-04T19:03:31Z","abstract_excerpt":"We propose a novel topic discovery algorithm for unlabeled images based on the bag-of-words (BoW) framework. We first extract a dictionary of visual words and subsequently for each image compute a visual word occurrence histogram. We view these histograms as rows of a large matrix from which we extract sparse principal components (PCs). Each PC identifies a sparse combination of visual words which co-occur frequently in some images but seldom appear in others. Each sparse PC corresponds to a topic, and images whose interference with the PC is high belong to that topic, revealing the common par"},"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":"1311.1406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-04T19:03:31Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"1011e37ee8d053b81d7dd5bfae6448f0aba213fa924149b26b058887c752266c","abstract_canon_sha256":"bee94ce3cce40263a2d1922b3df78d073f3c1e270e5ac7a30eff0b0a11be4b7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:53.455495Z","signature_b64":"577IniEOsdlX/+UrzWJOKxPBWngXek0TI2p36g78tUUXg2zYc82vex6vfagEeLAk3dpGb/rTZXpBdsHDZUWbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c767291bace2f7ce3272ee9922a16bc286dc87ad47e541348fe742e1838d50d1","last_reissued_at":"2026-05-18T03:07:53.454782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:53.454782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TOP-SPIN: TOPic discovery via Sparse Principal component INterference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Martin Tak\\'a\\v{c}, Ngai-Man Cheung, Peter Richt\\'arik, Selin Damla Ahipa\\c{s}ao\\u{g}lu","submitted_at":"2013-11-04T19:03:31Z","abstract_excerpt":"We propose a novel topic discovery algorithm for unlabeled images based on the bag-of-words (BoW) framework. We first extract a dictionary of visual words and subsequently for each image compute a visual word occurrence histogram. We view these histograms as rows of a large matrix from which we extract sparse principal components (PCs). Each PC identifies a sparse combination of visual words which co-occur frequently in some images but seldom appear in others. Each sparse PC corresponds to a topic, and images whose interference with the PC is high belong to that topic, revealing the common par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1406","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":"1311.1406","created_at":"2026-05-18T03:07:53.454913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1406v1","created_at":"2026-05-18T03:07:53.454913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1406","created_at":"2026-05-18T03:07:53.454913+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5TSSG5M4L34","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5TSSG5M4L344MTS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5TSSG5M","created_at":"2026-05-18T12:28:06.772260+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/Y5TSSG5M4L344MTS52MSFILLYK","json":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK.json","graph_json":"https://pith.science/api/pith-number/Y5TSSG5M4L344MTS52MSFILLYK/graph.json","events_json":"https://pith.science/api/pith-number/Y5TSSG5M4L344MTS52MSFILLYK/events.json","paper":"https://pith.science/paper/Y5TSSG5M"},"agent_actions":{"view_html":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK","download_json":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK.json","view_paper":"https://pith.science/paper/Y5TSSG5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1406&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5TSSG5M4L344MTS52MSFILLYK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5TSSG5M4L344MTS52MSFILLYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK/action/storage_attestation","attest_author":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK/action/author_attestation","sign_citation":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK/action/citation_signature","submit_replication":"https://pith.science/pith/Y5TSSG5M4L344MTS52MSFILLYK/action/replication_record"}},"created_at":"2026-05-18T03:07:53.454913+00:00","updated_at":"2026-05-18T03:07:53.454913+00:00"}