{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JIYZNLTIZP7M7DPH6GZBOEGZCM","short_pith_number":"pith:JIYZNLTI","schema_version":"1.0","canonical_sha256":"4a3196ae68cbfecf8de7f1b21710d91317897f1bd8c9ffdd0e60ecb55670ef62","source":{"kind":"arxiv","id":"1601.07110","version":1},"attestation_state":"computed","paper":{"title":"The Narayana Universal Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishnamurthy Kirthi, Subhash Kak","submitted_at":"2016-01-26T17:33:42Z","abstract_excerpt":"This paper presents a method of universal coding based on the Narayana series. The rules necessary to make such coding possible have been found and the length of the resulting code has been determined to follow the Narayana count."},"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":"1601.07110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T17:33:42Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"c386270dc37e26d0cf8efd601d24c526653f15bc240c88b230210fa24c4316da","abstract_canon_sha256":"e2ded395e11afa7070d05e4d0b30311e31cec7657d0c14ae49b0cd6f429347d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:57.439106Z","signature_b64":"PJKGUCg83r3PaS6A2Re3VV5DyHYP1CK+yRU6l9ExqmaZEzHPe2An7FQxH6WpI/K1Sj4Bz40sGQ2uPQMh0oNeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3196ae68cbfecf8de7f1b21710d91317897f1bd8c9ffdd0e60ecb55670ef62","last_reissued_at":"2026-05-18T01:21:57.438555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:57.438555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Narayana Universal Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishnamurthy Kirthi, Subhash Kak","submitted_at":"2016-01-26T17:33:42Z","abstract_excerpt":"This paper presents a method of universal coding based on the Narayana series. The rules necessary to make such coding possible have been found and the length of the resulting code has been determined to follow the Narayana count."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07110","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":"1601.07110","created_at":"2026-05-18T01:21:57.438653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07110v1","created_at":"2026-05-18T01:21:57.438653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07110","created_at":"2026-05-18T01:21:57.438653+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIYZNLTIZP7M","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIYZNLTIZP7M7DPH","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIYZNLTI","created_at":"2026-05-18T12:30:25.849896+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/JIYZNLTIZP7M7DPH6GZBOEGZCM","json":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM.json","graph_json":"https://pith.science/api/pith-number/JIYZNLTIZP7M7DPH6GZBOEGZCM/graph.json","events_json":"https://pith.science/api/pith-number/JIYZNLTIZP7M7DPH6GZBOEGZCM/events.json","paper":"https://pith.science/paper/JIYZNLTI"},"agent_actions":{"view_html":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM","download_json":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM.json","view_paper":"https://pith.science/paper/JIYZNLTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07110&json=true","fetch_graph":"https://pith.science/api/pith-number/JIYZNLTIZP7M7DPH6GZBOEGZCM/graph.json","fetch_events":"https://pith.science/api/pith-number/JIYZNLTIZP7M7DPH6GZBOEGZCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM/action/storage_attestation","attest_author":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM/action/author_attestation","sign_citation":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM/action/citation_signature","submit_replication":"https://pith.science/pith/JIYZNLTIZP7M7DPH6GZBOEGZCM/action/replication_record"}},"created_at":"2026-05-18T01:21:57.438653+00:00","updated_at":"2026-05-18T01:21:57.438653+00:00"}