{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5NE7R5AATYWHBONTCBUNPHKAXO","short_pith_number":"pith:5NE7R5AA","schema_version":"1.0","canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","source":{"kind":"arxiv","id":"1906.05590","version":1},"attestation_state":"computed","paper":{"title":"On discrete idempotent paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"math.LO","authors_text":"Luigi Santocanale (LIS)","submitted_at":"2019-06-13T10:33:05Z","abstract_excerpt":"The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps from the chain { 0, 1,. .. , n } to itself. We explicitly describe this monoid structure and, relying on a general characterization of idempotent join-continuous maps from a complete lattice to itself, we characterize idempotent paths as upper zigzag paths. We argue that these paths are counted by the odd Fibonacci numbers. Our method yields a geometric/com"},"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":"1906.05590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-06-13T10:33:05Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"7b906e076e339577ae362c337719d8fdfae6a3b79258b465249778de18d8cea9","abstract_canon_sha256":"e32e6cb21cd71eaa17e75f9628f7a19e6237342daa53242076adf199cb6a6c6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:24.857357Z","signature_b64":"WYAWPSacfDDyvgqWpSdOqB2G3+8mgt4lHlh3OplJIozRQlBbCkV57q8JGB/MbT5XYxQPyzOrpyBIQzV3oBHVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","last_reissued_at":"2026-05-17T23:43:24.856871Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:24.856871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On discrete idempotent paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"math.LO","authors_text":"Luigi Santocanale (LIS)","submitted_at":"2019-06-13T10:33:05Z","abstract_excerpt":"The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps from the chain { 0, 1,. .. , n } to itself. We explicitly describe this monoid structure and, relying on a general characterization of idempotent join-continuous maps from a complete lattice to itself, we characterize idempotent paths as upper zigzag paths. We argue that these paths are counted by the odd Fibonacci numbers. Our method yields a geometric/com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05590","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":"1906.05590","created_at":"2026-05-17T23:43:24.856949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05590v1","created_at":"2026-05-17T23:43:24.856949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05590","created_at":"2026-05-17T23:43:24.856949+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NE7R5AATYWH","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NE7R5AATYWHBONT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NE7R5AA","created_at":"2026-05-18T12:33:10.108867+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/5NE7R5AATYWHBONTCBUNPHKAXO","json":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO.json","graph_json":"https://pith.science/api/pith-number/5NE7R5AATYWHBONTCBUNPHKAXO/graph.json","events_json":"https://pith.science/api/pith-number/5NE7R5AATYWHBONTCBUNPHKAXO/events.json","paper":"https://pith.science/paper/5NE7R5AA"},"agent_actions":{"view_html":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO","download_json":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO.json","view_paper":"https://pith.science/paper/5NE7R5AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05590&json=true","fetch_graph":"https://pith.science/api/pith-number/5NE7R5AATYWHBONTCBUNPHKAXO/graph.json","fetch_events":"https://pith.science/api/pith-number/5NE7R5AATYWHBONTCBUNPHKAXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/action/storage_attestation","attest_author":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/action/author_attestation","sign_citation":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/action/citation_signature","submit_replication":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/action/replication_record"}},"created_at":"2026-05-17T23:43:24.856949+00:00","updated_at":"2026-05-17T23:43:24.856949+00:00"}