{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R33H55EWAHYLBER3UW5ZT4XKM2","short_pith_number":"pith:R33H55EW","schema_version":"1.0","canonical_sha256":"8ef67ef49601f0b0923ba5bb99f2ea66abc07a38f2691f66fe3ba5f358d02648","source":{"kind":"arxiv","id":"1711.06608","version":1},"attestation_state":"computed","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,"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06608","created_at":"2026-05-18T00:30:18.421080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06608v1","created_at":"2026-05-18T00:30:18.421080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06608","created_at":"2026-05-18T00:30:18.421080+00:00"},{"alias_kind":"pith_short_12","alias_value":"R33H55EWAHYL","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R33H55EWAHYLBER3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R33H55EW","created_at":"2026-05-18T12:31:39.905425+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/R33H55EWAHYLBER3UW5ZT4XKM2","json":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2.json","graph_json":"https://pith.science/api/pith-number/R33H55EWAHYLBER3UW5ZT4XKM2/graph.json","events_json":"https://pith.science/api/pith-number/R33H55EWAHYLBER3UW5ZT4XKM2/events.json","paper":"https://pith.science/paper/R33H55EW"},"agent_actions":{"view_html":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2","download_json":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2.json","view_paper":"https://pith.science/paper/R33H55EW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06608&json=true","fetch_graph":"https://pith.science/api/pith-number/R33H55EWAHYLBER3UW5ZT4XKM2/graph.json","fetch_events":"https://pith.science/api/pith-number/R33H55EWAHYLBER3UW5ZT4XKM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/action/storage_attestation","attest_author":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/action/author_attestation","sign_citation":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/action/citation_signature","submit_replication":"https://pith.science/pith/R33H55EWAHYLBER3UW5ZT4XKM2/action/replication_record"}},"created_at":"2026-05-18T00:30:18.421080+00:00","updated_at":"2026-05-18T00:30:18.421080+00:00"}