{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LSCDCE27BKZFMZRNSNIYJKDWOY","short_pith_number":"pith:LSCDCE27","schema_version":"1.0","canonical_sha256":"5c8431135f0ab256662d935184a87676246e55d3b8d20b0c64e00411a36369b4","source":{"kind":"arxiv","id":"1905.10953","version":2},"attestation_state":"computed","paper":{"title":"FOBE and HOBE: First- and High-Order Bipartite Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilya Safro, Justin Sybrandt","submitted_at":"2019-05-27T03:12:52Z","abstract_excerpt":"Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery. Machine learning methods utilized in these applications would be better served with specialized embedding techniques. We propose two embeddings for bipartite graphs that decompose edges into sets of indirect relationships between node neighborhoods. When sampling higher-order relationships, we reinforce similarities through algebraic distance on graphs. We also introduce ensemble embeddings to combine both into a \"best of both "},"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":"1905.10953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T03:12:52Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"319ed92b8467375ed3cc15c75045036e05c1a97303161d0a3a8e117f44ebde00","abstract_canon_sha256":"bd8c29597bf2961cd3f174a60a691c6952271ea51af4147d8ccecaf0cbf98c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:34.117965Z","signature_b64":"Cmbj7tNmqxS4RELDUqRWCOwxPgx0DjlQ4Zwsdmy4FGnzHO3/fOjsChejrkAx2+kl0TEEJUg8cmZqCl42oslGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8431135f0ab256662d935184a87676246e55d3b8d20b0c64e00411a36369b4","last_reissued_at":"2026-07-05T01:21:34.117500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:34.117500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FOBE and HOBE: First- and High-Order Bipartite Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilya Safro, Justin Sybrandt","submitted_at":"2019-05-27T03:12:52Z","abstract_excerpt":"Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery. Machine learning methods utilized in these applications would be better served with specialized embedding techniques. We propose two embeddings for bipartite graphs that decompose edges into sets of indirect relationships between node neighborhoods. When sampling higher-order relationships, we reinforce similarities through algebraic distance on graphs. We also introduce ensemble embeddings to combine both into a \"best of both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10953","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/1905.10953/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":"1905.10953","created_at":"2026-07-05T01:21:34.117558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10953v2","created_at":"2026-07-05T01:21:34.117558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10953","created_at":"2026-07-05T01:21:34.117558+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSCDCE27BKZF","created_at":"2026-07-05T01:21:34.117558+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSCDCE27BKZFMZRN","created_at":"2026-07-05T01:21:34.117558+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSCDCE27","created_at":"2026-07-05T01:21:34.117558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10623","citing_title":"Quantum Hypergraph Partitioning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25275","citing_title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15704","citing_title":"Intent Propagation Contrastive Collaborative Filtering","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY","json":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY.json","graph_json":"https://pith.science/api/pith-number/LSCDCE27BKZFMZRNSNIYJKDWOY/graph.json","events_json":"https://pith.science/api/pith-number/LSCDCE27BKZFMZRNSNIYJKDWOY/events.json","paper":"https://pith.science/paper/LSCDCE27"},"agent_actions":{"view_html":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY","download_json":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY.json","view_paper":"https://pith.science/paper/LSCDCE27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10953&json=true","fetch_graph":"https://pith.science/api/pith-number/LSCDCE27BKZFMZRNSNIYJKDWOY/graph.json","fetch_events":"https://pith.science/api/pith-number/LSCDCE27BKZFMZRNSNIYJKDWOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY/action/storage_attestation","attest_author":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY/action/author_attestation","sign_citation":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY/action/citation_signature","submit_replication":"https://pith.science/pith/LSCDCE27BKZFMZRNSNIYJKDWOY/action/replication_record"}},"created_at":"2026-07-05T01:21:34.117558+00:00","updated_at":"2026-07-05T01:21:34.117558+00:00"}