{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5HXRE42O5XPD26ZZ2CUZMBV7OD","short_pith_number":"pith:5HXRE42O","schema_version":"1.0","canonical_sha256":"e9ef12734eedde3d7b39d0a99606bf70d34a923225ee61a06d5ddc95a268a63c","source":{"kind":"arxiv","id":"2606.22180","version":1},"attestation_state":"computed","paper":{"title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Arijit Khan, Dan Feng, Fang Wang, Peng Fang, Yibo Zhou, Zhenli Li, Ziqiang Wu","submitted_at":"2026-06-20T18:21:15Z","abstract_excerpt":"Graph embedding maps graph nodes into low-dimensional vectors to support applications such as recommendation, fraud detection, and graph-based retrieval-augmented generation (GraphRAG). As graphs scale to billions of edges, scalable and efficient graph embedding has become increasingly important. Existing frameworks commonly adopt a sampling-training paradigm, in which mini-batches are constructed by sampling nodes and their neighbors. However, sampling is typically decoupled from evolving embedding quality, causing redundant exploration of well-trained regions while under-sampling undertraine"},"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":"2606.22180","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-20T18:21:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f8862d8ed49d581a550f216009e0a519c88062b8c0979649a08621248cfaf1e","abstract_canon_sha256":"0d6b18fbcf79ae610220333a7f6811be9d3ebd3d4b25ad64e894bcfd314f4d51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:31.280772Z","signature_b64":"JmtboV92y8USrkxLX9OJ/7YOHVqN6QvcKeK96qDEqSMG7F4xXqM/iP+Elc4YVIPPOFpJlboRSECwHgI4tiflCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9ef12734eedde3d7b39d0a99606bf70d34a923225ee61a06d5ddc95a268a63c","last_reissued_at":"2026-06-23T02:13:31.280366Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:31.280366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Arijit Khan, Dan Feng, Fang Wang, Peng Fang, Yibo Zhou, Zhenli Li, Ziqiang Wu","submitted_at":"2026-06-20T18:21:15Z","abstract_excerpt":"Graph embedding maps graph nodes into low-dimensional vectors to support applications such as recommendation, fraud detection, and graph-based retrieval-augmented generation (GraphRAG). As graphs scale to billions of edges, scalable and efficient graph embedding has become increasingly important. Existing frameworks commonly adopt a sampling-training paradigm, in which mini-batches are constructed by sampling nodes and their neighbors. However, sampling is typically decoupled from evolving embedding quality, causing redundant exploration of well-trained regions while under-sampling undertraine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22180","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22180/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":"2606.22180","created_at":"2026-06-23T02:13:31.280430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22180v1","created_at":"2026-06-23T02:13:31.280430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22180","created_at":"2026-06-23T02:13:31.280430+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HXRE42O5XPD","created_at":"2026-06-23T02:13:31.280430+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HXRE42O5XPD26ZZ","created_at":"2026-06-23T02:13:31.280430+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HXRE42O","created_at":"2026-06-23T02:13:31.280430+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/5HXRE42O5XPD26ZZ2CUZMBV7OD","json":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD.json","graph_json":"https://pith.science/api/pith-number/5HXRE42O5XPD26ZZ2CUZMBV7OD/graph.json","events_json":"https://pith.science/api/pith-number/5HXRE42O5XPD26ZZ2CUZMBV7OD/events.json","paper":"https://pith.science/paper/5HXRE42O"},"agent_actions":{"view_html":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD","download_json":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD.json","view_paper":"https://pith.science/paper/5HXRE42O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22180&json=true","fetch_graph":"https://pith.science/api/pith-number/5HXRE42O5XPD26ZZ2CUZMBV7OD/graph.json","fetch_events":"https://pith.science/api/pith-number/5HXRE42O5XPD26ZZ2CUZMBV7OD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD/action/storage_attestation","attest_author":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD/action/author_attestation","sign_citation":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD/action/citation_signature","submit_replication":"https://pith.science/pith/5HXRE42O5XPD26ZZ2CUZMBV7OD/action/replication_record"}},"created_at":"2026-06-23T02:13:31.280430+00:00","updated_at":"2026-06-23T02:13:31.280430+00:00"}