{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:INV7AO7TIIGELIXSY3QWYQ4EA7","short_pith_number":"pith:INV7AO7T","schema_version":"1.0","canonical_sha256":"436bf03bf3420c45a2f2c6e16c438407cf7aefc09a5ade01634487ef9d1056af","source":{"kind":"arxiv","id":"1712.05510","version":1},"attestation_state":"computed","paper":{"title":"Graph-Sparse Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander LeNail, Ernest Fraenkel, Johnathan Li, Karen Sachs, Ludwig Schmidt, Stefanie Jegelka, Tobias Ehrenberger","submitted_at":"2017-12-15T02:17:06Z","abstract_excerpt":"We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We val- idate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformatics context of proteomics data on the interactome graph. We make all our experimental code public and provide GSLR as an open source package."},"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.05510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-15T02:17:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"03110b25f8791a3a7dcee2f86d0d9b79fc25e83075eddc5497a98b0eff03e01d","abstract_canon_sha256":"f5c0c50e05a89af69be2de01c0b6f0d951ccdb98cd21b6ef0155095a29b666b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.265940Z","signature_b64":"uvP9KzJPBsZll3LEzWs6zQ8YFNsRe0J3fFJPVv/X8r9NNbmN/cNeBkh4Q37W1QgQcTHlwTBApbzF5nnD0PuuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"436bf03bf3420c45a2f2c6e16c438407cf7aefc09a5ade01634487ef9d1056af","last_reissued_at":"2026-05-18T00:27:56.265333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.265333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Sparse Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander LeNail, Ernest Fraenkel, Johnathan Li, Karen Sachs, Ludwig Schmidt, Stefanie Jegelka, Tobias Ehrenberger","submitted_at":"2017-12-15T02:17:06Z","abstract_excerpt":"We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We val- idate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformatics context of proteomics data on the interactome graph. We make all our experimental code public and provide GSLR as an open source package."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05510","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.05510","created_at":"2026-05-18T00:27:56.265401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05510v1","created_at":"2026-05-18T00:27:56.265401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05510","created_at":"2026-05-18T00:27:56.265401+00:00"},{"alias_kind":"pith_short_12","alias_value":"INV7AO7TIIGE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"INV7AO7TIIGELIXS","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"INV7AO7T","created_at":"2026-05-18T12:31:21.493067+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/INV7AO7TIIGELIXSY3QWYQ4EA7","json":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7.json","graph_json":"https://pith.science/api/pith-number/INV7AO7TIIGELIXSY3QWYQ4EA7/graph.json","events_json":"https://pith.science/api/pith-number/INV7AO7TIIGELIXSY3QWYQ4EA7/events.json","paper":"https://pith.science/paper/INV7AO7T"},"agent_actions":{"view_html":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7","download_json":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7.json","view_paper":"https://pith.science/paper/INV7AO7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05510&json=true","fetch_graph":"https://pith.science/api/pith-number/INV7AO7TIIGELIXSY3QWYQ4EA7/graph.json","fetch_events":"https://pith.science/api/pith-number/INV7AO7TIIGELIXSY3QWYQ4EA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7/action/storage_attestation","attest_author":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7/action/author_attestation","sign_citation":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7/action/citation_signature","submit_replication":"https://pith.science/pith/INV7AO7TIIGELIXSY3QWYQ4EA7/action/replication_record"}},"created_at":"2026-05-18T00:27:56.265401+00:00","updated_at":"2026-05-18T00:27:56.265401+00:00"}