{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M6FNUWKAUKXDHDE23RHZ2YA3OJ","short_pith_number":"pith:M6FNUWKA","canonical_record":{"source":{"id":"1301.0604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:58:38Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4a4779da881e884469b177d916be133e90765def7744da990d2e2c4af2112b31","abstract_canon_sha256":"fd1dd4e2e5af01728c9ebf53178dbf3da30cf4759fd75b8d8a3522249d0e7ed6"},"schema_version":"1.0"},"canonical_sha256":"678ada5940a2ae338c9adc4f9d601b7277365710ff6693b26b187545fe7c0fc0","source":{"kind":"arxiv","id":"1301.0604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0604","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0604v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0604","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"M6FNUWKAUKXD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6FNUWKAUKXDHDE2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6FNUWKA","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M6FNUWKAUKXDHDE23RHZ2YA3OJ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:58:38Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4a4779da881e884469b177d916be133e90765def7744da990d2e2c4af2112b31","abstract_canon_sha256":"fd1dd4e2e5af01728c9ebf53178dbf3da30cf4759fd75b8d8a3522249d0e7ed6"},"schema_version":"1.0"},"canonical_sha256":"678ada5940a2ae338c9adc4f9d601b7277365710ff6693b26b187545fe7c0fc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.198545Z","signature_b64":"6yuEAMHGW8TfAxwQfQqgqFNs1hF9NspzBTZ9926m7vg3KWQkEHV1SqA+Hyis5RWNiYFRk6vdNpKTLS9/ZdqkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678ada5940a2ae338c9adc4f9d601b7277365710ff6693b26b187545fe7c0fc0","last_reissued_at":"2026-05-18T03:37:18.197841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.197841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0604","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-05-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NexKONo0nK64OcOQ9T53t1O8uHix73PNqf65xyKJ/JViwM53cRTAAby/R1A7+ISg5oRiweIgfldqbzJwJACjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:57:18.279125Z"},"content_sha256":"2c7702311b5e45f2d5a03939b3546ab03121c54291d9fc7d33e33ad59bd8380e","schema_version":"1.0","event_id":"sha256:2c7702311b5e45f2d5a03939b3546ab03121c54291d9fc7d33e33ad59bd8380e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M6FNUWKAUKXDHDE23RHZ2YA3OJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Probabilistic Models for Relational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ben Taskar, Daphne Koller, Pieter Abbeel","submitted_at":"2012-12-12T15:58:38Z","abstract_excerpt":"In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent.  For example, in hypertext classification, the labels of linked pages are highly correlated.  A standard approach is to classify each entity independently, ignoring the correlations between them.  Recently, Probabilistic Relational Models, a relational version of Bayesian networks, were used to define a joint probabilistic model for a collection of related entities.  In this paper, we present an alternative framework that builds on (conditional) Markov n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0604","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":""},"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-05-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfsJ5Cz5s/aZGyvySVpXMhqM2iUefnpBCVg28hQ8o0UixjwMvEa/KmjdQMWekfU4rqmFRg9uR88S+VZz8tTWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:57:18.279738Z"},"content_sha256":"e76e31302797b70a398178ed8c67572b3c77afe01df5f96c7641513f615fd572","schema_version":"1.0","event_id":"sha256:e76e31302797b70a398178ed8c67572b3c77afe01df5f96c7641513f615fd572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/bundle.json","state_url":"https://pith.science/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/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-05-27T17:57:18Z","links":{"resolver":"https://pith.science/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ","bundle":"https://pith.science/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/bundle.json","state":"https://pith.science/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6FNUWKAUKXDHDE23RHZ2YA3OJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M6FNUWKAUKXDHDE23RHZ2YA3OJ","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":"fd1dd4e2e5af01728c9ebf53178dbf3da30cf4759fd75b8d8a3522249d0e7ed6","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:58:38Z","title_canon_sha256":"4a4779da881e884469b177d916be133e90765def7744da990d2e2c4af2112b31"},"schema_version":"1.0","source":{"id":"1301.0604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0604","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0604v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0604","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"M6FNUWKAUKXD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6FNUWKAUKXDHDE2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6FNUWKA","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:e76e31302797b70a398178ed8c67572b3c77afe01df5f96c7641513f615fd572","target":"graph","created_at":"2026-05-18T03:37:18Z","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":"In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent.  For example, in hypertext classification, the labels of linked pages are highly correlated.  A standard approach is to classify each entity independently, ignoring the correlations between them.  Recently, Probabilistic Relational Models, a relational version of Bayesian networks, were used to define a joint probabilistic model for a collection of related entities.  In this paper, we present an alternative framework that builds on (conditional) Markov n","authors_text":"Ben Taskar, Daphne Koller, Pieter Abbeel","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:58:38Z","title":"Discriminative Probabilistic Models for Relational Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0604","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:2c7702311b5e45f2d5a03939b3546ab03121c54291d9fc7d33e33ad59bd8380e","target":"record","created_at":"2026-05-18T03:37:18Z","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":"fd1dd4e2e5af01728c9ebf53178dbf3da30cf4759fd75b8d8a3522249d0e7ed6","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:58:38Z","title_canon_sha256":"4a4779da881e884469b177d916be133e90765def7744da990d2e2c4af2112b31"},"schema_version":"1.0","source":{"id":"1301.0604","kind":"arxiv","version":1}},"canonical_sha256":"678ada5940a2ae338c9adc4f9d601b7277365710ff6693b26b187545fe7c0fc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"678ada5940a2ae338c9adc4f9d601b7277365710ff6693b26b187545fe7c0fc0","first_computed_at":"2026-05-18T03:37:18.197841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.197841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6yuEAMHGW8TfAxwQfQqgqFNs1hF9NspzBTZ9926m7vg3KWQkEHV1SqA+Hyis5RWNiYFRk6vdNpKTLS9/ZdqkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.198545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c7702311b5e45f2d5a03939b3546ab03121c54291d9fc7d33e33ad59bd8380e","sha256:e76e31302797b70a398178ed8c67572b3c77afe01df5f96c7641513f615fd572"],"state_sha256":"3f6ebc7c2f67e32635253638857e0e05af2fe4f1559f17c34a76eca8a7d56a10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZL8unzaxlV3CoSLhu7gCXT9XPCiMuglfngGwgKxqwR/wsoXB9BXV59T1VuYmnMy3J4332aELvRv8uN2u6v0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:57:18.282230Z","bundle_sha256":"3edf960660069ce05d340eb91238bea6fb8190488a8c0504a1b452c37aee2b46"}}