{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5NE7R5AATYWHBONTCBUNPHKAXO","short_pith_number":"pith:5NE7R5AA","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"},"canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","source":{"kind":"arxiv","id":"1906.05590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05590","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05590v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05590","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"5NE7R5AATYWH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5NE7R5AATYWHBONT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5NE7R5AA","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5NE7R5AATYWHBONTCBUNPHKAXO","target":"record","payload":{"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"},"canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","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"},"source_kind":"arxiv","source_id":"1906.05590","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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UF1oRSjy6fSYQpsjVEe67HxW4KKBJhGlCL/VSjMxfLZ3sov229McoPc7Sw1QHo+pjc7HdfmRTWr+x2+JepW5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:20:59.914231Z"},"content_sha256":"0489ea5dad435b4c3f62d5ddcfa8897a0fac74c9c738c5b71751c926e2e3f0c2","schema_version":"1.0","event_id":"sha256:0489ea5dad435b4c3f62d5ddcfa8897a0fac74c9c738c5b71751c926e2e3f0c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5NE7R5AATYWHBONTCBUNPHKAXO","target":"graph","payload":{"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"},"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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vI5TlilJYvozBs1OJIrI8uCTE+2ff0tY1PiQ025CGIVaGEXhsmYTmhVUlX8b497NIK+w+osmUpjBup0ieQtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:20:59.914597Z"},"content_sha256":"faf195c3a37364c7a1c6df71d2208f22a7b1e307b4cad70c9f8bb182864115ca","schema_version":"1.0","event_id":"sha256:faf195c3a37364c7a1c6df71d2208f22a7b1e307b4cad70c9f8bb182864115ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/bundle.json","state_url":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NE7R5AATYWHBONTCBUNPHKAXO/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-06-22T00:20:59Z","links":{"resolver":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO","bundle":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/bundle.json","state":"https://pith.science/pith/5NE7R5AATYWHBONTCBUNPHKAXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NE7R5AATYWHBONTCBUNPHKAXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5NE7R5AATYWHBONTCBUNPHKAXO","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":"e32e6cb21cd71eaa17e75f9628f7a19e6237342daa53242076adf199cb6a6c6c","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-06-13T10:33:05Z","title_canon_sha256":"7b906e076e339577ae362c337719d8fdfae6a3b79258b465249778de18d8cea9"},"schema_version":"1.0","source":{"id":"1906.05590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05590","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05590v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05590","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"5NE7R5AATYWH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5NE7R5AATYWHBONT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5NE7R5AA","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:faf195c3a37364c7a1c6df71d2208f22a7b1e307b4cad70c9f8bb182864115ca","target":"graph","created_at":"2026-05-17T23:43:24Z","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 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","authors_text":"Luigi Santocanale (LIS)","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-06-13T10:33:05Z","title":"On discrete idempotent paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05590","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:0489ea5dad435b4c3f62d5ddcfa8897a0fac74c9c738c5b71751c926e2e3f0c2","target":"record","created_at":"2026-05-17T23:43:24Z","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":"e32e6cb21cd71eaa17e75f9628f7a19e6237342daa53242076adf199cb6a6c6c","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-06-13T10:33:05Z","title_canon_sha256":"7b906e076e339577ae362c337719d8fdfae6a3b79258b465249778de18d8cea9"},"schema_version":"1.0","source":{"id":"1906.05590","kind":"arxiv","version":1}},"canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb49f8f4009e2c70b9b31068d79d40bb970b43ee8bb4996fd1a4d409585830da","first_computed_at":"2026-05-17T23:43:24.856871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:24.856871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYAWPSacfDDyvgqWpSdOqB2G3+8mgt4lHlh3OplJIozRQlBbCkV57q8JGB/MbT5XYxQPyzOrpyBIQzV3oBHVAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:24.857357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0489ea5dad435b4c3f62d5ddcfa8897a0fac74c9c738c5b71751c926e2e3f0c2","sha256:faf195c3a37364c7a1c6df71d2208f22a7b1e307b4cad70c9f8bb182864115ca"],"state_sha256":"1407d1e4671062456bd29da34f07013942d4f3565c4be6e82523ff1ff2780460"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4uzovF5+rWNtBUUsc5eSXv5Ect12MNHuRAGDzm3XwpB/3JZMugzfBIsWhFPUIXWJCbCc0J+/tlX03XcWllg5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T00:20:59.916541Z","bundle_sha256":"7e7431d736a4abcf9e76a7c158ec9e7988e1262a8c8f30e7f79e638e0911ccaf"}}