{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:33RLH2IIZRVMXNJR4UJYAQNSC4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"81181fcfe66921cc4963cbd8c6e8931d87590b4fe6d974782129aae322451b01","cross_cats_sorted":["cs.DM","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-29T11:14:16Z","title_canon_sha256":"75baab9c4794570de63a9f445144db59e7e9fee078c0fb0da16c3834a9d2fa73"},"schema_version":"1.0","source":{"id":"2506.23186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23186","created_at":"2026-07-05T11:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23186v1","created_at":"2026-07-05T11:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23186","created_at":"2026-07-05T11:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"33RLH2IIZRVM","created_at":"2026-07-05T11:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"33RLH2IIZRVMXNJR","created_at":"2026-07-05T11:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"33RLH2II","created_at":"2026-07-05T11:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:eec9faa7efd0d9741f7d6a908b44e7e0162a9d6f8cc76391e8c1fc68f6fefbcd","target":"graph","created_at":"2026-07-05T11:29:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.23186/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Emmanuel Esposito, Marco Bressan, Maximilian Thiessen, Victor Chepoi","cross_cats":["cs.DM","math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-29T11:14:16Z","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23186","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf0b1f9d93768a0c32a0cb5b32fd24787c5e2675969ec19ea8934607ba13ca30","target":"record","created_at":"2026-07-05T11:29:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"81181fcfe66921cc4963cbd8c6e8931d87590b4fe6d974782129aae322451b01","cross_cats_sorted":["cs.DM","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-29T11:14:16Z","title_canon_sha256":"75baab9c4794570de63a9f445144db59e7e9fee078c0fb0da16c3834a9d2fa73"},"schema_version":"1.0","source":{"id":"2506.23186","kind":"arxiv","version":1}},"canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","first_computed_at":"2026-07-05T11:29:17.282217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:29:17.282217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCecVNKXX93eoQG/csgbCXPVwSOm1NbH+x6P7JPYqMRHm60trvHbPyBGUSd+cuhsrVKxVdJsRvN4Lh4IFuAOAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:29:17.282741Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf0b1f9d93768a0c32a0cb5b32fd24787c5e2675969ec19ea8934607ba13ca30","sha256:eec9faa7efd0d9741f7d6a908b44e7e0162a9d6f8cc76391e8c1fc68f6fefbcd"],"state_sha256":"9fb073f063a3c0229afae3df3cff5253f6fff30e9016d95b00a3eab263c8b46f"}