{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7FGSMUM4P2XWY4DTRQXPJEQFSY","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":"f4e5d33590ecf075d78f4c4e9b8d476ef5793d3a53b69266cbca5ac818fc536e","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:20:50Z","title_canon_sha256":"1df77ebc16a641b1b89b62d0074f11c189c3cba040e2ed3f7c4f10001a2128dd"},"schema_version":"1.0","source":{"id":"2502.13000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13000","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13000v1","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13000","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"7FGSMUM4P2XW","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_16","alias_value":"7FGSMUM4P2XWY4DT","created_at":"2026-07-05T10:16:27Z"},{"alias_kind":"pith_short_8","alias_value":"7FGSMUM4","created_at":"2026-07-05T10:16:27Z"}],"graph_snapshots":[{"event_id":"sha256:8dbd1ccc4fede4dc4c4e0835488c36658028472ed1688dec94907d8ce7d995d6","target":"graph","created_at":"2026-07-05T10:16:27Z","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.13000/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a framework for clustering edge-colored hypergraphs, where the goal is to cluster (equivalently, to color) objects based on the primary type of multiway interactions they participate in. One well-studied objective is to color nodes to minimize the number of unsatisfied hyperedges -- those containing one or more nodes whose color does not match the hyperedge color. We motivate and present advances for several directions that extend beyond this minimization problem. We first provide new algorithms for maximizing satisfied edges, which is the same at optimality but is much more challe","authors_text":"Alex Crane, Blair D. Sullivan, Nate Veldt, Thomas Stanley","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:20:50Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13000","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:3159df8c326769b4057aab33b6e04a7737a48ef369c0ab62868f0d661a501e0a","target":"record","created_at":"2026-07-05T10:16:27Z","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":"f4e5d33590ecf075d78f4c4e9b8d476ef5793d3a53b69266cbca5ac818fc536e","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-18T16:20:50Z","title_canon_sha256":"1df77ebc16a641b1b89b62d0074f11c189c3cba040e2ed3f7c4f10001a2128dd"},"schema_version":"1.0","source":{"id":"2502.13000","kind":"arxiv","version":1}},"canonical_sha256":"f94d26519c7eaf6c70738c2ef49205963d865c053c766199a1c8b1b3aa4f0aed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f94d26519c7eaf6c70738c2ef49205963d865c053c766199a1c8b1b3aa4f0aed","first_computed_at":"2026-07-05T10:16:27.805453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:27.805453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xwJ0Il1yotZXIYgKKb5kPoBi6aVQTy0lmi6VCJwgiqE1E2YxJeoxykfqmlSI0q59x/emj7lNwspWZF8xsRBZCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:27.805961Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3159df8c326769b4057aab33b6e04a7737a48ef369c0ab62868f0d661a501e0a","sha256:8dbd1ccc4fede4dc4c4e0835488c36658028472ed1688dec94907d8ce7d995d6"],"state_sha256":"a45f9955392f581dd72a6d1d8d5d788154f3ff4b9e237f8472600f6da7a1a093"}