{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:43JYYCBU2GNLP4JF7ABL5MBZMX","short_pith_number":"pith:43JYYCBU","schema_version":"1.0","canonical_sha256":"e6d38c0834d19ab7f125f802beb03965e49d3ae9f804e7769306802f720de361","source":{"kind":"arxiv","id":"1210.7756","version":1},"attestation_state":"computed","paper":{"title":"A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Douglas R. Stinson, Jalaj Upadhyay, Maura B. Paterson","submitted_at":"2012-10-29T18:05:39Z","abstract_excerpt":"There has been considerable recent interest in \"cloud storage\" wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actually storing the file, and typically a challenge-response protocol is employed to convince the user that the file is indeed being stored correctly. The security of these schemes is phrased in terms of an extractor which will recover or retrieve the file given any \"proving algorithm\" that has a sufficiently high success probability.\n  This paper treats proof-of-retrievability schemes in the model of unconditional secur"},"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":"1210.7756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-29T18:05:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7fd58dde57a4fd5e61b6b5e757f77cfe55b2c69dfd4b09b989c483d019f15341","abstract_canon_sha256":"723b0dc7122e0a6ee2e2ea4ec594bc0210a1d1982ff243df8431f9735d3a6e74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:59.432059Z","signature_b64":"VZfzSi0iJ4EzmavD6gMEt/2Ji0rJjft6eGqaBrLTGGx8+lswaYRQSiXKWtfOE3TdfHbpW/UysrVtXUrj7XlpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d38c0834d19ab7f125f802beb03965e49d3ae9f804e7769306802f720de361","last_reissued_at":"2026-05-18T03:41:59.431384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:59.431384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Douglas R. Stinson, Jalaj Upadhyay, Maura B. Paterson","submitted_at":"2012-10-29T18:05:39Z","abstract_excerpt":"There has been considerable recent interest in \"cloud storage\" wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actually storing the file, and typically a challenge-response protocol is employed to convince the user that the file is indeed being stored correctly. The security of these schemes is phrased in terms of an extractor which will recover or retrieve the file given any \"proving algorithm\" that has a sufficiently high success probability.\n  This paper treats proof-of-retrievability schemes in the model of unconditional secur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7756","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":"1210.7756","created_at":"2026-05-18T03:41:59.431510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7756v1","created_at":"2026-05-18T03:41:59.431510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7756","created_at":"2026-05-18T03:41:59.431510+00:00"},{"alias_kind":"pith_short_12","alias_value":"43JYYCBU2GNL","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"43JYYCBU2GNLP4JF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"43JYYCBU","created_at":"2026-05-18T12:26:53.410803+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/43JYYCBU2GNLP4JF7ABL5MBZMX","json":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX.json","graph_json":"https://pith.science/api/pith-number/43JYYCBU2GNLP4JF7ABL5MBZMX/graph.json","events_json":"https://pith.science/api/pith-number/43JYYCBU2GNLP4JF7ABL5MBZMX/events.json","paper":"https://pith.science/paper/43JYYCBU"},"agent_actions":{"view_html":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX","download_json":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX.json","view_paper":"https://pith.science/paper/43JYYCBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7756&json=true","fetch_graph":"https://pith.science/api/pith-number/43JYYCBU2GNLP4JF7ABL5MBZMX/graph.json","fetch_events":"https://pith.science/api/pith-number/43JYYCBU2GNLP4JF7ABL5MBZMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX/action/storage_attestation","attest_author":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX/action/author_attestation","sign_citation":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX/action/citation_signature","submit_replication":"https://pith.science/pith/43JYYCBU2GNLP4JF7ABL5MBZMX/action/replication_record"}},"created_at":"2026-05-18T03:41:59.431510+00:00","updated_at":"2026-05-18T03:41:59.431510+00:00"}