{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LR4TXANTDWWRHVCX7PHONW33GH","short_pith_number":"pith:LR4TXANT","canonical_record":{"source":{"id":"1411.2286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-09T21:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca2df7c4a130cd791b7f1920d6a08a2a8a25818cbb2f872df097f248eace4c36","abstract_canon_sha256":"f9df1dfb37e4f2afa45ede68b4d5d3130cabc54ec0bbd62f9c6b947055011cde"},"schema_version":"1.0"},"canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","source":{"kind":"arxiv","id":"1411.2286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2286","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2286v1","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2286","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"LR4TXANTDWWR","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LR4TXANTDWWRHVCX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LR4TXANT","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LR4TXANTDWWRHVCX7PHONW33GH","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-09T21:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"ca2df7c4a130cd791b7f1920d6a08a2a8a25818cbb2f872df097f248eace4c36","abstract_canon_sha256":"f9df1dfb37e4f2afa45ede68b4d5d3130cabc54ec0bbd62f9c6b947055011cde"},"schema_version":"1.0"},"canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:07.933451Z","signature_b64":"h9RyCmoVdBc29IqLJfm3V9SMGm4g7YhwS/+Hg4cZpLiN9YcZ/ixeTJxb3krMYUxsD/pHzmQN+jVsLh9I9lQiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","last_reissued_at":"2026-05-18T02:38:07.932832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:07.932832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2286","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:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRD2AhZvo9I68aPIAz8g7pFE2YcNAybbmFgfTRoAUQe18lHrD1f+jKtD/a2AYPmUUi/T96qmuQ7I6dGCneXhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:05:49.113154Z"},"content_sha256":"bb8ce408265a1cff7f86b545b6b1ae6091c000f5cc6f1a8a4a3b9609da1d3818","schema_version":"1.0","event_id":"sha256:bb8ce408265a1cff7f86b545b6b1ae6091c000f5cc6f1a8a4a3b9609da1d3818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LR4TXANTDWWRHVCX7PHONW33GH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Characterizing the Data Access Complexity of Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fabrice Rastello, J. Ramanujam, Louis-Noel Pouchet, P. Sadayappan, Venmugil Elango","submitted_at":"2014-11-09T21:40:41Z","abstract_excerpt":"Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental characterization of data access complexity will be increasingly important. The problem of developing lower bounds for data access complexity has been modeled using the formalism of Hong & Kung's red/blue pebble game for computational directed acyclic graphs (CDAGs). However, previously developed approaches to lower bounds analysis for the red/bl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2286","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:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC7Rb2DSDll6NkmDb3fnS7fZ2Y3ZcG+QfYJ2sgyhN+O/ce1ezDfkAyMehlI6AKUeqEbEnOa14yx72blMmHWGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:05:49.113527Z"},"content_sha256":"a9935d0c6189fb3ef39f42e50fea65486b99c6ae6923d33d170f3ebe4a739641","schema_version":"1.0","event_id":"sha256:a9935d0c6189fb3ef39f42e50fea65486b99c6ae6923d33d170f3ebe4a739641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/bundle.json","state_url":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR4TXANTDWWRHVCX7PHONW33GH/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:05:49Z","links":{"resolver":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH","bundle":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/bundle.json","state":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR4TXANTDWWRHVCX7PHONW33GH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LR4TXANTDWWRHVCX7PHONW33GH","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":"f9df1dfb37e4f2afa45ede68b4d5d3130cabc54ec0bbd62f9c6b947055011cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-09T21:40:41Z","title_canon_sha256":"ca2df7c4a130cd791b7f1920d6a08a2a8a25818cbb2f872df097f248eace4c36"},"schema_version":"1.0","source":{"id":"1411.2286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2286","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2286v1","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2286","created_at":"2026-05-18T02:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"LR4TXANTDWWR","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LR4TXANTDWWRHVCX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LR4TXANT","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:a9935d0c6189fb3ef39f42e50fea65486b99c6ae6923d33d170f3ebe4a739641","target":"graph","created_at":"2026-05-18T02:38:07Z","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":"Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental characterization of data access complexity will be increasingly important. The problem of developing lower bounds for data access complexity has been modeled using the formalism of Hong & Kung's red/blue pebble game for computational directed acyclic graphs (CDAGs). However, previously developed approaches to lower bounds analysis for the red/bl","authors_text":"Fabrice Rastello, J. Ramanujam, Louis-Noel Pouchet, P. Sadayappan, Venmugil Elango","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-09T21:40:41Z","title":"On Characterizing the Data Access Complexity of Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2286","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:bb8ce408265a1cff7f86b545b6b1ae6091c000f5cc6f1a8a4a3b9609da1d3818","target":"record","created_at":"2026-05-18T02:38:07Z","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":"f9df1dfb37e4f2afa45ede68b4d5d3130cabc54ec0bbd62f9c6b947055011cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-09T21:40:41Z","title_canon_sha256":"ca2df7c4a130cd791b7f1920d6a08a2a8a25818cbb2f872df097f248eace4c36"},"schema_version":"1.0","source":{"id":"1411.2286","kind":"arxiv","version":1}},"canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","first_computed_at":"2026-05-18T02:38:07.932832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:07.932832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h9RyCmoVdBc29IqLJfm3V9SMGm4g7YhwS/+Hg4cZpLiN9YcZ/ixeTJxb3krMYUxsD/pHzmQN+jVsLh9I9lQiBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:07.933451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb8ce408265a1cff7f86b545b6b1ae6091c000f5cc6f1a8a4a3b9609da1d3818","sha256:a9935d0c6189fb3ef39f42e50fea65486b99c6ae6923d33d170f3ebe4a739641"],"state_sha256":"d7e285ed27e217a60176386c9363f914e5ae173ec968022e3830ceea30f36feb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwlbtD2lCqVU63s6egZZiYWmGH2vc3zoBnAIMSx4OadBOrIMJmGStbd0jmP7175kTh42yDa1Kz3Und16n7zsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:05:49.115619Z","bundle_sha256":"ae68bbb8d293249c8473ee7277bbcbada5500c58e61342ff99cc55e35512d844"}}