{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6SOGH635SCFPI4R5U32BFIVTXB","short_pith_number":"pith:6SOGH635","canonical_record":{"source":{"id":"1603.04626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-15T10:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"8034a391ec71d4fceba8d48fa09f7d7c374917bed21559e0054a2404ab7fbad7","abstract_canon_sha256":"48ce760c55c42b50fab7d9997e2e819a39c2e67eccb93a100ed1ce7ba9f13f12"},"schema_version":"1.0"},"canonical_sha256":"f49c63fb7d908af4723da6f412a2b3b8762c38323a7b89ad3a82b1c26d3c6e75","source":{"kind":"arxiv","id":"1603.04626","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04626","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04626v2","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04626","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"6SOGH635SCFP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SOGH635SCFPI4R5","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SOGH635","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6SOGH635SCFPI4R5U32BFIVTXB","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-15T10:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"8034a391ec71d4fceba8d48fa09f7d7c374917bed21559e0054a2404ab7fbad7","abstract_canon_sha256":"48ce760c55c42b50fab7d9997e2e819a39c2e67eccb93a100ed1ce7ba9f13f12"},"schema_version":"1.0"},"canonical_sha256":"f49c63fb7d908af4723da6f412a2b3b8762c38323a7b89ad3a82b1c26d3c6e75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.979968Z","signature_b64":"0RO8GBXR6Ix4T00QY2QPZZxOheMAxh35VqB/v36d9cEGSt3YmgsXkTZlX/IoiXyzavQHZ6H2hANalgJj8EA+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49c63fb7d908af4723da6f412a2b3b8762c38323a7b89ad3a82b1c26d3c6e75","last_reissued_at":"2026-05-18T01:11:58.979622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.979622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04626","source_version":2,"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-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrFjaWjuzwkd/Zjhqv2G1iaI7ULG7WGffMJNFRKYwGEjBDXiLHX1PM3srByC/dpKlwhR9k9PPbPlEmZKkwPXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:50:19.623471Z"},"content_sha256":"8c51f06232923012a5623a897ae9820e16cddeec2ed9fa03044f7e4b87e8f677","schema_version":"1.0","event_id":"sha256:8c51f06232923012a5623a897ae9820e16cddeec2ed9fa03044f7e4b87e8f677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6SOGH635SCFPI4R5U32BFIVTXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TAPER: query-aware, partition-enhancement for large, heterogenous, graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hugo Firth, Paolo Missier","submitted_at":"2016-03-15T10:41:59Z","abstract_excerpt":"Graph partitioning has long been seen as a viable approach to address Graph DBMS scalability. A partitioning, however, may introduce extra query processing latency unless it is sensitive to a specific query workload, and optimised to minimise inter-partition traversals for that workload. Additionally, it should also be possible to incrementally adjust the partitioning in reaction to changes in the graph topology, the query workload, or both. Because of their complexity, current partitioning algorithms fall short of one or both of these requirements, as they are designed for offline use and as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04626","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"},"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-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6KWUt0K6b5sUYEiFxXOyPCOfqdrq8Y6QJi67rY7WFMplmBWY8NDXpzjOpTZMLZe+RlS6BM3PkBZCoTIfTXvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:50:19.623806Z"},"content_sha256":"201f4afbf50c001c1e036e382846c0b54a2e87c7fa61335953e7f909e8060374","schema_version":"1.0","event_id":"sha256:201f4afbf50c001c1e036e382846c0b54a2e87c7fa61335953e7f909e8060374"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SOGH635SCFPI4R5U32BFIVTXB/bundle.json","state_url":"https://pith.science/pith/6SOGH635SCFPI4R5U32BFIVTXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SOGH635SCFPI4R5U32BFIVTXB/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-24T04:50:19Z","links":{"resolver":"https://pith.science/pith/6SOGH635SCFPI4R5U32BFIVTXB","bundle":"https://pith.science/pith/6SOGH635SCFPI4R5U32BFIVTXB/bundle.json","state":"https://pith.science/pith/6SOGH635SCFPI4R5U32BFIVTXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SOGH635SCFPI4R5U32BFIVTXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6SOGH635SCFPI4R5U32BFIVTXB","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":"48ce760c55c42b50fab7d9997e2e819a39c2e67eccb93a100ed1ce7ba9f13f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-15T10:41:59Z","title_canon_sha256":"8034a391ec71d4fceba8d48fa09f7d7c374917bed21559e0054a2404ab7fbad7"},"schema_version":"1.0","source":{"id":"1603.04626","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04626","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04626v2","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04626","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"6SOGH635SCFP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SOGH635SCFPI4R5","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SOGH635","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:201f4afbf50c001c1e036e382846c0b54a2e87c7fa61335953e7f909e8060374","target":"graph","created_at":"2026-05-18T01:11:58Z","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":"Graph partitioning has long been seen as a viable approach to address Graph DBMS scalability. A partitioning, however, may introduce extra query processing latency unless it is sensitive to a specific query workload, and optimised to minimise inter-partition traversals for that workload. Additionally, it should also be possible to incrementally adjust the partitioning in reaction to changes in the graph topology, the query workload, or both. Because of their complexity, current partitioning algorithms fall short of one or both of these requirements, as they are designed for offline use and as ","authors_text":"Hugo Firth, Paolo Missier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-15T10:41:59Z","title":"TAPER: query-aware, partition-enhancement for large, heterogenous, graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04626","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:8c51f06232923012a5623a897ae9820e16cddeec2ed9fa03044f7e4b87e8f677","target":"record","created_at":"2026-05-18T01:11:58Z","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":"48ce760c55c42b50fab7d9997e2e819a39c2e67eccb93a100ed1ce7ba9f13f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-15T10:41:59Z","title_canon_sha256":"8034a391ec71d4fceba8d48fa09f7d7c374917bed21559e0054a2404ab7fbad7"},"schema_version":"1.0","source":{"id":"1603.04626","kind":"arxiv","version":2}},"canonical_sha256":"f49c63fb7d908af4723da6f412a2b3b8762c38323a7b89ad3a82b1c26d3c6e75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f49c63fb7d908af4723da6f412a2b3b8762c38323a7b89ad3a82b1c26d3c6e75","first_computed_at":"2026-05-18T01:11:58.979622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:58.979622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0RO8GBXR6Ix4T00QY2QPZZxOheMAxh35VqB/v36d9cEGSt3YmgsXkTZlX/IoiXyzavQHZ6H2hANalgJj8EA+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:58.979968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04626","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c51f06232923012a5623a897ae9820e16cddeec2ed9fa03044f7e4b87e8f677","sha256:201f4afbf50c001c1e036e382846c0b54a2e87c7fa61335953e7f909e8060374"],"state_sha256":"f67ec9b49a0feae0ca66cb1b63baa36c91eeb5a0fc834a6fb83791c9110a8364"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CoVTuxrbwo6qklRCwIieJM8/zObjPQmorczZhdbHqR69yxG7hMVY68cBklHoTVf4OoZOQ3QBH+uxueR/6ZmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:50:19.625667Z","bundle_sha256":"751a15fc50dcbd2fb31b8ca19902a1d2bcb3f6fa6ca945e49226a2702da7132e"}}