{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3SSEZ3GON7OLWUJQKUJQFOSY46","short_pith_number":"pith:3SSEZ3GO","canonical_record":{"source":{"id":"1505.04406","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-17T15:19:09Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f8da11cc6191cc501533ade254a44f38b937a99a0d2aba487db45a93187d1fe7","abstract_canon_sha256":"cfe9e9ce4299d747dae7364d7e5c02a22f8e2ba23dc91006cbcaa48e37f0224a"},"schema_version":"1.0"},"canonical_sha256":"dca44cecce6fdcbb5130551302ba58e78262fa65d8bacecdf2bca3045d06849b","source":{"kind":"arxiv","id":"1505.04406","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04406","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04406v3","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04406","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"3SSEZ3GON7OL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SSEZ3GON7OLWUJQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SSEZ3GO","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3SSEZ3GON7OLWUJQKUJQFOSY46","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04406","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-17T15:19:09Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f8da11cc6191cc501533ade254a44f38b937a99a0d2aba487db45a93187d1fe7","abstract_canon_sha256":"cfe9e9ce4299d747dae7364d7e5c02a22f8e2ba23dc91006cbcaa48e37f0224a"},"schema_version":"1.0"},"canonical_sha256":"dca44cecce6fdcbb5130551302ba58e78262fa65d8bacecdf2bca3045d06849b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.817423Z","signature_b64":"flC12+ly9edPH7uXZI7IyUTlsp8IlAVNyyHGFLwfZPh4v+gYC16VpDrryrfHCU0e/A2XBw5roRbK2BfwowSLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca44cecce6fdcbb5130551302ba58e78262fa65d8bacecdf2bca3045d06849b","last_reissued_at":"2026-05-18T00:30:22.816769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.816769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04406","source_version":3,"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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/Udy8yriwbb5K38cosUWxPJBktm+g0t+G3eeygN9Q56lX6M9ffbHWS5QyVGbJZEcMFFyq6ZZBttFgWnKarKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:35:27.010155Z"},"content_sha256":"0b6d6e36eeaaa8f1c49e74c6a778e0d851fa64731ce250f66bf24eb05d84090b","schema_version":"1.0","event_id":"sha256:0b6d6e36eeaaa8f1c49e74c6a778e0d851fa64731ce250f66bf24eb05d84090b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3SSEZ3GON7OLWUJQKUJQFOSY46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hinge-Loss Markov Random Fields and Probabilistic Soft Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bert Huang, Lise Getoor, Matthias Broecheler, Stephen H. Bach","submitted_at":"2015-05-17T15:19:09Z","abstract_excerpt":"A fundamental challenge in developing high-impact machine learning technologies is balancing the need to model rich, structured domains with the ability to scale to big data. Many important problem areas are both richly structured and large scale, from social and biological networks, to knowledge graphs and the Web, to images, video, and natural language. In this paper, we introduce two new formalisms for modeling structured data, and show that they can both capture rich structure and scale to big data. The first, hinge-loss Markov random fields (HL-MRFs), is a new kind of probabilistic graphi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04406","kind":"arxiv","version":3},"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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu5NjnKZnz1WAS73z3sgQHv2vNeoxdo/KKqMsBFxCCZXp/3bGE9F9eE3EHpex27GuZKlHCLd2+3yuuEE9oV+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:35:27.010851Z"},"content_sha256":"3345e93f11313773cddbdf879583eb79579f927061ce6b9fe1b38a9c63b1285a","schema_version":"1.0","event_id":"sha256:3345e93f11313773cddbdf879583eb79579f927061ce6b9fe1b38a9c63b1285a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/bundle.json","state_url":"https://pith.science/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/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-31T23:35:27Z","links":{"resolver":"https://pith.science/pith/3SSEZ3GON7OLWUJQKUJQFOSY46","bundle":"https://pith.science/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/bundle.json","state":"https://pith.science/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SSEZ3GON7OLWUJQKUJQFOSY46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3SSEZ3GON7OLWUJQKUJQFOSY46","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":"cfe9e9ce4299d747dae7364d7e5c02a22f8e2ba23dc91006cbcaa48e37f0224a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-17T15:19:09Z","title_canon_sha256":"f8da11cc6191cc501533ade254a44f38b937a99a0d2aba487db45a93187d1fe7"},"schema_version":"1.0","source":{"id":"1505.04406","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04406","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04406v3","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04406","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"3SSEZ3GON7OL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SSEZ3GON7OLWUJQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SSEZ3GO","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:3345e93f11313773cddbdf879583eb79579f927061ce6b9fe1b38a9c63b1285a","target":"graph","created_at":"2026-05-18T00:30:22Z","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":"A fundamental challenge in developing high-impact machine learning technologies is balancing the need to model rich, structured domains with the ability to scale to big data. Many important problem areas are both richly structured and large scale, from social and biological networks, to knowledge graphs and the Web, to images, video, and natural language. In this paper, we introduce two new formalisms for modeling structured data, and show that they can both capture rich structure and scale to big data. The first, hinge-loss Markov random fields (HL-MRFs), is a new kind of probabilistic graphi","authors_text":"Bert Huang, Lise Getoor, Matthias Broecheler, Stephen H. Bach","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-17T15:19:09Z","title":"Hinge-Loss Markov Random Fields and Probabilistic Soft Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04406","kind":"arxiv","version":3},"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:0b6d6e36eeaaa8f1c49e74c6a778e0d851fa64731ce250f66bf24eb05d84090b","target":"record","created_at":"2026-05-18T00:30:22Z","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":"cfe9e9ce4299d747dae7364d7e5c02a22f8e2ba23dc91006cbcaa48e37f0224a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-17T15:19:09Z","title_canon_sha256":"f8da11cc6191cc501533ade254a44f38b937a99a0d2aba487db45a93187d1fe7"},"schema_version":"1.0","source":{"id":"1505.04406","kind":"arxiv","version":3}},"canonical_sha256":"dca44cecce6fdcbb5130551302ba58e78262fa65d8bacecdf2bca3045d06849b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dca44cecce6fdcbb5130551302ba58e78262fa65d8bacecdf2bca3045d06849b","first_computed_at":"2026-05-18T00:30:22.816769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.816769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"flC12+ly9edPH7uXZI7IyUTlsp8IlAVNyyHGFLwfZPh4v+gYC16VpDrryrfHCU0e/A2XBw5roRbK2BfwowSLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.817423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04406","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b6d6e36eeaaa8f1c49e74c6a778e0d851fa64731ce250f66bf24eb05d84090b","sha256:3345e93f11313773cddbdf879583eb79579f927061ce6b9fe1b38a9c63b1285a"],"state_sha256":"35fc084f013b464a0cd245c189d315384ba430ddf2966a5d2aa108bf51de1d2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um4mmFm/bFEbdOGSDoXVRAxYoCvZXWRRXh500vhQoUoSunDOv9RnQVQL7zJ2Mw7mf7B2YwUrFV7y2yB79YJDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:35:27.015424Z","bundle_sha256":"980ae75516413095de591e989914a219e0243dbcc34b624b0ca38c07dd29ff1d"}}