{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OYTIA5LSSRAU3XMBJK4GJDWBY4","short_pith_number":"pith:OYTIA5LS","schema_version":"1.0","canonical_sha256":"762680757294414ddd814ab8648ec1c72282ffee40971c17e6ce6f7baaef97f3","source":{"kind":"arxiv","id":"1306.1860","version":1},"attestation_state":"computed","paper":{"title":"A Solution of Simultaneous Recurrences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mark Korenblit, Vadim E. Levit","submitted_at":"2013-06-08T00:26:08Z","abstract_excerpt":"The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their decomposition to matrix recurrences of order two."},"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":"1306.1860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-08T00:26:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2cba5be853a42ef89153dd29913a960df60578a0c8e48446ed0f5e9dab1b6ab1","abstract_canon_sha256":"199cd0ed05928af08864bab9f1591cf0f141b7b07c908beb5bbc28f9f351895e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.062289Z","signature_b64":"zLXFC6G6TonUWGAuWbSQ3AO2GbWZbbWyBnyRwFFYEkeJhaZNMsQIdo61UZPwBHnvij+tPNVJJ0mMdjWvfJ7cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762680757294414ddd814ab8648ec1c72282ffee40971c17e6ce6f7baaef97f3","last_reissued_at":"2026-05-18T03:21:23.061598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.061598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Solution of Simultaneous Recurrences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mark Korenblit, Vadim E. Levit","submitted_at":"2013-06-08T00:26:08Z","abstract_excerpt":"The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their decomposition to matrix recurrences of order two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1860","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":"1306.1860","created_at":"2026-05-18T03:21:23.061722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1860v1","created_at":"2026-05-18T03:21:23.061722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1860","created_at":"2026-05-18T03:21:23.061722+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYTIA5LSSRAU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYTIA5LSSRAU3XMB","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYTIA5LS","created_at":"2026-05-18T12:27:54.935989+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/OYTIA5LSSRAU3XMBJK4GJDWBY4","json":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4.json","graph_json":"https://pith.science/api/pith-number/OYTIA5LSSRAU3XMBJK4GJDWBY4/graph.json","events_json":"https://pith.science/api/pith-number/OYTIA5LSSRAU3XMBJK4GJDWBY4/events.json","paper":"https://pith.science/paper/OYTIA5LS"},"agent_actions":{"view_html":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4","download_json":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4.json","view_paper":"https://pith.science/paper/OYTIA5LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1860&json=true","fetch_graph":"https://pith.science/api/pith-number/OYTIA5LSSRAU3XMBJK4GJDWBY4/graph.json","fetch_events":"https://pith.science/api/pith-number/OYTIA5LSSRAU3XMBJK4GJDWBY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4/action/storage_attestation","attest_author":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4/action/author_attestation","sign_citation":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4/action/citation_signature","submit_replication":"https://pith.science/pith/OYTIA5LSSRAU3XMBJK4GJDWBY4/action/replication_record"}},"created_at":"2026-05-18T03:21:23.061722+00:00","updated_at":"2026-05-18T03:21:23.061722+00:00"}