{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6AMICNR7ORLPF3N275OKXJBFNE","short_pith_number":"pith:6AMICNR7","canonical_record":{"source":{"id":"1904.03789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2019-04-08T01:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"09077de110e07aa6d6a9afd30155187658de76a9a1c7953e7b869ffffb626375","abstract_canon_sha256":"7e5e5249f746f3f0d5f51f0e83e9dec9a60740d9b7e26f3647d021e66431376c"},"schema_version":"1.0"},"canonical_sha256":"f01881363f7456f2edbaff5caba42569352d3410fba68e9d24540ec0efc545f1","source":{"kind":"arxiv","id":"1904.03789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03789","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03789v1","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03789","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"6AMICNR7ORLP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AMICNR7ORLPF3N2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AMICNR7","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6AMICNR7ORLPF3N275OKXJBFNE","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2019-04-08T01:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"09077de110e07aa6d6a9afd30155187658de76a9a1c7953e7b869ffffb626375","abstract_canon_sha256":"7e5e5249f746f3f0d5f51f0e83e9dec9a60740d9b7e26f3647d021e66431376c"},"schema_version":"1.0"},"canonical_sha256":"f01881363f7456f2edbaff5caba42569352d3410fba68e9d24540ec0efc545f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.139401Z","signature_b64":"KqxMaRV3SM/dHqZMdfGhIhv7E8ZOzbETm2CZjshQtX2kTa+TV7OooEExzgTvVqxrtN9LJleWbIU7+6kPEvjzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01881363f7456f2edbaff5caba42569352d3410fba68e9d24540ec0efc545f1","last_reissued_at":"2026-05-17T23:49:08.138853Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.138853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03789","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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+CB4JEDV4iHl/wG3viU2CcTPLnf1uk8PIbtHjWX5u5Vxnzr6QLaBA+zo39rAik0rySNe2sKw5aH+D1ixFvyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:45:00.565786Z"},"content_sha256":"e2c8de78cde5e8e37b89179a7e51addbb028599ee3f16012e0ba0ad1665ff9bb","schema_version":"1.0","event_id":"sha256:e2c8de78cde5e8e37b89179a7e51addbb028599ee3f16012e0ba0ad1665ff9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6AMICNR7ORLPF3N275OKXJBFNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical Sturmian sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Alexei Zhedanov","submitted_at":"2019-04-08T01:05:29Z","abstract_excerpt":"The Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the polynomial $P(x)$. This algorithm can be exploited in order to find the number of roots of the polynomial $P(x)$ inside a given interval. We consider the \"inverse\" problem: what is the explicit system of orthogonal polynomials generated by the prescribed grid $x_s$ of \"classical\" type. The main results are the following. The generic linear grid generates a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03789","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-17T23:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7H9s33ldlyzGBg9S3X1gdC2/SN6upQDEiDFv7R/OYqI7kOUGQp4KKImF2HK6lU3k/4ygtuCyW77p9SPLVvlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:45:00.566297Z"},"content_sha256":"1274b383efe204b14499b5387390b526e8e0759f7a7c423693771e076e0364d7","schema_version":"1.0","event_id":"sha256:1274b383efe204b14499b5387390b526e8e0759f7a7c423693771e076e0364d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AMICNR7ORLPF3N275OKXJBFNE/bundle.json","state_url":"https://pith.science/pith/6AMICNR7ORLPF3N275OKXJBFNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AMICNR7ORLPF3N275OKXJBFNE/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-08-09T05:45:00Z","links":{"resolver":"https://pith.science/pith/6AMICNR7ORLPF3N275OKXJBFNE","bundle":"https://pith.science/pith/6AMICNR7ORLPF3N275OKXJBFNE/bundle.json","state":"https://pith.science/pith/6AMICNR7ORLPF3N275OKXJBFNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AMICNR7ORLPF3N275OKXJBFNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6AMICNR7ORLPF3N275OKXJBFNE","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":"7e5e5249f746f3f0d5f51f0e83e9dec9a60740d9b7e26f3647d021e66431376c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2019-04-08T01:05:29Z","title_canon_sha256":"09077de110e07aa6d6a9afd30155187658de76a9a1c7953e7b869ffffb626375"},"schema_version":"1.0","source":{"id":"1904.03789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03789","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03789v1","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03789","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"6AMICNR7ORLP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AMICNR7ORLPF3N2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AMICNR7","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:1274b383efe204b14499b5387390b526e8e0759f7a7c423693771e076e0364d7","target":"graph","created_at":"2026-05-17T23:49:08Z","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 Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the polynomial $P(x)$. This algorithm can be exploited in order to find the number of roots of the polynomial $P(x)$ inside a given interval. We consider the \"inverse\" problem: what is the explicit system of orthogonal polynomials generated by the prescribed grid $x_s$ of \"classical\" type. The main results are the following. The generic linear grid generates a ","authors_text":"Alexei Zhedanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2019-04-08T01:05:29Z","title":"Classical Sturmian sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03789","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:e2c8de78cde5e8e37b89179a7e51addbb028599ee3f16012e0ba0ad1665ff9bb","target":"record","created_at":"2026-05-17T23:49:08Z","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":"7e5e5249f746f3f0d5f51f0e83e9dec9a60740d9b7e26f3647d021e66431376c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2019-04-08T01:05:29Z","title_canon_sha256":"09077de110e07aa6d6a9afd30155187658de76a9a1c7953e7b869ffffb626375"},"schema_version":"1.0","source":{"id":"1904.03789","kind":"arxiv","version":1}},"canonical_sha256":"f01881363f7456f2edbaff5caba42569352d3410fba68e9d24540ec0efc545f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f01881363f7456f2edbaff5caba42569352d3410fba68e9d24540ec0efc545f1","first_computed_at":"2026-05-17T23:49:08.138853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.138853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqxMaRV3SM/dHqZMdfGhIhv7E8ZOzbETm2CZjshQtX2kTa+TV7OooEExzgTvVqxrtN9LJleWbIU7+6kPEvjzDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.139401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2c8de78cde5e8e37b89179a7e51addbb028599ee3f16012e0ba0ad1665ff9bb","sha256:1274b383efe204b14499b5387390b526e8e0759f7a7c423693771e076e0364d7"],"state_sha256":"04cafbd3668cbbaff630e39093eeff3490eaa9f1f2b66738624f1bdcfd0acbd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQl32tDD2gUG1pkG/3ky/tzr5wnpMaIr64l4ARjln96HeCkpiHeY0ACFWWzjzYtZRdocfl57YiXzbuzgr1bIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:45:00.570959Z","bundle_sha256":"77b0ffc508eb6115afff5a5f8866b827f339a6c6c82b0f5bc0cee890ec3c08f2"}}