{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LLISXHK35TQL2E2CYTTDV35QFX","short_pith_number":"pith:LLISXHK3","schema_version":"1.0","canonical_sha256":"5ad12b9d5bece0bd1342c4e63aefb02dd64eb6d730abed89638af3c9019e8c95","source":{"kind":"arxiv","id":"2407.08203","version":3},"attestation_state":"computed","paper":{"title":"SL(2,Z)-matrixizations of generalized Markov numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO"],"primary_cat":"math.NT","authors_text":"Shuhei Maruyama, Yasuaki Gyoda, Yusuke Sato","submitted_at":"2024-07-11T06:02:27Z","abstract_excerpt":"For $k\\geq 0$, a $k$-generalized Markov number is an integer which appears in some positive integer solution to the $k$-generalized Markov equation $x^2 + y^2 + z^2 + k(yz + zx + xy) = (3 + 3k)xyz$. In this paper, we discuss a combinatorial structure of generalized Markov numbers. To investigate this structure in detail, we use two families of matrices: the $k$-generalized Cohn matrices and the $k$-Markov-monodromy matrices, which are elements of $SL(2, \\mathbb{Z})$ whose $(1,2)$-entries are $k$-generalized Markov numbers. We show that these two families of matrices recover the tree structure "},"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":"2407.08203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-07-11T06:02:27Z","cross_cats_sorted":["math.AG","math.CO"],"title_canon_sha256":"c3c3ae7ecffb972ad30e0751c57cd601a8c47d2404f7d290e083f136aa006cdb","abstract_canon_sha256":"56d0e404890da76fb60ebd612c13b590c305706e8d9035f64f76fb50d29784f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:08.086122Z","signature_b64":"BiulBsqsSotGAVT7SjRQ+NqQf7vfkubkfJRPaPb5PbAGYCt5pmTf96WkB3Sfura1DrJBJYGnlNr+k8kuCqlVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad12b9d5bece0bd1342c4e63aefb02dd64eb6d730abed89638af3c9019e8c95","last_reissued_at":"2026-07-05T10:25:08.085564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:08.085564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SL(2,Z)-matrixizations of generalized Markov numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO"],"primary_cat":"math.NT","authors_text":"Shuhei Maruyama, Yasuaki Gyoda, Yusuke Sato","submitted_at":"2024-07-11T06:02:27Z","abstract_excerpt":"For $k\\geq 0$, a $k$-generalized Markov number is an integer which appears in some positive integer solution to the $k$-generalized Markov equation $x^2 + y^2 + z^2 + k(yz + zx + xy) = (3 + 3k)xyz$. In this paper, we discuss a combinatorial structure of generalized Markov numbers. To investigate this structure in detail, we use two families of matrices: the $k$-generalized Cohn matrices and the $k$-Markov-monodromy matrices, which are elements of $SL(2, \\mathbb{Z})$ whose $(1,2)$-entries are $k$-generalized Markov numbers. We show that these two families of matrices recover the tree structure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08203","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.08203/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.08203","created_at":"2026-07-05T10:25:08.085625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08203v3","created_at":"2026-07-05T10:25:08.085625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08203","created_at":"2026-07-05T10:25:08.085625+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLISXHK35TQL","created_at":"2026-07-05T10:25:08.085625+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLISXHK35TQL2E2C","created_at":"2026-07-05T10:25:08.085625+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLISXHK3","created_at":"2026-07-05T10:25:08.085625+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26951","citing_title":"Words for generalized Markov numbers","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2512.04026","citing_title":"Orderings of k-Markov Numbers","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2512.04547","citing_title":"Generalized discrete Markov spectra","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX","json":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX.json","graph_json":"https://pith.science/api/pith-number/LLISXHK35TQL2E2CYTTDV35QFX/graph.json","events_json":"https://pith.science/api/pith-number/LLISXHK35TQL2E2CYTTDV35QFX/events.json","paper":"https://pith.science/paper/LLISXHK3"},"agent_actions":{"view_html":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX","download_json":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX.json","view_paper":"https://pith.science/paper/LLISXHK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08203&json=true","fetch_graph":"https://pith.science/api/pith-number/LLISXHK35TQL2E2CYTTDV35QFX/graph.json","fetch_events":"https://pith.science/api/pith-number/LLISXHK35TQL2E2CYTTDV35QFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX/action/storage_attestation","attest_author":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX/action/author_attestation","sign_citation":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX/action/citation_signature","submit_replication":"https://pith.science/pith/LLISXHK35TQL2E2CYTTDV35QFX/action/replication_record"}},"created_at":"2026-07-05T10:25:08.085625+00:00","updated_at":"2026-07-05T10:25:08.085625+00:00"}