{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R33H55EWAHYLBER3UW5ZT4XKM2","short_pith_number":"pith:R33H55EW","canonical_record":{"source":{"id":"1711.06608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-17T16:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"429feffa3546b6ec28b48b64099d7d82375234173f94d4c97fdc9d42832cf60d","abstract_canon_sha256":"6a296485c52ac840046caefc849af4f5ed9d8a11dfac989af874511c99858619"},"schema_version":"1.0"},"canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","source":{"kind":"arxiv","id":"1711.06608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06608","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06608v1","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06608","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"R33H55EWAHYL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R33H55EWAHYLBER3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R33H55EW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R33H55EWAHYLBER3UW5ZT4XKM2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-17T16:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"429feffa3546b6ec28b48b64099d7d82375234173f94d4c97fdc9d42832cf60d","abstract_canon_sha256":"6a296485c52ac840046caefc849af4f5ed9d8a11dfac989af874511c99858619"},"schema_version":"1.0"},"canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:18.421681Z","signature_b64":"UbrFSSFCqeZKKU6H3TxVZVjGgxRCzswZrZZ/ZXxw2Ar3VWZO872JicwW9eldsQja8DK565ijXvh9NLrJG4KwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","last_reissued_at":"2026-05-18T00:30:18.420983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:18.420983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06608","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:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBDm2HX+Koem2Pc7Y6vm2k9jqMcI2Xs2JY5A90GMWETgsOQUSWruV5+8dzSWtSawF+hMohHtfke/BTDtoHj5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:53:36.648645Z"},"content_sha256":"1df5c3dd909060b941e75c3ae48452555c5dbc7c8b172e26784afbf114355418","schema_version":"1.0","event_id":"sha256:1df5c3dd909060b941e75c3ae48452555c5dbc7c8b172e26784afbf114355418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R33H55EWAHYLBER3UW5ZT4XKM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loom: Query-aware Partitioning of Online Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hugo Firth, Jack Aiston, Paolo Missier","submitted_at":"2017-11-17T16:06:04Z","abstract_excerpt":"As with general graph processing systems, partitioning data over a cluster of machines improves the scalability of graph database management systems. However, these systems will incur additional network cost during the execution of a query workload, due to inter-partition traversals. Workload-agnostic partitioning algorithms typically minimise the likelihood of any edge crossing partition boundaries. However, these partitioners are sub-optimal with respect to many workloads, especially queries, which may require more frequent traversal of specific subsets of inter-partition edges. Furthermore,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06608","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:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB9vtPc7Nmu/3SJVsQRtOx4IiXyjSaVuNOuMgXDJMlrd0Tp45hES8ahykixoikabh3h9yCz93JaZ+PFX63uRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:53:36.648983Z"},"content_sha256":"d8a0a3965eb3052884c2bf684a623378b0a744268823007c4256c0798260c9d6","schema_version":"1.0","event_id":"sha256:d8a0a3965eb3052884c2bf684a623378b0a744268823007c4256c0798260c9d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/bundle.json","state_url":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R33H55EWAHYLBER3UW5ZT4XKM2/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-24T06:53:36Z","links":{"resolver":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2","bundle":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/bundle.json","state":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R33H55EWAHYLBER3UW5ZT4XKM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R33H55EWAHYLBER3UW5ZT4XKM2","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":"6a296485c52ac840046caefc849af4f5ed9d8a11dfac989af874511c99858619","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-17T16:06:04Z","title_canon_sha256":"429feffa3546b6ec28b48b64099d7d82375234173f94d4c97fdc9d42832cf60d"},"schema_version":"1.0","source":{"id":"1711.06608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06608","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06608v1","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06608","created_at":"2026-05-18T00:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"R33H55EWAHYL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R33H55EWAHYLBER3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R33H55EW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d8a0a3965eb3052884c2bf684a623378b0a744268823007c4256c0798260c9d6","target":"graph","created_at":"2026-05-18T00:30:18Z","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":"As with general graph processing systems, partitioning data over a cluster of machines improves the scalability of graph database management systems. However, these systems will incur additional network cost during the execution of a query workload, due to inter-partition traversals. Workload-agnostic partitioning algorithms typically minimise the likelihood of any edge crossing partition boundaries. However, these partitioners are sub-optimal with respect to many workloads, especially queries, which may require more frequent traversal of specific subsets of inter-partition edges. Furthermore,","authors_text":"Hugo Firth, Jack Aiston, Paolo Missier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-17T16:06:04Z","title":"Loom: Query-aware Partitioning of Online Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06608","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:1df5c3dd909060b941e75c3ae48452555c5dbc7c8b172e26784afbf114355418","target":"record","created_at":"2026-05-18T00:30:18Z","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":"6a296485c52ac840046caefc849af4f5ed9d8a11dfac989af874511c99858619","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-17T16:06:04Z","title_canon_sha256":"429feffa3546b6ec28b48b64099d7d82375234173f94d4c97fdc9d42832cf60d"},"schema_version":"1.0","source":{"id":"1711.06608","kind":"arxiv","version":1}},"canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","first_computed_at":"2026-05-18T00:30:18.420983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:18.420983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbrFSSFCqeZKKU6H3TxVZVjGgxRCzswZrZZ/ZXxw2Ar3VWZO872JicwW9eldsQja8DK565ijXvh9NLrJG4KwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:18.421681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df5c3dd909060b941e75c3ae48452555c5dbc7c8b172e26784afbf114355418","sha256:d8a0a3965eb3052884c2bf684a623378b0a744268823007c4256c0798260c9d6"],"state_sha256":"7f357e4504d2b0319028f1cfc6cbc86c0ac0936afd84266516101e197cf09306"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0S0IbMeUWcGT2WNKxXyAhzA7s29Om6b+dTrJUoGrx3v5jiDCn92umlwl0I3J5/9wCjpnwrm9RSscq17Y8tvhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:53:36.650838Z","bundle_sha256":"c2284d73701b23dd3bbe92c61933fc6c42b9fd3b4edb5a2db901fe8a45f06a69"}}