{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PAZKVMYBPX2BGBG6AGTA4CYFW7","short_pith_number":"pith:PAZKVMYB","schema_version":"1.0","canonical_sha256":"7832aab3017df41304de01a60e0b05b7c93b0e36e5785627831b5630bf112d32","source":{"kind":"arxiv","id":"1706.03968","version":2},"attestation_state":"computed","paper":{"title":"Asynchronous Graph Pattern Matching on Multiprocessor Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Alexander Krause, Annett Ungeth\\\"um, Dirk Habich, Thomas Kissinger, Wolfgang Lehner","submitted_at":"2017-06-13T09:32:37Z","abstract_excerpt":"Pattern matching on large graphs is the foundation for a variety of application domains. Strict latency requirements and continuously increasing graph sizes demand the usage of highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, graph partitioning becomes increasingly important. Hence, we present a technique to process graph pattern matching on NUMA systems in this paper. As a scalable pattern matching processing infrastructure, we leverage a data-"},"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":"1706.03968","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-13T09:32:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"41b9521bc5462898da7a38c17d7c5d3693ffdd0eab7e4b20e87c95bf077483da","abstract_canon_sha256":"8369c1ea0ca047dc0c57286d614ada374dbf163b608424dd1a8f34ccc90df6a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.233673Z","signature_b64":"piHfn6mtpdu9d+sEIpCfY+TSWlANpVBEMiWrWAWppQlG0rJznQ2BbmuO6UxGvwDfKcDOLZgf76R0CSEtV7CTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7832aab3017df41304de01a60e0b05b7c93b0e36e5785627831b5630bf112d32","last_reissued_at":"2026-05-18T00:42:23.233224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.233224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Graph Pattern Matching on Multiprocessor Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Alexander Krause, Annett Ungeth\\\"um, Dirk Habich, Thomas Kissinger, Wolfgang Lehner","submitted_at":"2017-06-13T09:32:37Z","abstract_excerpt":"Pattern matching on large graphs is the foundation for a variety of application domains. Strict latency requirements and continuously increasing graph sizes demand the usage of highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, graph partitioning becomes increasingly important. Hence, we present a technique to process graph pattern matching on NUMA systems in this paper. As a scalable pattern matching processing infrastructure, we leverage a data-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03968","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":""},"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":"1706.03968","created_at":"2026-05-18T00:42:23.233289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03968v2","created_at":"2026-05-18T00:42:23.233289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03968","created_at":"2026-05-18T00:42:23.233289+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAZKVMYBPX2B","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAZKVMYBPX2BGBG6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAZKVMYB","created_at":"2026-05-18T12:31:37.085036+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/PAZKVMYBPX2BGBG6AGTA4CYFW7","json":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7.json","graph_json":"https://pith.science/api/pith-number/PAZKVMYBPX2BGBG6AGTA4CYFW7/graph.json","events_json":"https://pith.science/api/pith-number/PAZKVMYBPX2BGBG6AGTA4CYFW7/events.json","paper":"https://pith.science/paper/PAZKVMYB"},"agent_actions":{"view_html":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7","download_json":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7.json","view_paper":"https://pith.science/paper/PAZKVMYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03968&json=true","fetch_graph":"https://pith.science/api/pith-number/PAZKVMYBPX2BGBG6AGTA4CYFW7/graph.json","fetch_events":"https://pith.science/api/pith-number/PAZKVMYBPX2BGBG6AGTA4CYFW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7/action/storage_attestation","attest_author":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7/action/author_attestation","sign_citation":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7/action/citation_signature","submit_replication":"https://pith.science/pith/PAZKVMYBPX2BGBG6AGTA4CYFW7/action/replication_record"}},"created_at":"2026-05-18T00:42:23.233289+00:00","updated_at":"2026-05-18T00:42:23.233289+00:00"}