{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VLX5MGFFS2L76CVIBQJY6OUA5N","short_pith_number":"pith:VLX5MGFF","schema_version":"1.0","canonical_sha256":"aaefd618a59697ff0aa80c138f3a80eb536f66750d3f40dec4e5619cfd54c4d1","source":{"kind":"arxiv","id":"1503.05782","version":1},"attestation_state":"computed","paper":{"title":"Learning Hypergraph-regularized Attribute Predictors","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ahmed Elgammal, Dan Yang, Mohamed Elhoseiny, Sheng Huang","submitted_at":"2015-03-19T14:31:56Z","abstract_excerpt":"We present a novel attribute learning framework named Hypergraph-based Attribute Predictor (HAP). In HAP, a hypergraph is leveraged to depict the attribute relations in the data. Then the attribute prediction problem is casted as a regularized hypergraph cut problem in which HAP jointly learns a collection of attribute projections from the feature space to a hypergraph embedding space aligned with the attribute space. The learned projections directly act as attribute classifiers (linear and kernelized). This formulation leads to a very efficient approach. By considering our model as a multi-gr"},"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":"1503.05782","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-03-19T14:31:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"08af3ebe1e6ce95b49471392f26b22a8d8b63a7325bbcb768bee0a446c6a919e","abstract_canon_sha256":"8b6411c8568c8d29a297175b75bb57dd4a4c18ecfb8851e14a55e4ea3517a8b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:58.099119Z","signature_b64":"Oh/6zj89ATGSZKn5fO0mJgNvhVRYnkJijkK8561HJQ2PbQAR0r1lLVQOZJlSyMGeUh4IbfYadm4qzDs+4F32AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaefd618a59697ff0aa80c138f3a80eb536f66750d3f40dec4e5619cfd54c4d1","last_reissued_at":"2026-05-18T02:20:58.098495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:58.098495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Hypergraph-regularized Attribute Predictors","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ahmed Elgammal, Dan Yang, Mohamed Elhoseiny, Sheng Huang","submitted_at":"2015-03-19T14:31:56Z","abstract_excerpt":"We present a novel attribute learning framework named Hypergraph-based Attribute Predictor (HAP). In HAP, a hypergraph is leveraged to depict the attribute relations in the data. Then the attribute prediction problem is casted as a regularized hypergraph cut problem in which HAP jointly learns a collection of attribute projections from the feature space to a hypergraph embedding space aligned with the attribute space. The learned projections directly act as attribute classifiers (linear and kernelized). This formulation leads to a very efficient approach. By considering our model as a multi-gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05782","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":"1503.05782","created_at":"2026-05-18T02:20:58.098590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05782v1","created_at":"2026-05-18T02:20:58.098590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05782","created_at":"2026-05-18T02:20:58.098590+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLX5MGFFS2L7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLX5MGFFS2L76CVI","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLX5MGFF","created_at":"2026-05-18T12:29:44.643036+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/VLX5MGFFS2L76CVIBQJY6OUA5N","json":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N.json","graph_json":"https://pith.science/api/pith-number/VLX5MGFFS2L76CVIBQJY6OUA5N/graph.json","events_json":"https://pith.science/api/pith-number/VLX5MGFFS2L76CVIBQJY6OUA5N/events.json","paper":"https://pith.science/paper/VLX5MGFF"},"agent_actions":{"view_html":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N","download_json":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N.json","view_paper":"https://pith.science/paper/VLX5MGFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05782&json=true","fetch_graph":"https://pith.science/api/pith-number/VLX5MGFFS2L76CVIBQJY6OUA5N/graph.json","fetch_events":"https://pith.science/api/pith-number/VLX5MGFFS2L76CVIBQJY6OUA5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N/action/storage_attestation","attest_author":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N/action/author_attestation","sign_citation":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N/action/citation_signature","submit_replication":"https://pith.science/pith/VLX5MGFFS2L76CVIBQJY6OUA5N/action/replication_record"}},"created_at":"2026-05-18T02:20:58.098590+00:00","updated_at":"2026-05-18T02:20:58.098590+00:00"}