{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5JPOG3BLDS72ADSNFQ7SOONBWK","short_pith_number":"pith:5JPOG3BL","schema_version":"1.0","canonical_sha256":"ea5ee36c2b1cbfa00e4d2c3f2739a1b28ac64b2132a947fb9777f2b12410c664","source":{"kind":"arxiv","id":"1901.04097","version":2},"attestation_state":"computed","paper":{"title":"Search Efficient Binary Network Embedding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Chengqi Zhang, Daokun Zhang, Jie Yin, Xingquan Zhu","submitted_at":"2019-01-14T00:54:01Z","abstract_excerpt":"Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned continuous vector representations are inefficient for large-scale similarity search, which often involves finding nearest neighbors measured by distance or similarity in a continuous vector space. In this paper, we propose a search efficient binary network embedding al"},"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":"1901.04097","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2019-01-14T00:54:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"67cd89a6757ce3044cdf273f43097881cbcfc3e576c0b33633c5e25b1a98cbb4","abstract_canon_sha256":"93bd4c51c019b8cf85bb458389298a7aed5693f3f124105811dd50ffa4b47bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:58.126157Z","signature_b64":"b4Ixh6zUlyK0VK11mwdrfEML2iAA9OopdMBmJ6v88uW7LaE+O3Mjn+/LlfW2XX+rxsGC3IbhE3VRUDg5sIQOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea5ee36c2b1cbfa00e4d2c3f2739a1b28ac64b2132a947fb9777f2b12410c664","last_reissued_at":"2026-07-05T05:28:58.125716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:58.125716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search Efficient Binary Network Embedding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Chengqi Zhang, Daokun Zhang, Jie Yin, Xingquan Zhu","submitted_at":"2019-01-14T00:54:01Z","abstract_excerpt":"Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned continuous vector representations are inefficient for large-scale similarity search, which often involves finding nearest neighbors measured by distance or similarity in a continuous vector space. In this paper, we propose a search efficient binary network embedding al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04097","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.04097/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.04097","created_at":"2026-07-05T05:28:58.125772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04097v2","created_at":"2026-07-05T05:28:58.125772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04097","created_at":"2026-07-05T05:28:58.125772+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JPOG3BLDS72","created_at":"2026-07-05T05:28:58.125772+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JPOG3BLDS72ADSN","created_at":"2026-07-05T05:28:58.125772+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JPOG3BL","created_at":"2026-07-05T05:28:58.125772+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/5JPOG3BLDS72ADSNFQ7SOONBWK","json":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK.json","graph_json":"https://pith.science/api/pith-number/5JPOG3BLDS72ADSNFQ7SOONBWK/graph.json","events_json":"https://pith.science/api/pith-number/5JPOG3BLDS72ADSNFQ7SOONBWK/events.json","paper":"https://pith.science/paper/5JPOG3BL"},"agent_actions":{"view_html":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK","download_json":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK.json","view_paper":"https://pith.science/paper/5JPOG3BL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04097&json=true","fetch_graph":"https://pith.science/api/pith-number/5JPOG3BLDS72ADSNFQ7SOONBWK/graph.json","fetch_events":"https://pith.science/api/pith-number/5JPOG3BLDS72ADSNFQ7SOONBWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK/action/storage_attestation","attest_author":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK/action/author_attestation","sign_citation":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK/action/citation_signature","submit_replication":"https://pith.science/pith/5JPOG3BLDS72ADSNFQ7SOONBWK/action/replication_record"}},"created_at":"2026-07-05T05:28:58.125772+00:00","updated_at":"2026-07-05T05:28:58.125772+00:00"}