{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:B3GKAM7EUPTVEAJIHRHC34PATF","short_pith_number":"pith:B3GKAM7E","schema_version":"1.0","canonical_sha256":"0ecca033e4a3e75201283c4e2df1e0994c26e081a7ef44a014a3e6bb9ee6b401","source":{"kind":"arxiv","id":"1011.4609","version":1},"attestation_state":"computed","paper":{"title":"Bounds from a Card Trick","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Travis Gagie","submitted_at":"2010-11-20T20:11:13Z","abstract_excerpt":"We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources."},"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":"1011.4609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-20T20:11:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"40b42a3588a38e24151f8eeb60468e5135485b233dcfbf1b62a45e7787e12e69","abstract_canon_sha256":"780062a5e294f048ac30538ef1f39417f1cb46b26f9363814f9316e040fab56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:04.309125Z","signature_b64":"6Nq9OXZeseKtTgrTz+JCwhahCQMALRzvftLjBCoirlS5TxEDMST95bKcHFST2ym3Y+k//En8W5DfTpGRu3reAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ecca033e4a3e75201283c4e2df1e0994c26e081a7ef44a014a3e6bb9ee6b401","last_reissued_at":"2026-05-18T04:35:04.308656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:04.308656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds from a Card Trick","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Travis Gagie","submitted_at":"2010-11-20T20:11:13Z","abstract_excerpt":"We describe a new variation of a mathematical card trick, whose analysis leads to new lower bounds for data compression and estimating the entropy of Markov sources."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4609","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":"1011.4609","created_at":"2026-05-18T04:35:04.308720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4609v1","created_at":"2026-05-18T04:35:04.308720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4609","created_at":"2026-05-18T04:35:04.308720+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3GKAM7EUPTV","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3GKAM7EUPTVEAJI","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3GKAM7E","created_at":"2026-05-18T12:26:05.355336+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/B3GKAM7EUPTVEAJIHRHC34PATF","json":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF.json","graph_json":"https://pith.science/api/pith-number/B3GKAM7EUPTVEAJIHRHC34PATF/graph.json","events_json":"https://pith.science/api/pith-number/B3GKAM7EUPTVEAJIHRHC34PATF/events.json","paper":"https://pith.science/paper/B3GKAM7E"},"agent_actions":{"view_html":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF","download_json":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF.json","view_paper":"https://pith.science/paper/B3GKAM7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4609&json=true","fetch_graph":"https://pith.science/api/pith-number/B3GKAM7EUPTVEAJIHRHC34PATF/graph.json","fetch_events":"https://pith.science/api/pith-number/B3GKAM7EUPTVEAJIHRHC34PATF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF/action/storage_attestation","attest_author":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF/action/author_attestation","sign_citation":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF/action/citation_signature","submit_replication":"https://pith.science/pith/B3GKAM7EUPTVEAJIHRHC34PATF/action/replication_record"}},"created_at":"2026-05-18T04:35:04.308720+00:00","updated_at":"2026-05-18T04:35:04.308720+00:00"}