{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CAUATHO2SFOBHN7ZXPFDTEAFAU","short_pith_number":"pith:CAUATHO2","schema_version":"1.0","canonical_sha256":"1028099dda915c13b7f9bbca3990050536418e20e9c71cbadb0dff2c22f84d4a","source":{"kind":"arxiv","id":"1712.06131","version":1},"attestation_state":"computed","paper":{"title":"Super-sparse Learning in Similarity Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ambra Demontis, Battista Biggio, Fabio Roli, Giorgio Fumera, Marco Melis","submitted_at":"2017-12-17T15:59:38Z","abstract_excerpt":"In several applications, input samples are more naturally represented in terms of similarities between each other, rather than in terms of feature vectors. In these settings, machine-learning algorithms can become very computationally demanding, as they may require matching the test samples against a very large set of reference prototypes. To mitigate this issue, different approaches have been developed to reduce the number of required reference prototypes. Current reduction approaches select a small subset of representative prototypes in the space induced by the similarity measure, and then s"},"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":"1712.06131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-17T15:59:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81ac2a8429fa46310dc86ebe296ae06363a9c36eaad996f2bf14852cd5590e34","abstract_canon_sha256":"17b09cc8d5119967b29fb93bbe273d5fe92a148c128b7288cc4ca29fbc2c5788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.014567Z","signature_b64":"NTiqtyOx8LIWoLGv2Qts8JNOby5HyDCTmczxvJ7vwv7LojbwbFc9NHrRO7iOu68UZZeC8TjG3h7vYzyvbTtwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1028099dda915c13b7f9bbca3990050536418e20e9c71cbadb0dff2c22f84d4a","last_reissued_at":"2026-05-18T00:27:51.014005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.014005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-sparse Learning in Similarity Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ambra Demontis, Battista Biggio, Fabio Roli, Giorgio Fumera, Marco Melis","submitted_at":"2017-12-17T15:59:38Z","abstract_excerpt":"In several applications, input samples are more naturally represented in terms of similarities between each other, rather than in terms of feature vectors. In these settings, machine-learning algorithms can become very computationally demanding, as they may require matching the test samples against a very large set of reference prototypes. To mitigate this issue, different approaches have been developed to reduce the number of required reference prototypes. Current reduction approaches select a small subset of representative prototypes in the space induced by the similarity measure, and then s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06131","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":"1712.06131","created_at":"2026-05-18T00:27:51.014082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06131v1","created_at":"2026-05-18T00:27:51.014082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06131","created_at":"2026-05-18T00:27:51.014082+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAUATHO2SFOB","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAUATHO2SFOBHN7Z","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAUATHO2","created_at":"2026-05-18T12:31:10.602751+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/CAUATHO2SFOBHN7ZXPFDTEAFAU","json":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU.json","graph_json":"https://pith.science/api/pith-number/CAUATHO2SFOBHN7ZXPFDTEAFAU/graph.json","events_json":"https://pith.science/api/pith-number/CAUATHO2SFOBHN7ZXPFDTEAFAU/events.json","paper":"https://pith.science/paper/CAUATHO2"},"agent_actions":{"view_html":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU","download_json":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU.json","view_paper":"https://pith.science/paper/CAUATHO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06131&json=true","fetch_graph":"https://pith.science/api/pith-number/CAUATHO2SFOBHN7ZXPFDTEAFAU/graph.json","fetch_events":"https://pith.science/api/pith-number/CAUATHO2SFOBHN7ZXPFDTEAFAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU/action/storage_attestation","attest_author":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU/action/author_attestation","sign_citation":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU/action/citation_signature","submit_replication":"https://pith.science/pith/CAUATHO2SFOBHN7ZXPFDTEAFAU/action/replication_record"}},"created_at":"2026-05-18T00:27:51.014082+00:00","updated_at":"2026-05-18T00:27:51.014082+00:00"}