{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:33RLH2IIZRVMXNJR4UJYAQNSC4","short_pith_number":"pith:33RLH2II","schema_version":"1.0","canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","source":{"kind":"arxiv","id":"2506.23186","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Esposito, Marco Bressan, Maximilian Thiessen, Victor Chepoi","submitted_at":"2025-06-29T11:14:16Z","abstract_excerpt":"Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph halfspaces defined through closure under induced paths. Our main result is a $2$-satisfiability based decomposition theorem, which allows one to represent monophonic halfspaces as a disjoint union of certain vertex subsets. Using this decomposition, we achieve efficient and (nearly) optimal algorithms for various learning problems, such as teaching, active, and onli"},"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":"2506.23186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-29T11:14:16Z","cross_cats_sorted":["cs.DM","math.CO","stat.ML"],"title_canon_sha256":"75baab9c4794570de63a9f445144db59e7e9fee078c0fb0da16c3834a9d2fa73","abstract_canon_sha256":"81181fcfe66921cc4963cbd8c6e8931d87590b4fe6d974782129aae322451b01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:17.282741Z","signature_b64":"hCecVNKXX93eoQG/csgbCXPVwSOm1NbH+x6P7JPYqMRHm60trvHbPyBGUSd+cuhsrVKxVdJsRvN4Lh4IFuAOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","last_reissued_at":"2026-07-05T11:29:17.282217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:17.282217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Esposito, Marco Bressan, Maximilian Thiessen, Victor Chepoi","submitted_at":"2025-06-29T11:14:16Z","abstract_excerpt":"Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph halfspaces defined through closure under induced paths. Our main result is a $2$-satisfiability based decomposition theorem, which allows one to represent monophonic halfspaces as a disjoint union of certain vertex subsets. Using this decomposition, we achieve efficient and (nearly) optimal algorithms for various learning problems, such as teaching, active, and onli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23186","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/2506.23186/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.23186","created_at":"2026-07-05T11:29:17.282281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23186v1","created_at":"2026-07-05T11:29:17.282281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23186","created_at":"2026-07-05T11:29:17.282281+00:00"},{"alias_kind":"pith_short_12","alias_value":"33RLH2IIZRVM","created_at":"2026-07-05T11:29:17.282281+00:00"},{"alias_kind":"pith_short_16","alias_value":"33RLH2IIZRVMXNJR","created_at":"2026-07-05T11:29:17.282281+00:00"},{"alias_kind":"pith_short_8","alias_value":"33RLH2II","created_at":"2026-07-05T11:29:17.282281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16159","citing_title":"Halfspace separation in geodesic convexity","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4","json":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4.json","graph_json":"https://pith.science/api/pith-number/33RLH2IIZRVMXNJR4UJYAQNSC4/graph.json","events_json":"https://pith.science/api/pith-number/33RLH2IIZRVMXNJR4UJYAQNSC4/events.json","paper":"https://pith.science/paper/33RLH2II"},"agent_actions":{"view_html":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4","download_json":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4.json","view_paper":"https://pith.science/paper/33RLH2II","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23186&json=true","fetch_graph":"https://pith.science/api/pith-number/33RLH2IIZRVMXNJR4UJYAQNSC4/graph.json","fetch_events":"https://pith.science/api/pith-number/33RLH2IIZRVMXNJR4UJYAQNSC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/action/storage_attestation","attest_author":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/action/author_attestation","sign_citation":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/action/citation_signature","submit_replication":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/action/replication_record"}},"created_at":"2026-07-05T11:29:17.282281+00:00","updated_at":"2026-07-05T11:29:17.282281+00:00"}