{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7PGIWZDLQ46TTG2JCFTGGHFFE6","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":"0964fbe76309bbc0a95296620d58a80508ab871bfe5161ecd087fb51ed59d887","cross_cats_sorted":["cs.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-04T23:30:20Z","title_canon_sha256":"5b722158ff7d991064c3125e992b76ed1b1da2f8988d28d5e6428c30b444463b"},"schema_version":"1.0","source":{"id":"1408.0838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0838","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0838v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0838","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"7PGIWZDLQ46T","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7PGIWZDLQ46TTG2J","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7PGIWZDL","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:d35278f4bd202444b2c38e751a5337f522e8747ccd5c9c528d290bee8f86f652","target":"graph","created_at":"2026-05-18T02:45:50Z","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"},"paper":{"abstract_excerpt":"Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of estimating an equivalence relation on a set) and ranking (the problem of estimating a linear order on a set). We contribute a family of probability measures on the set of all relations between two finite, non-empty sets, which offers a joint abstraction of multi-label classification, correlation clustering and ranking by linear ordering. Estimating (learning) a ma","authors_text":"Bjoern Andres, Lizhen Qu","cross_cats":["cs.NA","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-04T23:30:20Z","title":"Estimating Maximally Probable Constrained Relations by Mathematical Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0838","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:60540fb733d6453c7a0189030587467ace908ad025039e484e71985a3de5f57b","target":"record","created_at":"2026-05-18T02:45:50Z","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":"0964fbe76309bbc0a95296620d58a80508ab871bfe5161ecd087fb51ed59d887","cross_cats_sorted":["cs.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-04T23:30:20Z","title_canon_sha256":"5b722158ff7d991064c3125e992b76ed1b1da2f8988d28d5e6428c30b444463b"},"schema_version":"1.0","source":{"id":"1408.0838","kind":"arxiv","version":1}},"canonical_sha256":"fbcc8b646b873d399b491166631ca527b6750d86989f6fac404c9dc7e34a0c0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbcc8b646b873d399b491166631ca527b6750d86989f6fac404c9dc7e34a0c0d","first_computed_at":"2026-05-18T02:45:50.269547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.269547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kPIpxk2afsmWFFfof032VevA0nTqlnSs6c6lld1KipAYEwvvYb9jhwzYXeVQaW25tRXM/8KbuyCuzxqzNO0NAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.270122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60540fb733d6453c7a0189030587467ace908ad025039e484e71985a3de5f57b","sha256:d35278f4bd202444b2c38e751a5337f522e8747ccd5c9c528d290bee8f86f652"],"state_sha256":"45ee07799bb50e3aeec88ffcbd3d220db309709a9855b7bca63c7d20429195e5"}