{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2TZW3DNQLXYF7ZJTVXPB3FXW5Z","short_pith_number":"pith:2TZW3DNQ","schema_version":"1.0","canonical_sha256":"d4f36d8db05df05fe533adde1d96f6ee759d140b77bc5b375edff63de5a56f05","source":{"kind":"arxiv","id":"1906.01876","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of Distinct Support Vectors for Interactive Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hiroki Arimura, Kentaro Kanamori, Masakazu Ishihata, Satoshi Hara","submitted_at":"2019-06-05T08:22:16Z","abstract_excerpt":"In conventional prediction tasks, a machine learning algorithm outputs a single best model that globally optimizes its objective function, which typically is accuracy. Therefore, users cannot access the other models explicitly. In contrast to this, multiple model enumeration attracts increasing interests in non-standard machine learning applications where other criteria, e.g., interpretability or fairness, than accuracy are main concern and a user may want to access more than one non-optimal, but suitable models. In this paper, we propose a K-best model enumeration algorithm for Support Vector"},"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":"1906.01876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T08:22:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca8b93998c382d5de6ca6065762ec42f0f9bdc1f23f1bcaa724c04ba7342824e","abstract_canon_sha256":"47bd835aa6d8ee375dacab0ca8f4a054315162318ec0e8a3b016da57ff404f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.901153Z","signature_b64":"+nfNFeDSqOf6EZ3Qhr2hnmjZ6rHMnAm0dStYxgrHbv5zZSFJwI5CYQkPGVcJkEe0LHWjCEI0dKU0AZ9a3y2EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f36d8db05df05fe533adde1d96f6ee759d140b77bc5b375edff63de5a56f05","last_reissued_at":"2026-05-17T23:44:05.900414Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.900414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of Distinct Support Vectors for Interactive Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hiroki Arimura, Kentaro Kanamori, Masakazu Ishihata, Satoshi Hara","submitted_at":"2019-06-05T08:22:16Z","abstract_excerpt":"In conventional prediction tasks, a machine learning algorithm outputs a single best model that globally optimizes its objective function, which typically is accuracy. Therefore, users cannot access the other models explicitly. In contrast to this, multiple model enumeration attracts increasing interests in non-standard machine learning applications where other criteria, e.g., interpretability or fairness, than accuracy are main concern and a user may want to access more than one non-optimal, but suitable models. In this paper, we propose a K-best model enumeration algorithm for Support Vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01876","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":"1906.01876","created_at":"2026-05-17T23:44:05.900536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01876v1","created_at":"2026-05-17T23:44:05.900536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01876","created_at":"2026-05-17T23:44:05.900536+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TZW3DNQLXYF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TZW3DNQLXYF7ZJT","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TZW3DNQ","created_at":"2026-05-18T12:33:07.085635+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/2TZW3DNQLXYF7ZJTVXPB3FXW5Z","json":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z.json","graph_json":"https://pith.science/api/pith-number/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/graph.json","events_json":"https://pith.science/api/pith-number/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/events.json","paper":"https://pith.science/paper/2TZW3DNQ"},"agent_actions":{"view_html":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z","download_json":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z.json","view_paper":"https://pith.science/paper/2TZW3DNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01876&json=true","fetch_graph":"https://pith.science/api/pith-number/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/action/storage_attestation","attest_author":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/action/author_attestation","sign_citation":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/action/citation_signature","submit_replication":"https://pith.science/pith/2TZW3DNQLXYF7ZJTVXPB3FXW5Z/action/replication_record"}},"created_at":"2026-05-17T23:44:05.900536+00:00","updated_at":"2026-05-17T23:44:05.900536+00:00"}