{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GEUDMF2NJ2UCO2ZYEFTOWYHJ56","short_pith_number":"pith:GEUDMF2N","schema_version":"1.0","canonical_sha256":"312836174d4ea8276b382166eb60e9efaea006bb6aa3154225243f471cca13ce","source":{"kind":"arxiv","id":"1901.07747","version":1},"attestation_state":"computed","paper":{"title":"Fast and Robust Distributed Subgraph Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Junhu Wang, Wook-Shin Han, Xuguang Ren","submitted_at":"2019-01-23T06:49:02Z","abstract_excerpt":"We study the classic subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them impractical for very large graphs. Most of them follow a synchronous model where the performance is often bottlenecked by the machine with the worst performance. Motivated by this, in this paper, we propose RADS, a Robust Asynchronous Distributed Subgraph enumeration system. RADS first identifies results that can be found using single-machine algorithms. This strategy not only improves the overall performance but als"},"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.07747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-23T06:49:02Z","cross_cats_sorted":[],"title_canon_sha256":"a33124a9d6d343d16901d5f3b97d246b71c7cfd65f79dfa07c30c3f13d4e33f2","abstract_canon_sha256":"5c59b55bd8d742b0fd86223c8cc891e353217fa67055da748ced408a0dd9f559"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.611588Z","signature_b64":"jWKltUm91ZN8pBcd1cXApdjdji7Rlj4E50eM3OoQ4GSAuyi4xgsixZDAGXofe3gzuHq4guiN9JOcwoiv4I6BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312836174d4ea8276b382166eb60e9efaea006bb6aa3154225243f471cca13ce","last_reissued_at":"2026-05-17T23:55:41.611059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.611059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Robust Distributed Subgraph Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Junhu Wang, Wook-Shin Han, Xuguang Ren","submitted_at":"2019-01-23T06:49:02Z","abstract_excerpt":"We study the classic subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them impractical for very large graphs. Most of them follow a synchronous model where the performance is often bottlenecked by the machine with the worst performance. Motivated by this, in this paper, we propose RADS, a Robust Asynchronous Distributed Subgraph enumeration system. RADS first identifies results that can be found using single-machine algorithms. This strategy not only improves the overall performance but als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07747","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":"1901.07747","created_at":"2026-05-17T23:55:41.611132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07747v1","created_at":"2026-05-17T23:55:41.611132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07747","created_at":"2026-05-17T23:55:41.611132+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEUDMF2NJ2UC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEUDMF2NJ2UCO2ZY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEUDMF2N","created_at":"2026-05-18T12:33:18.533446+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/GEUDMF2NJ2UCO2ZYEFTOWYHJ56","json":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56.json","graph_json":"https://pith.science/api/pith-number/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/graph.json","events_json":"https://pith.science/api/pith-number/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/events.json","paper":"https://pith.science/paper/GEUDMF2N"},"agent_actions":{"view_html":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56","download_json":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56.json","view_paper":"https://pith.science/paper/GEUDMF2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07747&json=true","fetch_graph":"https://pith.science/api/pith-number/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/graph.json","fetch_events":"https://pith.science/api/pith-number/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/action/storage_attestation","attest_author":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/action/author_attestation","sign_citation":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/action/citation_signature","submit_replication":"https://pith.science/pith/GEUDMF2NJ2UCO2ZYEFTOWYHJ56/action/replication_record"}},"created_at":"2026-05-17T23:55:41.611132+00:00","updated_at":"2026-05-17T23:55:41.611132+00:00"}