{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JDPUBP3BNUOL35JDBJL4EM7CVX","short_pith_number":"pith:JDPUBP3B","canonical_record":{"source":{"id":"1604.00647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-03T15:42:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b8d3a74ccad942a135b7aa7f913ad9b08712abef8d766cbd15786a228a49102e","abstract_canon_sha256":"8994b9fb3bb98a77cab061a54cbccf0c9c8c58a1311652274e2147e0e4d65843"},"schema_version":"1.0"},"canonical_sha256":"48df40bf616d1cbdf5230a57c233e2adf0f96c7011a9b3d8523a9168d767ec6f","source":{"kind":"arxiv","id":"1604.00647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00647","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00647v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00647","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"JDPUBP3BNUOL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JDPUBP3BNUOL35JD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JDPUBP3B","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JDPUBP3BNUOL35JDBJL4EM7CVX","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-03T15:42:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b8d3a74ccad942a135b7aa7f913ad9b08712abef8d766cbd15786a228a49102e","abstract_canon_sha256":"8994b9fb3bb98a77cab061a54cbccf0c9c8c58a1311652274e2147e0e4d65843"},"schema_version":"1.0"},"canonical_sha256":"48df40bf616d1cbdf5230a57c233e2adf0f96c7011a9b3d8523a9168d767ec6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.792202Z","signature_b64":"T6ZnlZRvOxfqj3mKbXaJebt6yffUDHQ780oAmZT5wLtkBjcn3wt2E0bclmOZSIX6eiBU3OxPuM0D0kJLDEZ6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48df40bf616d1cbdf5230a57c233e2adf0f96c7011a9b3d8523a9168d767ec6f","last_reissued_at":"2026-05-18T01:17:48.791371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.791371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00647","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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0VcyeUdzvDAfZzAQIZZKCxAAIlU+irMWmoa7z4y/c/VSmTZIA9Jm6BJIfI5VcgRlQU/m/Gx0FUi/X+mIPbcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:34:26.430999Z"},"content_sha256":"fadca88342c5c9065bc0258aae4452f662c836a2cbf10cf92d05b1a560ee86b9","schema_version":"1.0","event_id":"sha256:fadca88342c5c9065bc0258aae4452f662c836a2cbf10cf92d05b1a560ee86b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JDPUBP3BNUOL35JDBJL4EM7CVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Relational Learning at Scale with ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Lucas Drumond","submitted_at":"2016-04-03T15:42:36Z","abstract_excerpt":"Learning from multiple-relational data which contains noise, ambiguities, or duplicate entities is essential to a wide range of applications such as statistical inference based on Web Linked Data, recommender systems, computational biology, and natural language processing. These tasks usually require working with very large and complex datasets - e.g., the Web graph - however, current approaches to multi-relational learning are not practical for such scenarios due to their high computational complexity and poor scalability on large data.\n  In this paper, we propose a novel and scalable approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00647","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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHnamYwhRo7eyXSmi2a38Y5Z6lveXY31Uk2jIX3rlXiZDu9gM5EULN+3mQnI5L86tV9DDQrvLTlZk8Xdgio3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:34:26.431356Z"},"content_sha256":"b5cf0615dc4f2264df9a09f314ecd99be45d9b67df43af5cbbb3f93320bd0a55","schema_version":"1.0","event_id":"sha256:b5cf0615dc4f2264df9a09f314ecd99be45d9b67df43af5cbbb3f93320bd0a55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/bundle.json","state_url":"https://pith.science/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/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-03T08:34:26Z","links":{"resolver":"https://pith.science/pith/JDPUBP3BNUOL35JDBJL4EM7CVX","bundle":"https://pith.science/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/bundle.json","state":"https://pith.science/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDPUBP3BNUOL35JDBJL4EM7CVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JDPUBP3BNUOL35JDBJL4EM7CVX","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":"8994b9fb3bb98a77cab061a54cbccf0c9c8c58a1311652274e2147e0e4d65843","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-03T15:42:36Z","title_canon_sha256":"b8d3a74ccad942a135b7aa7f913ad9b08712abef8d766cbd15786a228a49102e"},"schema_version":"1.0","source":{"id":"1604.00647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00647","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00647v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00647","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"JDPUBP3BNUOL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JDPUBP3BNUOL35JD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JDPUBP3B","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:b5cf0615dc4f2264df9a09f314ecd99be45d9b67df43af5cbbb3f93320bd0a55","target":"graph","created_at":"2026-05-18T01:17:48Z","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":"Learning from multiple-relational data which contains noise, ambiguities, or duplicate entities is essential to a wide range of applications such as statistical inference based on Web Linked Data, recommender systems, computational biology, and natural language processing. These tasks usually require working with very large and complex datasets - e.g., the Web graph - however, current approaches to multi-relational learning are not practical for such scenarios due to their high computational complexity and poor scalability on large data.\n  In this paper, we propose a novel and scalable approac","authors_text":"Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Lucas Drumond","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-03T15:42:36Z","title":"Multi-Relational Learning at Scale with ADMM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00647","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:fadca88342c5c9065bc0258aae4452f662c836a2cbf10cf92d05b1a560ee86b9","target":"record","created_at":"2026-05-18T01:17:48Z","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":"8994b9fb3bb98a77cab061a54cbccf0c9c8c58a1311652274e2147e0e4d65843","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-03T15:42:36Z","title_canon_sha256":"b8d3a74ccad942a135b7aa7f913ad9b08712abef8d766cbd15786a228a49102e"},"schema_version":"1.0","source":{"id":"1604.00647","kind":"arxiv","version":1}},"canonical_sha256":"48df40bf616d1cbdf5230a57c233e2adf0f96c7011a9b3d8523a9168d767ec6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48df40bf616d1cbdf5230a57c233e2adf0f96c7011a9b3d8523a9168d767ec6f","first_computed_at":"2026-05-18T01:17:48.791371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:48.791371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6ZnlZRvOxfqj3mKbXaJebt6yffUDHQ780oAmZT5wLtkBjcn3wt2E0bclmOZSIX6eiBU3OxPuM0D0kJLDEZ6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:48.792202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fadca88342c5c9065bc0258aae4452f662c836a2cbf10cf92d05b1a560ee86b9","sha256:b5cf0615dc4f2264df9a09f314ecd99be45d9b67df43af5cbbb3f93320bd0a55"],"state_sha256":"f01c00cbdea63697df730647d4b15bf694aefc9d3360003e0ef4a146a5ea4033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pO6rBTOGgxcPGy+WZhlYGKjBEQ80b07LqW8zdcEmwLX+XHN+T05XoxiXR5DDD0m39VUJoVtt2JkT25DkSfZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:34:26.433285Z","bundle_sha256":"210cc28cbb960e1381d2cbc15434020c39d895ce03b5dded6ea690adc3b496b4"}}