{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A4AYDVCGZFL2BA43WAAVWMQL6E","short_pith_number":"pith:A4AYDVCG","canonical_record":{"source":{"id":"1412.8120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-28T06:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"2e61f30c14d91514e636cc06e8ec08d7a9048ea395309c4a22cdaf5fb35a993a","abstract_canon_sha256":"702d4586573f0e1fcc9f5f2094eba1c7d11731f18a18861c42781f0219c7cbee"},"schema_version":"1.0"},"canonical_sha256":"070181d446c957a0839bb0015b320bf11e25db9e8e827e6e03650c08f22dcf24","source":{"kind":"arxiv","id":"1412.8120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8120","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8120v1","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8120","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"A4AYDVCGZFL2","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4AYDVCGZFL2BA43","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4AYDVCG","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A4AYDVCGZFL2BA43WAAVWMQL6E","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-28T06:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"2e61f30c14d91514e636cc06e8ec08d7a9048ea395309c4a22cdaf5fb35a993a","abstract_canon_sha256":"702d4586573f0e1fcc9f5f2094eba1c7d11731f18a18861c42781f0219c7cbee"},"schema_version":"1.0"},"canonical_sha256":"070181d446c957a0839bb0015b320bf11e25db9e8e827e6e03650c08f22dcf24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:24.056175Z","signature_b64":"pFANbbzIqQDlgnmHZpEJfrRotauBcFH6NJ6H1c79FBWn5vgv2nyTeq/GAS8OMNLx/k5sPpNIrp61ZjWXw0KtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"070181d446c957a0839bb0015b320bf11e25db9e8e827e6e03650c08f22dcf24","last_reissued_at":"2026-05-18T02:30:24.055560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:24.055560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8120","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-18T02:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tmj6+hJnG+F2kXzeC9JFe2k2RAt2f++udNbmjvCLPChwkXN2s7Oj96NNIBLNScjkHklZJYpEqB0d+05I3jgLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:21.704369Z"},"content_sha256":"0d5f3cc81095fd9a2ac5fbd7afc8300e5a43182cf1e94d0e0033077b2a073ab5","schema_version":"1.0","event_id":"sha256:0d5f3cc81095fd9a2ac5fbd7afc8300e5a43182cf1e94d0e0033077b2a073ab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A4AYDVCGZFL2BA43WAAVWMQL6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adapting Graph Application Performance via Alternate Data Structure Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amlan Kusum, Iulian Neamtiu, Rajiv Gupta","submitted_at":"2014-12-28T06:49:23Z","abstract_excerpt":"Graph processing is used extensively in areas from social networking mining to web indexing. We demonstrate that the performance and dependability of such applications critically hinges on the graph data structure used, because a fixed, compile-time choice of data structure can lead to poor performance or applications unable to complete. To address this problem, we introduce an approach that helps programmers transform regular, off-the-shelf graph applications into adaptive, more dependable applications where adaptations are performed via runtime selection from alternate data structure represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8120","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-18T02:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdJQ25PrrD7yo9lzbJ5dsXF8ta4qBF4lhcx2QEfBod9I4q9kMxQRuG4R32a5ybjDT3UCx0FwTfTt35b7NjcMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:21.705093Z"},"content_sha256":"1f7662ea44cca584d1c22613dc2efc698c9ada426e50a3e2a1932a0f0173337d","schema_version":"1.0","event_id":"sha256:1f7662ea44cca584d1c22613dc2efc698c9ada426e50a3e2a1932a0f0173337d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/bundle.json","state_url":"https://pith.science/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/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-27T15:47:21Z","links":{"resolver":"https://pith.science/pith/A4AYDVCGZFL2BA43WAAVWMQL6E","bundle":"https://pith.science/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/bundle.json","state":"https://pith.science/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4AYDVCGZFL2BA43WAAVWMQL6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A4AYDVCGZFL2BA43WAAVWMQL6E","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":"702d4586573f0e1fcc9f5f2094eba1c7d11731f18a18861c42781f0219c7cbee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-28T06:49:23Z","title_canon_sha256":"2e61f30c14d91514e636cc06e8ec08d7a9048ea395309c4a22cdaf5fb35a993a"},"schema_version":"1.0","source":{"id":"1412.8120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8120","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8120v1","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8120","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"A4AYDVCGZFL2","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4AYDVCGZFL2BA43","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4AYDVCG","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:1f7662ea44cca584d1c22613dc2efc698c9ada426e50a3e2a1932a0f0173337d","target":"graph","created_at":"2026-05-18T02:30:24Z","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 processing is used extensively in areas from social networking mining to web indexing. We demonstrate that the performance and dependability of such applications critically hinges on the graph data structure used, because a fixed, compile-time choice of data structure can lead to poor performance or applications unable to complete. To address this problem, we introduce an approach that helps programmers transform regular, off-the-shelf graph applications into adaptive, more dependable applications where adaptations are performed via runtime selection from alternate data structure represe","authors_text":"Amlan Kusum, Iulian Neamtiu, Rajiv Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-28T06:49:23Z","title":"Adapting Graph Application Performance via Alternate Data Structure Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8120","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:0d5f3cc81095fd9a2ac5fbd7afc8300e5a43182cf1e94d0e0033077b2a073ab5","target":"record","created_at":"2026-05-18T02:30:24Z","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":"702d4586573f0e1fcc9f5f2094eba1c7d11731f18a18861c42781f0219c7cbee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-12-28T06:49:23Z","title_canon_sha256":"2e61f30c14d91514e636cc06e8ec08d7a9048ea395309c4a22cdaf5fb35a993a"},"schema_version":"1.0","source":{"id":"1412.8120","kind":"arxiv","version":1}},"canonical_sha256":"070181d446c957a0839bb0015b320bf11e25db9e8e827e6e03650c08f22dcf24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"070181d446c957a0839bb0015b320bf11e25db9e8e827e6e03650c08f22dcf24","first_computed_at":"2026-05-18T02:30:24.055560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:24.055560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pFANbbzIqQDlgnmHZpEJfrRotauBcFH6NJ6H1c79FBWn5vgv2nyTeq/GAS8OMNLx/k5sPpNIrp61ZjWXw0KtCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:24.056175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5f3cc81095fd9a2ac5fbd7afc8300e5a43182cf1e94d0e0033077b2a073ab5","sha256:1f7662ea44cca584d1c22613dc2efc698c9ada426e50a3e2a1932a0f0173337d"],"state_sha256":"777618ff9a064db0be2fdab70cc2ce52ff95812e59798846440bab498b3b7dd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIpMKrObfegvhesQdb0d7bH6xS7m1XaRRXat6OKb/Srw61rlVSj9isMK44yxN1MSIZsqjTwGheKRrFCpXh+PAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:47:21.708955Z","bundle_sha256":"dd65aa3101f78684c235f95121cc69f3f0c6fc654c6f54e8c3c425102f306545"}}