{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FKFQ5CIZZIPEGBSIGFGOWI44FU","short_pith_number":"pith:FKFQ5CIZ","canonical_record":{"source":{"id":"1203.3469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"4d59c0340c79606fa9788e7ff0cfd4fee36fb3b867eb93dbd54e57b794d01e3e","abstract_canon_sha256":"099e63beb5d90046a1d46a8fe51685514043acd4c4917db4dac67729a468364b"},"schema_version":"1.0"},"canonical_sha256":"2a8b0e8919ca1e430648314ceb239c2d14bc3b82784ede59ed8ebe0d94f532d0","source":{"kind":"arxiv","id":"1203.3469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3469","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3469v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3469","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"FKFQ5CIZZIPE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FKFQ5CIZZIPEGBSI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FKFQ5CIZ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FKFQ5CIZZIPEGBSIGFGOWI44FU","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"4d59c0340c79606fa9788e7ff0cfd4fee36fb3b867eb93dbd54e57b794d01e3e","abstract_canon_sha256":"099e63beb5d90046a1d46a8fe51685514043acd4c4917db4dac67729a468364b"},"schema_version":"1.0"},"canonical_sha256":"2a8b0e8919ca1e430648314ceb239c2d14bc3b82784ede59ed8ebe0d94f532d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.502275Z","signature_b64":"atcWl3awOjUAABVq68ekHVamsQRDjP5QYAOmenj7qt8cSlpiXBNT4VpWpRz1wGX2kNY+bLe06sboNb1QkilLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a8b0e8919ca1e430648314ceb239c2d14bc3b82784ede59ed8ebe0d94f532d0","last_reissued_at":"2026-05-18T04:00:00.501720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.501720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3469","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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5BsTyG8AVL5vGv9xeAwLdFIgcAL6FPATbzR7ryywB0qCj1/dewIZXBt9PTillwofvx4LGMUNFZnw2n4JPuiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:48:51.592841Z"},"content_sha256":"eb35cfb694792bbfce63c33bbaff59a45bc175d2b1ffee75cd803c3dbf53968c","schema_version":"1.0","event_id":"sha256:eb35cfb694792bbfce63c33bbaff59a45bc175d2b1ffee75cd803c3dbf53968c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FKFQ5CIZZIPEGBSIGFGOWI44FU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Similarity Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lilyana Mihalkova, Lise Getoor, Matthias Brocheler","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Many machine learning applications require the ability to learn from and reason about noisy multi-relational data. To address this, several effective representations have been developed that provide both a language for expressing the structural regularities of a domain, and principled support for probabilistic inference. In addition to these two aspects, however, many applications also involve a third aspect-the need to reason about similarities-which has not been directly supported in existing frameworks. This paper introduces probabilistic similarity logic (PSL), a general-purpose framework "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3469","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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAOTRGPxpQTuHnTPp2KCJTOkp+lCktzU3PkzwJVDoO1AqoElgh68++3Hq98vglmh2b1zZEkjJUngjhKhxoB/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:48:51.593547Z"},"content_sha256":"edad71beab43c039c79788f3709b9c8c10390d7c37e2246ea880dd82eb035563","schema_version":"1.0","event_id":"sha256:edad71beab43c039c79788f3709b9c8c10390d7c37e2246ea880dd82eb035563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/bundle.json","state_url":"https://pith.science/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/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-06-06T22:48:51Z","links":{"resolver":"https://pith.science/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU","bundle":"https://pith.science/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/bundle.json","state":"https://pith.science/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKFQ5CIZZIPEGBSIGFGOWI44FU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FKFQ5CIZZIPEGBSIGFGOWI44FU","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":"099e63beb5d90046a1d46a8fe51685514043acd4c4917db4dac67729a468364b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"4d59c0340c79606fa9788e7ff0cfd4fee36fb3b867eb93dbd54e57b794d01e3e"},"schema_version":"1.0","source":{"id":"1203.3469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3469","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3469v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3469","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"FKFQ5CIZZIPE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FKFQ5CIZZIPEGBSI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FKFQ5CIZ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:edad71beab43c039c79788f3709b9c8c10390d7c37e2246ea880dd82eb035563","target":"graph","created_at":"2026-05-18T04:00:00Z","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":"Many machine learning applications require the ability to learn from and reason about noisy multi-relational data. To address this, several effective representations have been developed that provide both a language for expressing the structural regularities of a domain, and principled support for probabilistic inference. In addition to these two aspects, however, many applications also involve a third aspect-the need to reason about similarities-which has not been directly supported in existing frameworks. This paper introduces probabilistic similarity logic (PSL), a general-purpose framework ","authors_text":"Lilyana Mihalkova, Lise Getoor, Matthias Brocheler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title":"Probabilistic Similarity Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3469","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:eb35cfb694792bbfce63c33bbaff59a45bc175d2b1ffee75cd803c3dbf53968c","target":"record","created_at":"2026-05-18T04:00:00Z","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":"099e63beb5d90046a1d46a8fe51685514043acd4c4917db4dac67729a468364b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"4d59c0340c79606fa9788e7ff0cfd4fee36fb3b867eb93dbd54e57b794d01e3e"},"schema_version":"1.0","source":{"id":"1203.3469","kind":"arxiv","version":1}},"canonical_sha256":"2a8b0e8919ca1e430648314ceb239c2d14bc3b82784ede59ed8ebe0d94f532d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a8b0e8919ca1e430648314ceb239c2d14bc3b82784ede59ed8ebe0d94f532d0","first_computed_at":"2026-05-18T04:00:00.501720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.501720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"atcWl3awOjUAABVq68ekHVamsQRDjP5QYAOmenj7qt8cSlpiXBNT4VpWpRz1wGX2kNY+bLe06sboNb1QkilLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.502275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb35cfb694792bbfce63c33bbaff59a45bc175d2b1ffee75cd803c3dbf53968c","sha256:edad71beab43c039c79788f3709b9c8c10390d7c37e2246ea880dd82eb035563"],"state_sha256":"5b0eecb74a2435df65bb071e98f32b9a8d95f46ccd5ac5504413792540f22ec1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyQe9FP5O6HPBzeNWhN8aLxM1Untdtv0J04JYDRRLh22X7hreuYdmU0FsJzPnxcJ4hbjy4cQuiIKz4d47r6/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:48:51.597403Z","bundle_sha256":"ba0b86a0129332daf208558d61ccbcde193037222a2fc5516c91655d7cc2c8be"}}