{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UETHGOTJ5VJNMW6MTRAYBIILDQ","short_pith_number":"pith:UETHGOTJ","schema_version":"1.0","canonical_sha256":"a126733a69ed52d65bcc9c4180a10b1c2301b64e4af7bcff40ec6d82e455a07f","source":{"kind":"arxiv","id":"1907.02007","version":1},"attestation_state":"computed","paper":{"title":"An Encoding-Decoding algorithm based on Padovan numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Alaa Al-Kateeb, Jenan Shtayat","submitted_at":"2019-07-03T16:02:19Z","abstract_excerpt":"In this paper, we propose a new of coding/decoding algorithm using Padovan Q-matrices. This method is based on blocked message matrices. an advantage of this method is that the encryption of each message matrix will use a different key and that will increase the security of the method."},"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":"1907.02007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-03T16:02:19Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"efcec5dd216abafe14325fdb5b911697d0f52c181f0c9b4143edbccc96b3083d","abstract_canon_sha256":"2ca7de74e9954b11be4f7d7717215f8440bd2808675646273d86e36f26c0a580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:34.247955Z","signature_b64":"On92kLkpCuXyrClBtpnqTmFy2VMMciRSY6ugqyQd17hu9DOwcamDEz+s+ma9n7/9QFWNhsx9eGTmiIUmq1A9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a126733a69ed52d65bcc9c4180a10b1c2301b64e4af7bcff40ec6d82e455a07f","last_reissued_at":"2026-05-17T23:41:34.247264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:34.247264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Encoding-Decoding algorithm based on Padovan numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Alaa Al-Kateeb, Jenan Shtayat","submitted_at":"2019-07-03T16:02:19Z","abstract_excerpt":"In this paper, we propose a new of coding/decoding algorithm using Padovan Q-matrices. This method is based on blocked message matrices. an advantage of this method is that the encryption of each message matrix will use a different key and that will increase the security of the method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02007","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":"1907.02007","created_at":"2026-05-17T23:41:34.247351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02007v1","created_at":"2026-05-17T23:41:34.247351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02007","created_at":"2026-05-17T23:41:34.247351+00:00"},{"alias_kind":"pith_short_12","alias_value":"UETHGOTJ5VJN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UETHGOTJ5VJNMW6M","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UETHGOTJ","created_at":"2026-05-18T12:33:30.264802+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/UETHGOTJ5VJNMW6MTRAYBIILDQ","json":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ.json","graph_json":"https://pith.science/api/pith-number/UETHGOTJ5VJNMW6MTRAYBIILDQ/graph.json","events_json":"https://pith.science/api/pith-number/UETHGOTJ5VJNMW6MTRAYBIILDQ/events.json","paper":"https://pith.science/paper/UETHGOTJ"},"agent_actions":{"view_html":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ","download_json":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ.json","view_paper":"https://pith.science/paper/UETHGOTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02007&json=true","fetch_graph":"https://pith.science/api/pith-number/UETHGOTJ5VJNMW6MTRAYBIILDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UETHGOTJ5VJNMW6MTRAYBIILDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ/action/storage_attestation","attest_author":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ/action/author_attestation","sign_citation":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ/action/citation_signature","submit_replication":"https://pith.science/pith/UETHGOTJ5VJNMW6MTRAYBIILDQ/action/replication_record"}},"created_at":"2026-05-17T23:41:34.247351+00:00","updated_at":"2026-05-17T23:41:34.247351+00:00"}