{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2BGCW76SAFHUPT32QKI36CDJ2S","short_pith_number":"pith:2BGCW76S","canonical_record":{"source":{"id":"1203.5675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-26T14:12:48Z","cross_cats_sorted":["cs.DB","cs.PF"],"title_canon_sha256":"3c713ea2cfca3e3878c607458e90a98dcc6fe9e0d45ee6e9c3c4e463bae41479","abstract_canon_sha256":"01348b79880991fb35102f74ce936306c18e636df54600a381057541a2bb81b0"},"schema_version":"1.0"},"canonical_sha256":"d04c2b7fd2014f47cf7a8291bf0869d491d4b7fae70b0c3ebbdd9871cb68d593","source":{"kind":"arxiv","id":"1203.5675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5675","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5675v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5675","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"2BGCW76SAFHU","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2BGCW76SAFHUPT32","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2BGCW76S","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2BGCW76SAFHUPT32QKI36CDJ2S","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-26T14:12:48Z","cross_cats_sorted":["cs.DB","cs.PF"],"title_canon_sha256":"3c713ea2cfca3e3878c607458e90a98dcc6fe9e0d45ee6e9c3c4e463bae41479","abstract_canon_sha256":"01348b79880991fb35102f74ce936306c18e636df54600a381057541a2bb81b0"},"schema_version":"1.0"},"canonical_sha256":"d04c2b7fd2014f47cf7a8291bf0869d491d4b7fae70b0c3ebbdd9871cb68d593","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:14.474525Z","signature_b64":"4WXJ4VB2smrkKMzzxu2cxN83TaStRYKt9lw0zKxvIi0DzPhNXgzeFKnjZLELFLZt4GVt8d9a/DyTkZv45NyADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d04c2b7fd2014f47cf7a8291bf0869d491d4b7fae70b0c3ebbdd9871cb68d593","last_reissued_at":"2026-05-18T03:59:14.474082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:14.474082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5675","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-18T03:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/b3+ZjtutMg29WXzKohLIU5uvuC7fHBfgy5e2BpcfOurdGvm6mjSP4aEwQTduNBp4nqakQNjp9WBnVAphENTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:57.119481Z"},"content_sha256":"354fdc744bb3a4f6edfaef048b890a2d800f18829e40341f72f1937dd490c18d","schema_version":"1.0","event_id":"sha256:354fdc744bb3a4f6edfaef048b890a2d800f18829e40341f72f1937dd490c18d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2BGCW76SAFHUPT32QKI36CDJ2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Hierarchy Sensitive Graph Layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.PF"],"primary_cat":"cs.DS","authors_text":"Amitabha Roy","submitted_at":"2012-03-26T14:12:48Z","abstract_excerpt":"Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms that has hitherto not received much interest is the effect of memory hierarchy on accesses. A typical system today has multiple levels in the memory hierarchy with differing units of locality; ranging across cache lines, TLB entries and DRAM pages. We postulate that it is possible to allocate graph structured data in main memory in a way as to improve the spatial locality of the data. Previous approaches to improving c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5675","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-18T03:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXF94yb/8clj4BLq5LJUhkquSEwakfntt4c6z4+FfPielYIabivLxOMpPWpzNs2OM5bRKN5wINPMX2zh3YMWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:27:57.120114Z"},"content_sha256":"79a2408867de89b852ed8c479248a34fc4c0578a82ec4c0a11c8972fd645540a","schema_version":"1.0","event_id":"sha256:79a2408867de89b852ed8c479248a34fc4c0578a82ec4c0a11c8972fd645540a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BGCW76SAFHUPT32QKI36CDJ2S/bundle.json","state_url":"https://pith.science/pith/2BGCW76SAFHUPT32QKI36CDJ2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BGCW76SAFHUPT32QKI36CDJ2S/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-05-30T06:27:57Z","links":{"resolver":"https://pith.science/pith/2BGCW76SAFHUPT32QKI36CDJ2S","bundle":"https://pith.science/pith/2BGCW76SAFHUPT32QKI36CDJ2S/bundle.json","state":"https://pith.science/pith/2BGCW76SAFHUPT32QKI36CDJ2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BGCW76SAFHUPT32QKI36CDJ2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2BGCW76SAFHUPT32QKI36CDJ2S","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":"01348b79880991fb35102f74ce936306c18e636df54600a381057541a2bb81b0","cross_cats_sorted":["cs.DB","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-26T14:12:48Z","title_canon_sha256":"3c713ea2cfca3e3878c607458e90a98dcc6fe9e0d45ee6e9c3c4e463bae41479"},"schema_version":"1.0","source":{"id":"1203.5675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5675","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5675v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5675","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"2BGCW76SAFHU","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2BGCW76SAFHUPT32","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2BGCW76S","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:79a2408867de89b852ed8c479248a34fc4c0578a82ec4c0a11c8972fd645540a","target":"graph","created_at":"2026-05-18T03:59:14Z","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":"Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms that has hitherto not received much interest is the effect of memory hierarchy on accesses. A typical system today has multiple levels in the memory hierarchy with differing units of locality; ranging across cache lines, TLB entries and DRAM pages. We postulate that it is possible to allocate graph structured data in main memory in a way as to improve the spatial locality of the data. Previous approaches to improving c","authors_text":"Amitabha Roy","cross_cats":["cs.DB","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-26T14:12:48Z","title":"Memory Hierarchy Sensitive Graph Layout"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5675","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:354fdc744bb3a4f6edfaef048b890a2d800f18829e40341f72f1937dd490c18d","target":"record","created_at":"2026-05-18T03:59:14Z","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":"01348b79880991fb35102f74ce936306c18e636df54600a381057541a2bb81b0","cross_cats_sorted":["cs.DB","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-26T14:12:48Z","title_canon_sha256":"3c713ea2cfca3e3878c607458e90a98dcc6fe9e0d45ee6e9c3c4e463bae41479"},"schema_version":"1.0","source":{"id":"1203.5675","kind":"arxiv","version":1}},"canonical_sha256":"d04c2b7fd2014f47cf7a8291bf0869d491d4b7fae70b0c3ebbdd9871cb68d593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d04c2b7fd2014f47cf7a8291bf0869d491d4b7fae70b0c3ebbdd9871cb68d593","first_computed_at":"2026-05-18T03:59:14.474082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:14.474082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4WXJ4VB2smrkKMzzxu2cxN83TaStRYKt9lw0zKxvIi0DzPhNXgzeFKnjZLELFLZt4GVt8d9a/DyTkZv45NyADA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:14.474525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:354fdc744bb3a4f6edfaef048b890a2d800f18829e40341f72f1937dd490c18d","sha256:79a2408867de89b852ed8c479248a34fc4c0578a82ec4c0a11c8972fd645540a"],"state_sha256":"ee190f1824ec13d975e54730abe473fdf876f43007e9cdd1e3e2f756c8992b17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjuOd1XhmI7OfUwZwtYscJ6Mn3FAiGWkh8OGObj7zQXrPP9kJMZp+OqluglEtvhnS5uWiSLu99ihDLTFzPHLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:27:57.123113Z","bundle_sha256":"117ac22d816a26acb26ad8597aa2f83100e54a81d8aa6f2ebe87f9b1916cebe1"}}