{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FEJLUJ2TRHLQRGFVGUNJSNZBJL","short_pith_number":"pith:FEJLUJ2T","canonical_record":{"source":{"id":"1506.02944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-06-05T12:13:11Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"800f15a6117a7352f76e7dfd0146d6b18e0a72728bc2656f0dd308e23fba8ca2","abstract_canon_sha256":"0d06fb1c1c1e078a6aa1c2ce004acbfd872534d4940b49fb65bfa98e260b26e6"},"schema_version":"1.0"},"canonical_sha256":"2912ba275389d70898b5351a9937214af869a338d19dbbc841e4f7d1d52a4882","source":{"kind":"arxiv","id":"1506.02944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02944","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02944v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02944","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"FEJLUJ2TRHLQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FEJLUJ2TRHLQRGFV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FEJLUJ2T","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FEJLUJ2TRHLQRGFVGUNJSNZBJL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-06-05T12:13:11Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"800f15a6117a7352f76e7dfd0146d6b18e0a72728bc2656f0dd308e23fba8ca2","abstract_canon_sha256":"0d06fb1c1c1e078a6aa1c2ce004acbfd872534d4940b49fb65bfa98e260b26e6"},"schema_version":"1.0"},"canonical_sha256":"2912ba275389d70898b5351a9937214af869a338d19dbbc841e4f7d1d52a4882","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.445232Z","signature_b64":"hzEraiOQ5dzAAS28taWf/D3+wZ+gVmOQ4YahjSt3tYeVl311mCrf9WHMaw27GwmqbqNpptQd/6GNKlD3nBHtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2912ba275389d70898b5351a9937214af869a338d19dbbc841e4f7d1d52a4882","last_reissued_at":"2026-05-18T01:55:40.444543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.444543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02944","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRVpeXjknfe9SBSfOI07mO0mW8is9EbImGwRWUoebxiUj0YxW/x0fbhvVx5EtdXxCAU5yj5V2POzvxk92IDHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:33.821145Z"},"content_sha256":"e9db739a539cfd45c85e52c0b82df4765f32085c32fdc82170856a4aa0371753","schema_version":"1.0","event_id":"sha256:e9db739a539cfd45c85e52c0b82df4765f32085c32fdc82170856a4aa0371753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FEJLUJ2TRHLQRGFVGUNJSNZBJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear discrete multitime multiple recurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.DS","authors_text":"Constantin Udriste, Cristian Ghiu, Raluca Tuliga","submitted_at":"2015-06-05T12:13:11Z","abstract_excerpt":"The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is why, the aim of our paper is to formulate and solve problems concerning nonautonomous multitime multiple recurrence equations. Among other things, we discuss in detail the cases of linear recurrences with constant coefficients, highlighting in particular the theorems of existence and uniqueness of solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02944","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wtw6NAHYVInNn5zRu3vZc/DFMFdeEjWc7+C5eUcyrsdUF0zOXkrbbdOMk/TRu5mTdGiNzcss4fHHVlOTHKaXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:33.821819Z"},"content_sha256":"2f742a8f7a674b014add2d8e5086eb68b2eca9424cf8d018e3d6bb4f827236d2","schema_version":"1.0","event_id":"sha256:2f742a8f7a674b014add2d8e5086eb68b2eca9424cf8d018e3d6bb4f827236d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/bundle.json","state_url":"https://pith.science/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T11:51:33Z","links":{"resolver":"https://pith.science/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL","bundle":"https://pith.science/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/bundle.json","state":"https://pith.science/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEJLUJ2TRHLQRGFVGUNJSNZBJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FEJLUJ2TRHLQRGFVGUNJSNZBJL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0d06fb1c1c1e078a6aa1c2ce004acbfd872534d4940b49fb65bfa98e260b26e6","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-06-05T12:13:11Z","title_canon_sha256":"800f15a6117a7352f76e7dfd0146d6b18e0a72728bc2656f0dd308e23fba8ca2"},"schema_version":"1.0","source":{"id":"1506.02944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02944","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02944v1","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02944","created_at":"2026-05-18T01:55:40Z"},{"alias_kind":"pith_short_12","alias_value":"FEJLUJ2TRHLQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FEJLUJ2TRHLQRGFV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FEJLUJ2T","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:2f742a8f7a674b014add2d8e5086eb68b2eca9424cf8d018e3d6bb4f827236d2","target":"graph","created_at":"2026-05-18T01:55:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is why, the aim of our paper is to formulate and solve problems concerning nonautonomous multitime multiple recurrence equations. Among other things, we discuss in detail the cases of linear recurrences with constant coefficients, highlighting in particular the theorems of existence and uniqueness of solutions.","authors_text":"Constantin Udriste, Cristian Ghiu, Raluca Tuliga","cross_cats":["math.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-06-05T12:13:11Z","title":"Linear discrete multitime multiple recurrence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02944","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e9db739a539cfd45c85e52c0b82df4765f32085c32fdc82170856a4aa0371753","target":"record","created_at":"2026-05-18T01:55:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0d06fb1c1c1e078a6aa1c2ce004acbfd872534d4940b49fb65bfa98e260b26e6","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-06-05T12:13:11Z","title_canon_sha256":"800f15a6117a7352f76e7dfd0146d6b18e0a72728bc2656f0dd308e23fba8ca2"},"schema_version":"1.0","source":{"id":"1506.02944","kind":"arxiv","version":1}},"canonical_sha256":"2912ba275389d70898b5351a9937214af869a338d19dbbc841e4f7d1d52a4882","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2912ba275389d70898b5351a9937214af869a338d19dbbc841e4f7d1d52a4882","first_computed_at":"2026-05-18T01:55:40.444543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:40.444543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hzEraiOQ5dzAAS28taWf/D3+wZ+gVmOQ4YahjSt3tYeVl311mCrf9WHMaw27GwmqbqNpptQd/6GNKlD3nBHtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:40.445232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9db739a539cfd45c85e52c0b82df4765f32085c32fdc82170856a4aa0371753","sha256:2f742a8f7a674b014add2d8e5086eb68b2eca9424cf8d018e3d6bb4f827236d2"],"state_sha256":"b716475f2bb148769db6d805d7971e8e2b06b6b58c9cddebef8dd2d86272032d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYN158MDGQPlTlQRp9zc1A5qr+YrlPQW5IEC4g4HLscPy5Y4A1OTATt3JBGVZuWhQj4+0NKJ+Y0bczJGXF7PAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:33.825359Z","bundle_sha256":"60d6bbea9f95feb87689078929adc44d9f2fee1fc5642549aa24a9e23d51ece8"}}