{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:23XYPO3SLJMS4SRGCL4OOHG554","short_pith_number":"pith:23XYPO3S","schema_version":"1.0","canonical_sha256":"d6ef87bb725a592e4a2612f8e71cddef118013ca03c665a29a59780c055f3702","source":{"kind":"arxiv","id":"2009.11665","version":2},"attestation_state":"computed","paper":{"title":"SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrey Nikolaev, Anil Vullikanti, Ariful Azad, Cenk Sahinalp, Egor Smirnov, Jiayu Li, Judy Qiu, Langshi Chen, Madhav Marathe, Ruslan Israfilov","submitted_at":"2020-09-23T16:16:40Z","abstract_excerpt":"Subgraph counting aims to count occurrences of a template T in a given network G(V, E). It is a powerful graph analysis tool and has found real-world applications in diverse domains. Scaling subgraph counting problems is known to be memory bounded and computationally challenging with exponential complexity. Although scalable parallel algorithms are known for several graph problems such as Triangle Counting and PageRank, this is not common for counting complex subgraphs. Here we address this challenge and study connected acyclic graphs or trees. We propose a novel vectorized subgraph counting a"},"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":"2009.11665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-23T16:16:40Z","cross_cats_sorted":[],"title_canon_sha256":"9057c57b058a513770f6da32b25104bbcc974c0b432e8335dd7a6246e90ffab7","abstract_canon_sha256":"bcbe919a37f2ba2539f9c419949c9965b99b3b51e7bd7c3cacaf6394f7ba0bf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:01.675807Z","signature_b64":"kztx4WEQWnn5peSrRxNLQtMxdQioayay6vtjOr/sjQpXliuR/LB3R4TxvT1x9j/SV9dfISI2Mp3duooVttO6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ef87bb725a592e4a2612f8e71cddef118013ca03c665a29a59780c055f3702","last_reissued_at":"2026-07-05T01:40:01.675223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:01.675223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SubGraph2Vec: Highly-Vectorized Tree-likeSubgraph Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrey Nikolaev, Anil Vullikanti, Ariful Azad, Cenk Sahinalp, Egor Smirnov, Jiayu Li, Judy Qiu, Langshi Chen, Madhav Marathe, Ruslan Israfilov","submitted_at":"2020-09-23T16:16:40Z","abstract_excerpt":"Subgraph counting aims to count occurrences of a template T in a given network G(V, E). It is a powerful graph analysis tool and has found real-world applications in diverse domains. Scaling subgraph counting problems is known to be memory bounded and computationally challenging with exponential complexity. Although scalable parallel algorithms are known for several graph problems such as Triangle Counting and PageRank, this is not common for counting complex subgraphs. Here we address this challenge and study connected acyclic graphs or trees. We propose a novel vectorized subgraph counting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11665","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/2009.11665/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":"2009.11665","created_at":"2026-07-05T01:40:01.675281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.11665v2","created_at":"2026-07-05T01:40:01.675281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11665","created_at":"2026-07-05T01:40:01.675281+00:00"},{"alias_kind":"pith_short_12","alias_value":"23XYPO3SLJMS","created_at":"2026-07-05T01:40:01.675281+00:00"},{"alias_kind":"pith_short_16","alias_value":"23XYPO3SLJMS4SRG","created_at":"2026-07-05T01:40:01.675281+00:00"},{"alias_kind":"pith_short_8","alias_value":"23XYPO3S","created_at":"2026-07-05T01:40:01.675281+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/23XYPO3SLJMS4SRGCL4OOHG554","json":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554.json","graph_json":"https://pith.science/api/pith-number/23XYPO3SLJMS4SRGCL4OOHG554/graph.json","events_json":"https://pith.science/api/pith-number/23XYPO3SLJMS4SRGCL4OOHG554/events.json","paper":"https://pith.science/paper/23XYPO3S"},"agent_actions":{"view_html":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554","download_json":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554.json","view_paper":"https://pith.science/paper/23XYPO3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.11665&json=true","fetch_graph":"https://pith.science/api/pith-number/23XYPO3SLJMS4SRGCL4OOHG554/graph.json","fetch_events":"https://pith.science/api/pith-number/23XYPO3SLJMS4SRGCL4OOHG554/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554/action/storage_attestation","attest_author":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554/action/author_attestation","sign_citation":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554/action/citation_signature","submit_replication":"https://pith.science/pith/23XYPO3SLJMS4SRGCL4OOHG554/action/replication_record"}},"created_at":"2026-07-05T01:40:01.675281+00:00","updated_at":"2026-07-05T01:40:01.675281+00:00"}