{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2JUQ7UGTUYGZG653BFNMBMNCXE","short_pith_number":"pith:2JUQ7UGT","schema_version":"1.0","canonical_sha256":"d2690fd0d3a60d937bbb095ac0b1a2b924a2f3e166f601f7cd5f1b0058467f04","source":{"kind":"arxiv","id":"1808.06560","version":1},"attestation_state":"computed","paper":{"title":"Multi-View Graph Embedding Using Randomized Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Anuththari Gamage, Brian Rappaport, Shuchin Aeron, Xiaozhe Hu","submitted_at":"2018-08-20T16:40:35Z","abstract_excerpt":"Real-world data sets often provide multiple types of information about the same set of entities. This data is well represented by multi-view graphs, which consist of several distinct sets of edges over the same nodes. These can be used to analyze how entities interact from different viewpoints. Combining multiple views improves the quality of inferences drawn from the underlying data, which has increased interest in developing efficient multi-view graph embedding methods. We propose an algorithm, C-RSP, that generates a common (C) embedding of a multi-view graph using Randomized Shortest Paths"},"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":"1808.06560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-20T16:40:35Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"491a4aa3605b352dc43f44c416b7a4f4651c06c8bc9d88c321ddff913535920f","abstract_canon_sha256":"f90abc0b2d92807f5229625183516b424a2551798a683f0ec234f5590195fef6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:44.454325Z","signature_b64":"FhCtRvvOe0k7BGvQZj6P9lRa/MZLR834hibmYLe8RHXxqRq6Rt8OTIuj9CeAu+m7sYxr0h/aIgDwNMwoEfyCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2690fd0d3a60d937bbb095ac0b1a2b924a2f3e166f601f7cd5f1b0058467f04","last_reissued_at":"2026-05-18T00:07:44.453817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:44.453817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-View Graph Embedding Using Randomized Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Anuththari Gamage, Brian Rappaport, Shuchin Aeron, Xiaozhe Hu","submitted_at":"2018-08-20T16:40:35Z","abstract_excerpt":"Real-world data sets often provide multiple types of information about the same set of entities. This data is well represented by multi-view graphs, which consist of several distinct sets of edges over the same nodes. These can be used to analyze how entities interact from different viewpoints. Combining multiple views improves the quality of inferences drawn from the underlying data, which has increased interest in developing efficient multi-view graph embedding methods. We propose an algorithm, C-RSP, that generates a common (C) embedding of a multi-view graph using Randomized Shortest Paths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06560","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":"1808.06560","created_at":"2026-05-18T00:07:44.453908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06560v1","created_at":"2026-05-18T00:07:44.453908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06560","created_at":"2026-05-18T00:07:44.453908+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JUQ7UGTUYGZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JUQ7UGTUYGZG653","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JUQ7UGT","created_at":"2026-05-18T12:32:02.567920+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/2JUQ7UGTUYGZG653BFNMBMNCXE","json":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE.json","graph_json":"https://pith.science/api/pith-number/2JUQ7UGTUYGZG653BFNMBMNCXE/graph.json","events_json":"https://pith.science/api/pith-number/2JUQ7UGTUYGZG653BFNMBMNCXE/events.json","paper":"https://pith.science/paper/2JUQ7UGT"},"agent_actions":{"view_html":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE","download_json":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE.json","view_paper":"https://pith.science/paper/2JUQ7UGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06560&json=true","fetch_graph":"https://pith.science/api/pith-number/2JUQ7UGTUYGZG653BFNMBMNCXE/graph.json","fetch_events":"https://pith.science/api/pith-number/2JUQ7UGTUYGZG653BFNMBMNCXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE/action/storage_attestation","attest_author":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE/action/author_attestation","sign_citation":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE/action/citation_signature","submit_replication":"https://pith.science/pith/2JUQ7UGTUYGZG653BFNMBMNCXE/action/replication_record"}},"created_at":"2026-05-18T00:07:44.453908+00:00","updated_at":"2026-05-18T00:07:44.453908+00:00"}