{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SGNUJGYB2IZHFMB6O7OCQGFXPD","short_pith_number":"pith:SGNUJGYB","schema_version":"1.0","canonical_sha256":"919b449b01d23272b03e77dc2818b778d435770aea1cb287e715b8f7cb156086","source":{"kind":"arxiv","id":"1502.00894","version":1},"attestation_state":"computed","paper":{"title":"Extended Unary Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Subhash Kak","submitted_at":"2015-02-03T15:41:36Z","abstract_excerpt":"Extended variants of the recently introduced spread unary coding are described. These schemes, in which the length of the code word is fixed, allow representation of approximately n^2 numbers for n bits, rather than the n numbers of the standard unary coding. In the first of two proposed schemes the spread increases, whereas in the second scheme the spread remains constant."},"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":"1502.00894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-03T15:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"619ed217267e4c29d2e9aea28c111a084f64bc1eddda2d8a1c4fc6f1704d28b5","abstract_canon_sha256":"975e93bfc225e9444e55593755cd903c29f5f5137ebe29b6f8422c8079c69428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:59.306242Z","signature_b64":"2gbUwqhk3IW7MxBpc9Kcb8DygOJi0sXqC6Yr5cvSy/OArd2vDjCMgKXtYEryLE2erhKmDGkUfmEOW2vFX2OyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919b449b01d23272b03e77dc2818b778d435770aea1cb287e715b8f7cb156086","last_reissued_at":"2026-05-18T02:27:59.305757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:59.305757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Unary Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Subhash Kak","submitted_at":"2015-02-03T15:41:36Z","abstract_excerpt":"Extended variants of the recently introduced spread unary coding are described. These schemes, in which the length of the code word is fixed, allow representation of approximately n^2 numbers for n bits, rather than the n numbers of the standard unary coding. In the first of two proposed schemes the spread increases, whereas in the second scheme the spread remains constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00894","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":"1502.00894","created_at":"2026-05-18T02:27:59.305843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00894v1","created_at":"2026-05-18T02:27:59.305843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00894","created_at":"2026-05-18T02:27:59.305843+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGNUJGYB2IZH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGNUJGYB2IZHFMB6","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGNUJGYB","created_at":"2026-05-18T12:29:42.218222+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/SGNUJGYB2IZHFMB6O7OCQGFXPD","json":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD.json","graph_json":"https://pith.science/api/pith-number/SGNUJGYB2IZHFMB6O7OCQGFXPD/graph.json","events_json":"https://pith.science/api/pith-number/SGNUJGYB2IZHFMB6O7OCQGFXPD/events.json","paper":"https://pith.science/paper/SGNUJGYB"},"agent_actions":{"view_html":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD","download_json":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD.json","view_paper":"https://pith.science/paper/SGNUJGYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00894&json=true","fetch_graph":"https://pith.science/api/pith-number/SGNUJGYB2IZHFMB6O7OCQGFXPD/graph.json","fetch_events":"https://pith.science/api/pith-number/SGNUJGYB2IZHFMB6O7OCQGFXPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD/action/storage_attestation","attest_author":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD/action/author_attestation","sign_citation":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD/action/citation_signature","submit_replication":"https://pith.science/pith/SGNUJGYB2IZHFMB6O7OCQGFXPD/action/replication_record"}},"created_at":"2026-05-18T02:27:59.305843+00:00","updated_at":"2026-05-18T02:27:59.305843+00:00"}