{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ALSC6PNZSUKHAPAVQXTLB27RRT","short_pith_number":"pith:ALSC6PNZ","canonical_record":{"source":{"id":"2109.15021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-30T11:28:35Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"25c446e3f3e6983d1386f683947dc1bde9e01d1e21cff7ee70c609818f00f331","abstract_canon_sha256":"7cd555ff34a28c7222689b69ab6d618fb46a391588e5f911110a9edb29045c92"},"schema_version":"1.0"},"canonical_sha256":"02e42f3db99514703c1585e6b0ebf18ce4426da162703826fec40d01195c69a3","source":{"kind":"arxiv","id":"2109.15021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.15021","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2109.15021v1","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.15021","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"ALSC6PNZSUKH","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"ALSC6PNZSUKHAPAV","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"ALSC6PNZ","created_at":"2026-07-05T03:18:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ALSC6PNZSUKHAPAVQXTLB27RRT","target":"record","payload":{"canonical_record":{"source":{"id":"2109.15021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-30T11:28:35Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"25c446e3f3e6983d1386f683947dc1bde9e01d1e21cff7ee70c609818f00f331","abstract_canon_sha256":"7cd555ff34a28c7222689b69ab6d618fb46a391588e5f911110a9edb29045c92"},"schema_version":"1.0"},"canonical_sha256":"02e42f3db99514703c1585e6b0ebf18ce4426da162703826fec40d01195c69a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:47.290872Z","signature_b64":"ColeZlYxruMAgSwr02CNYTtvLdYMQApKTfLz/xX45Jw+snSLmRLELWEjlT+eXGtWM/eRvPOYYWNtSPGg2876Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e42f3db99514703c1585e6b0ebf18ce4426da162703826fec40d01195c69a3","last_reissued_at":"2026-07-05T03:18:47.290480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:47.290480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.15021","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-07-05T03:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLeRXMNehwBkwBz7TsXqa+H5/xQMv+P0cYT4Fh5UijwgysYJeGOPb4m2gOAfKrl7kp2NG9Q8/CND+z3ZlzWEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:32:56.262960Z"},"content_sha256":"a309d311ce9ef86e408d39a227dd62afa3fd1d462d734c26404242ca3d66196f","schema_version":"1.0","event_id":"sha256:a309d311ce9ef86e408d39a227dd62afa3fd1d462d734c26404242ca3d66196f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ALSC6PNZSUKHAPAVQXTLB27RRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Riemannian Approach for Constrained Optimization Model in Extreme Classification Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Jayadev Naram, Pawan Kumar, Tanmay Kumar Sinha","submitted_at":"2021-09-30T11:28:35Z","abstract_excerpt":"We propose a novel Riemannian method for solving the Extreme multi-label classification problem that exploits the geometric structure of the sparse low-dimensional local embedding models. A constrained optimization problem is formulated as an optimization problem on matrix manifold and solved using a Riemannian optimization method. The proposed approach is tested on several real world large scale multi-label datasets and its usefulness is demonstrated through numerical experiments. The numerical experiments suggest that the proposed method is fastest to train and has least model size among the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.15021","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/2109.15021/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"},"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-07-05T03:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lahhlxUXkLI0OUh8BrWSt2Md1yb/AUGzfLpQmqqpJhW/CDmllv2Ja40KGjGkPo31KVDudST+h/fXazgt4wFcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:32:56.263359Z"},"content_sha256":"41fc8b334b2848e11a8c1c586a8f85db6be449821c43f45e478cc53d881dad52","schema_version":"1.0","event_id":"sha256:41fc8b334b2848e11a8c1c586a8f85db6be449821c43f45e478cc53d881dad52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/bundle.json","state_url":"https://pith.science/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/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-09T04:32:56Z","links":{"resolver":"https://pith.science/pith/ALSC6PNZSUKHAPAVQXTLB27RRT","bundle":"https://pith.science/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/bundle.json","state":"https://pith.science/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALSC6PNZSUKHAPAVQXTLB27RRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ALSC6PNZSUKHAPAVQXTLB27RRT","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":"7cd555ff34a28c7222689b69ab6d618fb46a391588e5f911110a9edb29045c92","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-30T11:28:35Z","title_canon_sha256":"25c446e3f3e6983d1386f683947dc1bde9e01d1e21cff7ee70c609818f00f331"},"schema_version":"1.0","source":{"id":"2109.15021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.15021","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2109.15021v1","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.15021","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"ALSC6PNZSUKH","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"ALSC6PNZSUKHAPAV","created_at":"2026-07-05T03:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"ALSC6PNZ","created_at":"2026-07-05T03:18:47Z"}],"graph_snapshots":[{"event_id":"sha256:41fc8b334b2848e11a8c1c586a8f85db6be449821c43f45e478cc53d881dad52","target":"graph","created_at":"2026-07-05T03:18:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.15021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel Riemannian method for solving the Extreme multi-label classification problem that exploits the geometric structure of the sparse low-dimensional local embedding models. A constrained optimization problem is formulated as an optimization problem on matrix manifold and solved using a Riemannian optimization method. The proposed approach is tested on several real world large scale multi-label datasets and its usefulness is demonstrated through numerical experiments. The numerical experiments suggest that the proposed method is fastest to train and has least model size among the","authors_text":"Jayadev Naram, Pawan Kumar, Tanmay Kumar Sinha","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-30T11:28:35Z","title":"On Riemannian Approach for Constrained Optimization Model in Extreme Classification Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.15021","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:a309d311ce9ef86e408d39a227dd62afa3fd1d462d734c26404242ca3d66196f","target":"record","created_at":"2026-07-05T03:18:47Z","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":"7cd555ff34a28c7222689b69ab6d618fb46a391588e5f911110a9edb29045c92","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-30T11:28:35Z","title_canon_sha256":"25c446e3f3e6983d1386f683947dc1bde9e01d1e21cff7ee70c609818f00f331"},"schema_version":"1.0","source":{"id":"2109.15021","kind":"arxiv","version":1}},"canonical_sha256":"02e42f3db99514703c1585e6b0ebf18ce4426da162703826fec40d01195c69a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02e42f3db99514703c1585e6b0ebf18ce4426da162703826fec40d01195c69a3","first_computed_at":"2026-07-05T03:18:47.290480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:18:47.290480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ColeZlYxruMAgSwr02CNYTtvLdYMQApKTfLz/xX45Jw+snSLmRLELWEjlT+eXGtWM/eRvPOYYWNtSPGg2876Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:18:47.290872Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.15021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a309d311ce9ef86e408d39a227dd62afa3fd1d462d734c26404242ca3d66196f","sha256:41fc8b334b2848e11a8c1c586a8f85db6be449821c43f45e478cc53d881dad52"],"state_sha256":"2efe4fdf3fb7f68fe2a24679d997d531394445c3cc28b4a0b2f722a0d1161fd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+V298qA8jkFWgxFPAxB5xgQVv0hsU1ZQ6IKB4UMEmtQbwoaeE7wVSUqLWba5iU3UExcRW/SiwTjJI49NGoYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:32:56.265380Z","bundle_sha256":"40ac578ac12ed6df7e868e080ca03244ed3eecfef4eef299274544ee3b3bde1d"}}