{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PAZKVMYBPX2BGBG6AGTA4CYFW7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8369c1ea0ca047dc0c57286d614ada374dbf163b608424dd1a8f34ccc90df6a1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-13T09:32:37Z","title_canon_sha256":"41b9521bc5462898da7a38c17d7c5d3693ffdd0eab7e4b20e87c95bf077483da"},"schema_version":"1.0","source":{"id":"1706.03968","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03968","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03968v2","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03968","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"PAZKVMYBPX2B","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAZKVMYBPX2BGBG6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAZKVMYB","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d726717f864334220034be214d905b145964855b83645154f748aac35b973b0b","target":"graph","created_at":"2026-05-18T00:42:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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-","authors_text":"Alexander Krause, Annett Ungeth\\\"um, Dirk Habich, Thomas Kissinger, Wolfgang Lehner","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-13T09:32:37Z","title":"Asynchronous Graph Pattern Matching on Multiprocessor Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03968","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:890333055ce0da085bbdff0f1a36f9586d8311aad3fcf71454ee69317e05b077","target":"record","created_at":"2026-05-18T00:42:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8369c1ea0ca047dc0c57286d614ada374dbf163b608424dd1a8f34ccc90df6a1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-13T09:32:37Z","title_canon_sha256":"41b9521bc5462898da7a38c17d7c5d3693ffdd0eab7e4b20e87c95bf077483da"},"schema_version":"1.0","source":{"id":"1706.03968","kind":"arxiv","version":2}},"canonical_sha256":"7832aab3017df41304de01a60e0b05b7c93b0e36e5785627831b5630bf112d32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7832aab3017df41304de01a60e0b05b7c93b0e36e5785627831b5630bf112d32","first_computed_at":"2026-05-18T00:42:23.233224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:23.233224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"piHfn6mtpdu9d+sEIpCfY+TSWlANpVBEMiWrWAWppQlG0rJznQ2BbmuO6UxGvwDfKcDOLZgf76R0CSEtV7CTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:23.233673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03968","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890333055ce0da085bbdff0f1a36f9586d8311aad3fcf71454ee69317e05b077","sha256:d726717f864334220034be214d905b145964855b83645154f748aac35b973b0b"],"state_sha256":"5f867b4f7c11721bac30c92c12ae63d79a0cfc817250cd390f2125dddac0671b"}