{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LR4TXANTDWWRHVCX7PHONW33GH","short_pith_number":"pith:LR4TXANT","schema_version":"1.0","canonical_sha256":"5c793b81b31dad13d457fbcee6db7b31d26cd54f89db86e331a2bab7a103758a","source":{"kind":"arxiv","id":"1411.2286","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.2286","created_at":"2026-05-18T02:38:07.932919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2286v1","created_at":"2026-05-18T02:38:07.932919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2286","created_at":"2026-05-18T02:38:07.932919+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR4TXANTDWWR","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR4TXANTDWWRHVCX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR4TXANT","created_at":"2026-05-18T12:28:38.356838+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/LR4TXANTDWWRHVCX7PHONW33GH","json":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH.json","graph_json":"https://pith.science/api/pith-number/LR4TXANTDWWRHVCX7PHONW33GH/graph.json","events_json":"https://pith.science/api/pith-number/LR4TXANTDWWRHVCX7PHONW33GH/events.json","paper":"https://pith.science/paper/LR4TXANT"},"agent_actions":{"view_html":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH","download_json":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH.json","view_paper":"https://pith.science/paper/LR4TXANT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2286&json=true","fetch_graph":"https://pith.science/api/pith-number/LR4TXANTDWWRHVCX7PHONW33GH/graph.json","fetch_events":"https://pith.science/api/pith-number/LR4TXANTDWWRHVCX7PHONW33GH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/action/storage_attestation","attest_author":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/action/author_attestation","sign_citation":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/action/citation_signature","submit_replication":"https://pith.science/pith/LR4TXANTDWWRHVCX7PHONW33GH/action/replication_record"}},"created_at":"2026-05-18T02:38:07.932919+00:00","updated_at":"2026-05-18T02:38:07.932919+00:00"}