{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X7SANQHLBJLEHEHSE4NOZWJ7A7","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":"5f7b4b052308eb53c0c7053ce1c149308741615b28c9574588c5a5b167e77371","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T01:11:25Z","title_canon_sha256":"acbf0571ad31921962846740816e619fddf44fb9aef40d0af8b32cb0fe04429e"},"schema_version":"1.0","source":{"id":"2502.08873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08873","created_at":"2026-07-05T10:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08873v1","created_at":"2026-07-05T10:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08873","created_at":"2026-07-05T10:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"X7SANQHLBJLE","created_at":"2026-07-05T10:13:48Z"},{"alias_kind":"pith_short_16","alias_value":"X7SANQHLBJLEHEHS","created_at":"2026-07-05T10:13:48Z"},{"alias_kind":"pith_short_8","alias_value":"X7SANQHL","created_at":"2026-07-05T10:13:48Z"}],"graph_snapshots":[{"event_id":"sha256:9543f4f9651de1151fe6131b065eca5df7d00897e7409069cecb8057c4deb393","target":"graph","created_at":"2026-07-05T10:13:48Z","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/2502.08873/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of semi-supervised learning on graphs in the regime where data labels are scarce or possibly corrupted. We propose an approach called $p$-conductance learning that generalizes the $p$-Laplace and Poisson learning methods by introducing an objective reminiscent of $p$-Laplacian regularization and an affine relaxation of the label constraints. This leads to a family of probability measure mincut programs that balance sparse edge removal with accurate distribution separation. Our theoretical analysis connects these programs to well-known variational and probabilistic problems","authors_text":"Alexander Cloninger, Chester Holtz, Gal Mishne, Sawyer Jack Robertson, Zhengchao Wan","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T01:11:25Z","title":"Robust Graph-Based Semi-Supervised Learning via $p$-Conductances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08873","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:4bc2270bd9bf0036abdd536e83f686d68895749cdf8ebef9ff408fcc5f8553d2","target":"record","created_at":"2026-07-05T10:13:48Z","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":"5f7b4b052308eb53c0c7053ce1c149308741615b28c9574588c5a5b167e77371","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T01:11:25Z","title_canon_sha256":"acbf0571ad31921962846740816e619fddf44fb9aef40d0af8b32cb0fe04429e"},"schema_version":"1.0","source":{"id":"2502.08873","kind":"arxiv","version":1}},"canonical_sha256":"bfe406c0eb0a564390f2271aecd93f07f7bd3e049bfa962b3360ab3cf23e3649","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfe406c0eb0a564390f2271aecd93f07f7bd3e049bfa962b3360ab3cf23e3649","first_computed_at":"2026-07-05T10:13:48.927513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:48.927513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DzVyERwX6CNhh630sX5PrZVciiadnKELKvGOOJ36YPiDcj4Y336G8EXt3RrhDdpPOafZw+3VeA14P29gQrIvBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:48.928016Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bc2270bd9bf0036abdd536e83f686d68895749cdf8ebef9ff408fcc5f8553d2","sha256:9543f4f9651de1151fe6131b065eca5df7d00897e7409069cecb8057c4deb393"],"state_sha256":"d793e109b495a7fdd48c3be20ab500e0c77e190705b01660bcc25dd5a9b93531"}