{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WXKR6KX3C5AFVMSZSC5TNLP5BM","short_pith_number":"pith:WXKR6KX3","canonical_record":{"source":{"id":"1805.11900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-30T11:14:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5758ffb0a1db454edb3858c4d8a5a79343e2e8f1cfba1c7b666402809fa5b7f4","abstract_canon_sha256":"c82f1986343d3576f73547067d219c5716dbd1cb729f2822091394c0eabe203e"},"schema_version":"1.0"},"canonical_sha256":"b5d51f2afb17405ab25990bb36adfd0b1beba585128c2fb85450fbd18fa28a5d","source":{"kind":"arxiv","id":"1805.11900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11900","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11900v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11900","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXKR6KX3C5AF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WXKR6KX3C5AFVMSZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WXKR6KX3","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WXKR6KX3C5AFVMSZSC5TNLP5BM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-30T11:14:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5758ffb0a1db454edb3858c4d8a5a79343e2e8f1cfba1c7b666402809fa5b7f4","abstract_canon_sha256":"c82f1986343d3576f73547067d219c5716dbd1cb729f2822091394c0eabe203e"},"schema_version":"1.0"},"canonical_sha256":"b5d51f2afb17405ab25990bb36adfd0b1beba585128c2fb85450fbd18fa28a5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:35.874897Z","signature_b64":"3zw3Ce5GOw5vXM/rh2hpE86klO4FA0D31aYC8tPTCQ0WxFNDdzsxkCbiLjMvsCCnAylTrb6NpQn8OnmrM17GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5d51f2afb17405ab25990bb36adfd0b1beba585128c2fb85450fbd18fa28a5d","last_reissued_at":"2026-05-18T00:14:35.874182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:35.874182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11900","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umPkz1EsNdaD00Wex88EW9P+k+NyJdPbqbT14MRBWVGsHd5Mj0Ds6JMCCjB3NwYaIB4yStHfpP9Sa0/xeIewDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:02:54.311255Z"},"content_sha256":"80ede27256bceffe7eddfa6b7db843001f79aade3424c92cf49d9d72f084c074","schema_version":"1.0","event_id":"sha256:80ede27256bceffe7eddfa6b7db843001f79aade3424c92cf49d9d72f084c074"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WXKR6KX3C5AFVMSZSC5TNLP5BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Q-Graph: Preserving Query Locality in Multi-Query Graph Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Christian Mayer, Jonas Grunert, Kurt Rothermel, Muhammad Adnan Tariq, Ruben Mayer","submitted_at":"2018-05-30T11:14:30Z","abstract_excerpt":"Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis, i.e., processing multiple graph queries in parallel on a shared graph. These applications generate a dynamic number of localized queries around query hotspots such as popular urban areas. However, existing graph processing systems are not yet tailored towards these properties: The employed methods for graph partitioning and synchronization management disregard query locality and dynamism whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11900","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3R2cAnwRFrjmDYQ/u1hzHkP+Sn5jV1eRy+ryZANyUvH8DPjyM2/SCpLAgBIIfXL21izWJKCmH8U7l+YGJYbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:02:54.311610Z"},"content_sha256":"eceeecc0bac00ce5fd269a7cc02ccbabb20b6a60ed489618505bb9bbdd02783e","schema_version":"1.0","event_id":"sha256:eceeecc0bac00ce5fd269a7cc02ccbabb20b6a60ed489618505bb9bbdd02783e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/bundle.json","state_url":"https://pith.science/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T19:02:54Z","links":{"resolver":"https://pith.science/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM","bundle":"https://pith.science/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/bundle.json","state":"https://pith.science/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXKR6KX3C5AFVMSZSC5TNLP5BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WXKR6KX3C5AFVMSZSC5TNLP5BM","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":"c82f1986343d3576f73547067d219c5716dbd1cb729f2822091394c0eabe203e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-30T11:14:30Z","title_canon_sha256":"5758ffb0a1db454edb3858c4d8a5a79343e2e8f1cfba1c7b666402809fa5b7f4"},"schema_version":"1.0","source":{"id":"1805.11900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11900","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11900v1","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11900","created_at":"2026-05-18T00:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXKR6KX3C5AF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WXKR6KX3C5AFVMSZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WXKR6KX3","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:eceeecc0bac00ce5fd269a7cc02ccbabb20b6a60ed489618505bb9bbdd02783e","target":"graph","created_at":"2026-05-18T00:14:35Z","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":"Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis, i.e., processing multiple graph queries in parallel on a shared graph. These applications generate a dynamic number of localized queries around query hotspots such as popular urban areas. However, existing graph processing systems are not yet tailored towards these properties: The employed methods for graph partitioning and synchronization management disregard query locality and dynamism whic","authors_text":"Christian Mayer, Jonas Grunert, Kurt Rothermel, Muhammad Adnan Tariq, Ruben Mayer","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-30T11:14:30Z","title":"Q-Graph: Preserving Query Locality in Multi-Query Graph Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11900","kind":"arxiv","version":1},"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:80ede27256bceffe7eddfa6b7db843001f79aade3424c92cf49d9d72f084c074","target":"record","created_at":"2026-05-18T00:14:35Z","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":"c82f1986343d3576f73547067d219c5716dbd1cb729f2822091394c0eabe203e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-05-30T11:14:30Z","title_canon_sha256":"5758ffb0a1db454edb3858c4d8a5a79343e2e8f1cfba1c7b666402809fa5b7f4"},"schema_version":"1.0","source":{"id":"1805.11900","kind":"arxiv","version":1}},"canonical_sha256":"b5d51f2afb17405ab25990bb36adfd0b1beba585128c2fb85450fbd18fa28a5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5d51f2afb17405ab25990bb36adfd0b1beba585128c2fb85450fbd18fa28a5d","first_computed_at":"2026-05-18T00:14:35.874182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:35.874182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3zw3Ce5GOw5vXM/rh2hpE86klO4FA0D31aYC8tPTCQ0WxFNDdzsxkCbiLjMvsCCnAylTrb6NpQn8OnmrM17GDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:35.874897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80ede27256bceffe7eddfa6b7db843001f79aade3424c92cf49d9d72f084c074","sha256:eceeecc0bac00ce5fd269a7cc02ccbabb20b6a60ed489618505bb9bbdd02783e"],"state_sha256":"1e37cd4b3f642b58c7009290a97328971cd9c4b1625bb72517a1eef2fef3a7f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRWYfG5KJM+rzI9q6VvcTWhJjcAeF8uj883JY49GRYJpFCBgZzhPHvRopGaKsay1/gvXvV2gI91LMTnnESXTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:02:54.313501Z","bundle_sha256":"c2930ae9f5d33da49a8e88632c40863f30efbb0770feb9380df6da85d009f15c"}}