{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MD7J33V5SKHCQQJPSXT6EFBCCQ","short_pith_number":"pith:MD7J33V5","schema_version":"1.0","canonical_sha256":"60fe9deebd928e28412f95e7e2142214233a60cfce3a3b7969e893170db8a77a","source":{"kind":"arxiv","id":"1908.08281","version":1},"attestation_state":"computed","paper":{"title":"Block Randomized Optimization for Adaptive Hypergraph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SI","authors_text":"Constantine Kotropoulos, Georgios Karantaidis, Ioannis Sarridis","submitted_at":"2019-08-22T09:41:04Z","abstract_excerpt":"The high-order relations between the content in social media sharing platforms are frequently modeled by a hypergraph. Either hypergraph Laplacian matrix or the adjacency matrix is a big matrix. Randomized algorithms are used for low-rank factorizations in order to approximately decompose and eventually invert such big matrices fast. Here, block randomized Singular Value Decomposition (SVD) via subspace iteration is integrated within adaptive hypergraph weight estimation for image tagging, as a first approach. Specifically, creating low-rank submatrices along the main diagonal by tessellation "},"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":"1908.08281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-22T09:41:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6b0798eea083b7cef9899335b6372d052c1187b9d85bc6101ebd45511c972505","abstract_canon_sha256":"8db39e3ce31a50d0d4ad7314257c66ed3600286d1f571f0daeabca2faf2da537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:11.403257Z","signature_b64":"p1ZGQJ0zcb6ZIpiKoU498Uv0ti/m4twyWDYA9CLs2+UuH6Ma/y6y3yTfWrU63wTyXFHiZrlqMw5sQZGxKtisBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60fe9deebd928e28412f95e7e2142214233a60cfce3a3b7969e893170db8a77a","last_reissued_at":"2026-07-04T23:59:11.402891Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:11.402891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Randomized Optimization for Adaptive Hypergraph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SI","authors_text":"Constantine Kotropoulos, Georgios Karantaidis, Ioannis Sarridis","submitted_at":"2019-08-22T09:41:04Z","abstract_excerpt":"The high-order relations between the content in social media sharing platforms are frequently modeled by a hypergraph. Either hypergraph Laplacian matrix or the adjacency matrix is a big matrix. Randomized algorithms are used for low-rank factorizations in order to approximately decompose and eventually invert such big matrices fast. Here, block randomized Singular Value Decomposition (SVD) via subspace iteration is integrated within adaptive hypergraph weight estimation for image tagging, as a first approach. Specifically, creating low-rank submatrices along the main diagonal by tessellation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08281","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08281/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.08281","created_at":"2026-07-04T23:59:11.402947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08281v1","created_at":"2026-07-04T23:59:11.402947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08281","created_at":"2026-07-04T23:59:11.402947+00:00"},{"alias_kind":"pith_short_12","alias_value":"MD7J33V5SKHC","created_at":"2026-07-04T23:59:11.402947+00:00"},{"alias_kind":"pith_short_16","alias_value":"MD7J33V5SKHCQQJP","created_at":"2026-07-04T23:59:11.402947+00:00"},{"alias_kind":"pith_short_8","alias_value":"MD7J33V5","created_at":"2026-07-04T23:59:11.402947+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08281","citing_title":"Block Randomized Optimization for Adaptive Hypergraph Learning","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ","json":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ.json","graph_json":"https://pith.science/api/pith-number/MD7J33V5SKHCQQJPSXT6EFBCCQ/graph.json","events_json":"https://pith.science/api/pith-number/MD7J33V5SKHCQQJPSXT6EFBCCQ/events.json","paper":"https://pith.science/paper/MD7J33V5"},"agent_actions":{"view_html":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ","download_json":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ.json","view_paper":"https://pith.science/paper/MD7J33V5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08281&json=true","fetch_graph":"https://pith.science/api/pith-number/MD7J33V5SKHCQQJPSXT6EFBCCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MD7J33V5SKHCQQJPSXT6EFBCCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ/action/storage_attestation","attest_author":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ/action/author_attestation","sign_citation":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ/action/citation_signature","submit_replication":"https://pith.science/pith/MD7J33V5SKHCQQJPSXT6EFBCCQ/action/replication_record"}},"created_at":"2026-07-04T23:59:11.402947+00:00","updated_at":"2026-07-04T23:59:11.402947+00:00"}