{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L32A2YPS5KEQPH247INZH6ORVK","short_pith_number":"pith:L32A2YPS","canonical_record":{"source":{"id":"1608.00876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T15:48:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9d02a05b4e57c691dbb2cd8db24d7792cbaa49e70fce84cc2475b98fea47274c","abstract_canon_sha256":"461d771c1ca3fed1d1f65bd60e6110cf9ef7d4733e2a511add4391ef568fe0ae"},"schema_version":"1.0"},"canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","source":{"kind":"arxiv","id":"1608.00876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00876","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00876v1","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00876","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"L32A2YPS5KEQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L32A2YPS5KEQPH24","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L32A2YPS","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L32A2YPS5KEQPH247INZH6ORVK","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T15:48:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9d02a05b4e57c691dbb2cd8db24d7792cbaa49e70fce84cc2475b98fea47274c","abstract_canon_sha256":"461d771c1ca3fed1d1f65bd60e6110cf9ef7d4733e2a511add4391ef568fe0ae"},"schema_version":"1.0"},"canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:00.668165Z","signature_b64":"J/9EAUKnXEIN3vP7s2gWk2W6F0moZSntMwTiiJnp0csSC4bZzvYf8sfHGxV1d+dXsStZjyc5vcRNOeI4OkC5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","last_reissued_at":"2026-05-18T01:10:00.667609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:00.667609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00876","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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgnCQNXnB/2O8D+FFEGF4IToRC95Xrn+4WEPV4DHoKVOc8NQE8bujc6xXoBr9kxpMk+s/vOW+2XFjZxvRyVKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:55.863949Z"},"content_sha256":"6161188b3458b119394dd3d1eaa39596a6ab271328c6c0e0a2031e158e66143f","schema_version":"1.0","event_id":"sha256:6161188b3458b119394dd3d1eaa39596a6ab271328c6c0e0a2031e158e66143f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L32A2YPS5KEQPH247INZH6ORVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Similarity Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi","submitted_at":"2016-08-02T15:48:58Z","abstract_excerpt":"This paper proposes Relational Similarity Machines (RSM): a fast, accurate, and flexible relational learning framework for supervised and semi-supervised learning tasks. Despite the importance of relational learning, most existing methods are hard to adapt to different settings, due to issues with efficiency, scalability, accuracy, and flexibility for handling a wide variety of classification problems, data, constraints, and tasks. For instance, many existing methods perform poorly for multi-class classification problems, graphs that are sparsely labeled or network data with low relational aut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00876","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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tog8b1zzo4PThQXTjSMzMiZcw2W/zOvQ2tNkNwaxNMAGNWXJSLvSKCImoWhxTTv+GUMlMhRQv4Lu+BGFqw2IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:55.864307Z"},"content_sha256":"db7745752527f071339f93ff9ca6fe183d9343e4578356d14836aa0ed65f0b1a","schema_version":"1.0","event_id":"sha256:db7745752527f071339f93ff9ca6fe183d9343e4578356d14836aa0ed65f0b1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/bundle.json","state_url":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L32A2YPS5KEQPH247INZH6ORVK/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-08T13:40:55Z","links":{"resolver":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK","bundle":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/bundle.json","state":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L32A2YPS5KEQPH247INZH6ORVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L32A2YPS5KEQPH247INZH6ORVK","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":"461d771c1ca3fed1d1f65bd60e6110cf9ef7d4733e2a511add4391ef568fe0ae","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T15:48:58Z","title_canon_sha256":"9d02a05b4e57c691dbb2cd8db24d7792cbaa49e70fce84cc2475b98fea47274c"},"schema_version":"1.0","source":{"id":"1608.00876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00876","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00876v1","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00876","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"L32A2YPS5KEQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L32A2YPS5KEQPH24","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L32A2YPS","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:db7745752527f071339f93ff9ca6fe183d9343e4578356d14836aa0ed65f0b1a","target":"graph","created_at":"2026-05-18T01:10: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":"This paper proposes Relational Similarity Machines (RSM): a fast, accurate, and flexible relational learning framework for supervised and semi-supervised learning tasks. Despite the importance of relational learning, most existing methods are hard to adapt to different settings, due to issues with efficiency, scalability, accuracy, and flexibility for handling a wide variety of classification problems, data, constraints, and tasks. For instance, many existing methods perform poorly for multi-class classification problems, graphs that are sparsely labeled or network data with low relational aut","authors_text":"Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T15:48:58Z","title":"Relational Similarity Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00876","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:6161188b3458b119394dd3d1eaa39596a6ab271328c6c0e0a2031e158e66143f","target":"record","created_at":"2026-05-18T01:10: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":"461d771c1ca3fed1d1f65bd60e6110cf9ef7d4733e2a511add4391ef568fe0ae","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-02T15:48:58Z","title_canon_sha256":"9d02a05b4e57c691dbb2cd8db24d7792cbaa49e70fce84cc2475b98fea47274c"},"schema_version":"1.0","source":{"id":"1608.00876","kind":"arxiv","version":1}},"canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","first_computed_at":"2026-05-18T01:10:00.667609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:00.667609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J/9EAUKnXEIN3vP7s2gWk2W6F0moZSntMwTiiJnp0csSC4bZzvYf8sfHGxV1d+dXsStZjyc5vcRNOeI4OkC5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:00.668165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6161188b3458b119394dd3d1eaa39596a6ab271328c6c0e0a2031e158e66143f","sha256:db7745752527f071339f93ff9ca6fe183d9343e4578356d14836aa0ed65f0b1a"],"state_sha256":"d29ab5e4e2362c8ec0de94be7fdb46a728d0ff0ec2c487e02395609e04dc10bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8npyQHVx36X1JD8pH9siMiO+2UYAxvsi3D6xP+bkivy3eSHqsaU+IhOFHSlLXtcClaUp6+QiQUSh+GgRJP4eAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:40:55.866198Z","bundle_sha256":"5b447bd933bc44320dfb3154f855a6c34f0ecc54c73e71b4321ac9040d067cbc"}}