{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:33RLH2IIZRVMXNJR4UJYAQNSC4","short_pith_number":"pith:33RLH2II","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"},"canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","source":{"kind":"arxiv","id":"2506.23186","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:33RLH2IIZRVMXNJR4UJYAQNSC4","target":"record","payload":{"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"},"canonical_sha256":"dee2b3e908cc6acbb531e5138041b21703fc684b7af4dcd00220b3372b68b19e","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"},"source_kind":"arxiv","source_id":"2506.23186","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jR2j67PpT2NJp20MHjDVGjhWSFsmzAEjIOkdm59c4uaE7nOMFYoJTagPooYw2qo1eVH9l6gEdSBjiFWG4tmoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:47:58.180219Z"},"content_sha256":"cf0b1f9d93768a0c32a0cb5b32fd24787c5e2675969ec19ea8934607ba13ca30","schema_version":"1.0","event_id":"sha256:cf0b1f9d93768a0c32a0cb5b32fd24787c5e2675969ec19ea8934607ba13ca30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:33RLH2IIZRVMXNJR4UJYAQNSC4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLywVDODDv0nlmbYgsSiPEFXk9T68c4yFmWKUUh+6biXO5/wLvX5uUxnik18jOEHDWSUKcMx7rgnP6lP7n5hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:47:58.180737Z"},"content_sha256":"eec9faa7efd0d9741f7d6a908b44e7e0162a9d6f8cc76391e8c1fc68f6fefbcd","schema_version":"1.0","event_id":"sha256:eec9faa7efd0d9741f7d6a908b44e7e0162a9d6f8cc76391e8c1fc68f6fefbcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/bundle.json","state_url":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T10:47:58Z","links":{"resolver":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4","bundle":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/bundle.json","state":"https://pith.science/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33RLH2IIZRVMXNJR4UJYAQNSC4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kyC0WADCYMCv5k/e/G/QOA2RBc88b8CS9dWiBcjQLItlaOKq1TKKpqrLilCGLcpP74em7P8PZ/uBeZu4Lp7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:47:58.185327Z","bundle_sha256":"deeb15e215cc1f1721ac80fdef067314c52562b8d40bb6829a7baa3db4e1144b"}}