{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VNVYNN4XOXVR3GHLA3GGODRVQV","short_pith_number":"pith:VNVYNN4X","canonical_record":{"source":{"id":"1906.05059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T11:07:10Z","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"c1b3794b4786ead901e5ba01f5f5591d3d28bce1fa6fb0a3d89d7f2e5e3c2f80","abstract_canon_sha256":"f1f247172a580f9360d9e2944c84df1652aa1293623dab1d1aaf4a7f387462a2"},"schema_version":"1.0"},"canonical_sha256":"ab6b86b79775eb1d98eb06cc670e3585600a43636ebcb40a95d85514498c6659","source":{"kind":"arxiv","id":"1906.05059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05059","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05059v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05059","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"VNVYNN4XOXVR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VNVYNN4XOXVR3GHL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VNVYNN4X","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VNVYNN4XOXVR3GHLA3GGODRVQV","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T11:07:10Z","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"c1b3794b4786ead901e5ba01f5f5591d3d28bce1fa6fb0a3d89d7f2e5e3c2f80","abstract_canon_sha256":"f1f247172a580f9360d9e2944c84df1652aa1293623dab1d1aaf4a7f387462a2"},"schema_version":"1.0"},"canonical_sha256":"ab6b86b79775eb1d98eb06cc670e3585600a43636ebcb40a95d85514498c6659","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.592177Z","signature_b64":"tcBzTQQ+b7+H5lSnILwb2Gd+WzeMShRrkyhOUBEqtYUXih4xlDnJzms+ZnxH4cfAgAkr6rkCvzM0lI4729AjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab6b86b79775eb1d98eb06cc670e3585600a43636ebcb40a95d85514498c6659","last_reissued_at":"2026-05-17T23:43:29.591538Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.591538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05059","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"js5BRJ8JgqLanfe7ucmXllq0fjIDrdE+sEMfxOMsiDKWJWl6cRFdsjHvhmolnDQA+LR1Mfk+rNjulk9lj1kaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:00.844259Z"},"content_sha256":"07fc3d01006bd3d6245657ce37169bc19e93b3dd6407b02f81db8314e118caf5","schema_version":"1.0","event_id":"sha256:07fc3d01006bd3d6245657ce37169bc19e93b3dd6407b02f81db8314e118caf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VNVYNN4XOXVR3GHLA3GGODRVQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Eunyee Koh, Gang Wu, Nesreen K. Ahmed, Ryan A. Rossi, Sungchul Kim","submitted_at":"2019-06-12T11:07:10Z","abstract_excerpt":"In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and link prediction-based applications such as web search, online advertising, and recommendation. In such applications, real-time performance is critical. The proposed methods do not require any explicit training data, nor do they derive an embedding from the graph data, or perform any explicit learning. Existing methods with the above desired properties are all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05059","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7xMJrsARLedZXkbeERuef6wxJu/q4z+CE9AJBY3QVV8q16oGLcvVUBkW+puJNKYrwvy3WjytIQ2LHs1a8EyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:00.844635Z"},"content_sha256":"1008b0bc5331795809b41a80ae83d886a440a71d3b9e09e7eb58c4548e130c3f","schema_version":"1.0","event_id":"sha256:1008b0bc5331795809b41a80ae83d886a440a71d3b9e09e7eb58c4548e130c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/bundle.json","state_url":"https://pith.science/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/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-01T14:44:00Z","links":{"resolver":"https://pith.science/pith/VNVYNN4XOXVR3GHLA3GGODRVQV","bundle":"https://pith.science/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/bundle.json","state":"https://pith.science/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNVYNN4XOXVR3GHLA3GGODRVQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VNVYNN4XOXVR3GHLA3GGODRVQV","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":"f1f247172a580f9360d9e2944c84df1652aa1293623dab1d1aaf4a7f387462a2","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T11:07:10Z","title_canon_sha256":"c1b3794b4786ead901e5ba01f5f5591d3d28bce1fa6fb0a3d89d7f2e5e3c2f80"},"schema_version":"1.0","source":{"id":"1906.05059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05059","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05059v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05059","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"VNVYNN4XOXVR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VNVYNN4XOXVR3GHL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VNVYNN4X","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:1008b0bc5331795809b41a80ae83d886a440a71d3b9e09e7eb58c4548e130c3f","target":"graph","created_at":"2026-05-17T23:43:29Z","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":"In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and link prediction-based applications such as web search, online advertising, and recommendation. In such applications, real-time performance is critical. The proposed methods do not require any explicit training data, nor do they derive an embedding from the graph data, or perform any explicit learning. Existing methods with the above desired properties are all","authors_text":"Anup Rao, Eunyee Koh, Gang Wu, Nesreen K. Ahmed, Ryan A. Rossi, Sungchul Kim","cross_cats":["cs.IR","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T11:07:10Z","title":"Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05059","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:07fc3d01006bd3d6245657ce37169bc19e93b3dd6407b02f81db8314e118caf5","target":"record","created_at":"2026-05-17T23:43:29Z","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":"f1f247172a580f9360d9e2944c84df1652aa1293623dab1d1aaf4a7f387462a2","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-12T11:07:10Z","title_canon_sha256":"c1b3794b4786ead901e5ba01f5f5591d3d28bce1fa6fb0a3d89d7f2e5e3c2f80"},"schema_version":"1.0","source":{"id":"1906.05059","kind":"arxiv","version":1}},"canonical_sha256":"ab6b86b79775eb1d98eb06cc670e3585600a43636ebcb40a95d85514498c6659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab6b86b79775eb1d98eb06cc670e3585600a43636ebcb40a95d85514498c6659","first_computed_at":"2026-05-17T23:43:29.591538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.591538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tcBzTQQ+b7+H5lSnILwb2Gd+WzeMShRrkyhOUBEqtYUXih4xlDnJzms+ZnxH4cfAgAkr6rkCvzM0lI4729AjAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.592177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07fc3d01006bd3d6245657ce37169bc19e93b3dd6407b02f81db8314e118caf5","sha256:1008b0bc5331795809b41a80ae83d886a440a71d3b9e09e7eb58c4548e130c3f"],"state_sha256":"a7579f13bac20b55309be88ca7ca569170de642445fa1e0dcdd56041d5c3edd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6DDNkx+zDaHV2Z6r38jclvl+S0A7SXnNmTaNL+xF5KDYeTUko/D1nZMW/16+SsBvM5uT7q50cQ3Wk/W8x3cAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:44:00.846935Z","bundle_sha256":"14840913a915f5af13d9986feac66a5c43e3c4aa2a1942a7f589173d8ddbb7b5"}}