{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W6VIMU2YGONC5CKITZ4TD6TSQW","short_pith_number":"pith:W6VIMU2Y","schema_version":"1.0","canonical_sha256":"b7aa865358339a2e89489e7931fa728591a474b1660c00568d051af0976624b4","source":{"kind":"arxiv","id":"1811.00198","version":1},"attestation_state":"computed","paper":{"title":"MOHONE: Modeling Higher Order Network Effects in KnowledgeGraphs via Network Infused Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Hao Yu, Vivek Kulkarni, William Wang","submitted_at":"2018-11-01T03:04:09Z","abstract_excerpt":"Many knowledge graph embedding methods operate on triples and are therefore implicitly limited by a very local view of the entire knowledge graph. We present a new framework MOHONE to effectively model higher order network effects in knowledge-graphs, thus enabling one to capture varying degrees of network connectivity (from the local to the global). Our framework is generic, explicitly models the network scale, and captures two different aspects of similarity in networks: (a) shared local neighborhood and (b) structural role-based similarity. First, we introduce methods that learn network rep"},"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":"1811.00198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-01T03:04:09Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"a594e820a8c295cad79e079a445c26c773b1812dbd044524b925330f187449bb","abstract_canon_sha256":"cc87b045b706db941cfda0203bda339c5f60646252b74290017890e15153c736"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:47.920256Z","signature_b64":"RtfKOFujK4PNrz9xj5MpLjjlUH04WZE4dZRh8ruY+dz4ft+Inf2DUUZ2OP6M3nOXQSnDvQucohx8foI075y8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7aa865358339a2e89489e7931fa728591a474b1660c00568d051af0976624b4","last_reissued_at":"2026-05-18T00:01:47.919548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:47.919548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MOHONE: Modeling Higher Order Network Effects in KnowledgeGraphs via Network Infused Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Hao Yu, Vivek Kulkarni, William Wang","submitted_at":"2018-11-01T03:04:09Z","abstract_excerpt":"Many knowledge graph embedding methods operate on triples and are therefore implicitly limited by a very local view of the entire knowledge graph. We present a new framework MOHONE to effectively model higher order network effects in knowledge-graphs, thus enabling one to capture varying degrees of network connectivity (from the local to the global). Our framework is generic, explicitly models the network scale, and captures two different aspects of similarity in networks: (a) shared local neighborhood and (b) structural role-based similarity. First, we introduce methods that learn network rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00198","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":"1811.00198","created_at":"2026-05-18T00:01:47.919645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00198v1","created_at":"2026-05-18T00:01:47.919645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00198","created_at":"2026-05-18T00:01:47.919645+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6VIMU2YGONC","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6VIMU2YGONC5CKI","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6VIMU2Y","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05387","citing_title":"HONEM: Learning Embedding for Higher Order Networks","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW","json":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW.json","graph_json":"https://pith.science/api/pith-number/W6VIMU2YGONC5CKITZ4TD6TSQW/graph.json","events_json":"https://pith.science/api/pith-number/W6VIMU2YGONC5CKITZ4TD6TSQW/events.json","paper":"https://pith.science/paper/W6VIMU2Y"},"agent_actions":{"view_html":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW","download_json":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW.json","view_paper":"https://pith.science/paper/W6VIMU2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00198&json=true","fetch_graph":"https://pith.science/api/pith-number/W6VIMU2YGONC5CKITZ4TD6TSQW/graph.json","fetch_events":"https://pith.science/api/pith-number/W6VIMU2YGONC5CKITZ4TD6TSQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW/action/storage_attestation","attest_author":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW/action/author_attestation","sign_citation":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW/action/citation_signature","submit_replication":"https://pith.science/pith/W6VIMU2YGONC5CKITZ4TD6TSQW/action/replication_record"}},"created_at":"2026-05-18T00:01:47.919645+00:00","updated_at":"2026-05-18T00:01:47.919645+00:00"}