{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FCOSBARPWQIJYJRW3UQ7MVSBKO","short_pith_number":"pith:FCOSBARP","schema_version":"1.0","canonical_sha256":"289d20822fb4109c2636dd21f65641539095da52515996a431cef4b1be7c3864","source":{"kind":"arxiv","id":"1807.08888","version":1},"attestation_state":"computed","paper":{"title":"An Efficient System for Subgraph Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aparna Joshi, Jeong-Hyon Hwang, Petko Bogdanov, Yu Zhang","submitted_at":"2018-07-24T02:58:44Z","abstract_excerpt":"Subgraph discovery in a single data graph---finding subsets of vertices and edges satisfying a user-specified criteria---is an essential and general graph analytics operation with a wide spectrum of applications. Depending on the criteria, subgraphs of interest may correspond to cliques of friends in social networks, interconnected entities in RDF data, or frequent patterns in protein interaction networks to name a few. Existing systems usually examine a large number of subgraphs while employing many computers and often produce an enormous result set of subgraphs. How can we enable fast discov"},"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":"1807.08888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-24T02:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"fa3b786b56ee43ea3dfbb888e067af28608678f0eeeeb02b387cca5370d8526d","abstract_canon_sha256":"0e8912f957cc84eb041f07372b480eda1e089466314880f29708832fc69bd4ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:57.545539Z","signature_b64":"H82keZBGBbcSzFGujFGQ469g8+1/LBUQnN/ogiAT0B7DpRvUV8GaFPJ1gDXxJtpPJluWFTkgiUwq4Rn2EKPVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"289d20822fb4109c2636dd21f65641539095da52515996a431cef4b1be7c3864","last_reissued_at":"2026-05-18T00:09:57.545000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:57.545000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient System for Subgraph Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aparna Joshi, Jeong-Hyon Hwang, Petko Bogdanov, Yu Zhang","submitted_at":"2018-07-24T02:58:44Z","abstract_excerpt":"Subgraph discovery in a single data graph---finding subsets of vertices and edges satisfying a user-specified criteria---is an essential and general graph analytics operation with a wide spectrum of applications. Depending on the criteria, subgraphs of interest may correspond to cliques of friends in social networks, interconnected entities in RDF data, or frequent patterns in protein interaction networks to name a few. Existing systems usually examine a large number of subgraphs while employing many computers and often produce an enormous result set of subgraphs. How can we enable fast discov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08888","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":"1807.08888","created_at":"2026-05-18T00:09:57.545083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08888v1","created_at":"2026-05-18T00:09:57.545083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08888","created_at":"2026-05-18T00:09:57.545083+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCOSBARPWQIJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCOSBARPWQIJYJRW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCOSBARP","created_at":"2026-05-18T12:32:22.470017+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/FCOSBARPWQIJYJRW3UQ7MVSBKO","json":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO.json","graph_json":"https://pith.science/api/pith-number/FCOSBARPWQIJYJRW3UQ7MVSBKO/graph.json","events_json":"https://pith.science/api/pith-number/FCOSBARPWQIJYJRW3UQ7MVSBKO/events.json","paper":"https://pith.science/paper/FCOSBARP"},"agent_actions":{"view_html":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO","download_json":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO.json","view_paper":"https://pith.science/paper/FCOSBARP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08888&json=true","fetch_graph":"https://pith.science/api/pith-number/FCOSBARPWQIJYJRW3UQ7MVSBKO/graph.json","fetch_events":"https://pith.science/api/pith-number/FCOSBARPWQIJYJRW3UQ7MVSBKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO/action/storage_attestation","attest_author":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO/action/author_attestation","sign_citation":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO/action/citation_signature","submit_replication":"https://pith.science/pith/FCOSBARPWQIJYJRW3UQ7MVSBKO/action/replication_record"}},"created_at":"2026-05-18T00:09:57.545083+00:00","updated_at":"2026-05-18T00:09:57.545083+00:00"}