{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L32A2YPS5KEQPH247INZH6ORVK","short_pith_number":"pith:L32A2YPS","schema_version":"1.0","canonical_sha256":"5ef40d61f2ea89079f5cfa1b93f9d1aaa3c93167134a8068186c338fcc801a26","source":{"kind":"arxiv","id":"1608.00876","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.00876","created_at":"2026-05-18T01:10:00.667703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00876v1","created_at":"2026-05-18T01:10:00.667703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00876","created_at":"2026-05-18T01:10:00.667703+00:00"},{"alias_kind":"pith_short_12","alias_value":"L32A2YPS5KEQ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L32A2YPS5KEQPH24","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L32A2YPS","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK","json":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK.json","graph_json":"https://pith.science/api/pith-number/L32A2YPS5KEQPH247INZH6ORVK/graph.json","events_json":"https://pith.science/api/pith-number/L32A2YPS5KEQPH247INZH6ORVK/events.json","paper":"https://pith.science/paper/L32A2YPS"},"agent_actions":{"view_html":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK","download_json":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK.json","view_paper":"https://pith.science/paper/L32A2YPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00876&json=true","fetch_graph":"https://pith.science/api/pith-number/L32A2YPS5KEQPH247INZH6ORVK/graph.json","fetch_events":"https://pith.science/api/pith-number/L32A2YPS5KEQPH247INZH6ORVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/action/storage_attestation","attest_author":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/action/author_attestation","sign_citation":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/action/citation_signature","submit_replication":"https://pith.science/pith/L32A2YPS5KEQPH247INZH6ORVK/action/replication_record"}},"created_at":"2026-05-18T01:10:00.667703+00:00","updated_at":"2026-05-18T01:10:00.667703+00:00"}