{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LJNFALK2HI5EDNV3DJCFKMR6UK","short_pith_number":"pith:LJNFALK2","canonical_record":{"source":{"id":"2012.06379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-11T14:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"4bfafe7d9095cefdeeab86ee0dc96bdc3cc18bf03519ce0ea9db4bab34258b64","abstract_canon_sha256":"c537e9f8f05e3b5820ba399ac9d3a8fcd7eeb95187cc936ee5c39295026f6256"},"schema_version":"1.0"},"canonical_sha256":"5a5a502d5a3a3a41b6bb1a4455323ea29e6e1602017db340618f07676d775a1f","source":{"kind":"arxiv","id":"2012.06379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06379","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06379v1","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06379","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"LJNFALK2HI5E","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_16","alias_value":"LJNFALK2HI5EDNV3","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_8","alias_value":"LJNFALK2","created_at":"2026-07-05T01:58:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LJNFALK2HI5EDNV3DJCFKMR6UK","target":"record","payload":{"canonical_record":{"source":{"id":"2012.06379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-11T14:27:11Z","cross_cats_sorted":[],"title_canon_sha256":"4bfafe7d9095cefdeeab86ee0dc96bdc3cc18bf03519ce0ea9db4bab34258b64","abstract_canon_sha256":"c537e9f8f05e3b5820ba399ac9d3a8fcd7eeb95187cc936ee5c39295026f6256"},"schema_version":"1.0"},"canonical_sha256":"5a5a502d5a3a3a41b6bb1a4455323ea29e6e1602017db340618f07676d775a1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:50.992873Z","signature_b64":"hRatj8TCgD3MTaoY52p6xo/IiIcqUP6XLbnCK3GHz5SvxqnN3Vkhy1XhZNOxBnpEdRk91YwSVtOaZU++ARgAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a5a502d5a3a3a41b6bb1a4455323ea29e6e1602017db340618f07676d775a1f","last_reissued_at":"2026-07-05T01:58:50.992412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:50.992412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.06379","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-07-05T01:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KiGZQblIGv7DpURwj1dnxl6eT9SjHcvcXD3iB8/cIGekhucxW0aVzHKNe6mwymsIyegbSWwAfGJ8x/WpZFaaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:20:35.124295Z"},"content_sha256":"f2bf7a935b185f989cc4656409b3caa21b917b91072b7d14e82b2322700429c1","schema_version":"1.0","event_id":"sha256:f2bf7a935b185f989cc4656409b3caa21b917b91072b7d14e82b2322700429c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LJNFALK2HI5EDNV3DJCFKMR6UK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of paths in Young--Fibonacci graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vsevolod Evtushevsky","submitted_at":"2020-12-11T14:27:11Z","abstract_excerpt":"The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the number of paths between two vertices of the Young--Fibonacci graph which is polynomial with respect to the minimum of their ranks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.06379/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"},"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-07-05T01:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVno3KBCdxsioqcvRy1vRo353GOQ1+AkNr7crih0F+78t5NHWEhyokecUaygKWe1Ih7gjA8dda54rpjX9rStAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:20:35.124794Z"},"content_sha256":"b419a76e6602dc280e1b54a7d047b00c616e2456b0d85228d753c5664a9ca41c","schema_version":"1.0","event_id":"sha256:b419a76e6602dc280e1b54a7d047b00c616e2456b0d85228d753c5664a9ca41c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/bundle.json","state_url":"https://pith.science/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/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-13T12:20:35Z","links":{"resolver":"https://pith.science/pith/LJNFALK2HI5EDNV3DJCFKMR6UK","bundle":"https://pith.science/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/bundle.json","state":"https://pith.science/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJNFALK2HI5EDNV3DJCFKMR6UK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LJNFALK2HI5EDNV3DJCFKMR6UK","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":"c537e9f8f05e3b5820ba399ac9d3a8fcd7eeb95187cc936ee5c39295026f6256","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-11T14:27:11Z","title_canon_sha256":"4bfafe7d9095cefdeeab86ee0dc96bdc3cc18bf03519ce0ea9db4bab34258b64"},"schema_version":"1.0","source":{"id":"2012.06379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06379","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06379v1","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06379","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"LJNFALK2HI5E","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_16","alias_value":"LJNFALK2HI5EDNV3","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_8","alias_value":"LJNFALK2","created_at":"2026-07-05T01:58:50Z"}],"graph_snapshots":[{"event_id":"sha256:b419a76e6602dc280e1b54a7d047b00c616e2456b0d85228d753c5664a9ca41c","target":"graph","created_at":"2026-07-05T01:58:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.06379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the number of paths between two vertices of the Young--Fibonacci graph which is polynomial with respect to the minimum of their ranks.","authors_text":"Vsevolod Evtushevsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-11T14:27:11Z","title":"Enumeration of paths in Young--Fibonacci graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06379","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:f2bf7a935b185f989cc4656409b3caa21b917b91072b7d14e82b2322700429c1","target":"record","created_at":"2026-07-05T01:58:50Z","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":"c537e9f8f05e3b5820ba399ac9d3a8fcd7eeb95187cc936ee5c39295026f6256","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-11T14:27:11Z","title_canon_sha256":"4bfafe7d9095cefdeeab86ee0dc96bdc3cc18bf03519ce0ea9db4bab34258b64"},"schema_version":"1.0","source":{"id":"2012.06379","kind":"arxiv","version":1}},"canonical_sha256":"5a5a502d5a3a3a41b6bb1a4455323ea29e6e1602017db340618f07676d775a1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a5a502d5a3a3a41b6bb1a4455323ea29e6e1602017db340618f07676d775a1f","first_computed_at":"2026-07-05T01:58:50.992412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:50.992412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hRatj8TCgD3MTaoY52p6xo/IiIcqUP6XLbnCK3GHz5SvxqnN3Vkhy1XhZNOxBnpEdRk91YwSVtOaZU++ARgAAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:50.992873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.06379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2bf7a935b185f989cc4656409b3caa21b917b91072b7d14e82b2322700429c1","sha256:b419a76e6602dc280e1b54a7d047b00c616e2456b0d85228d753c5664a9ca41c"],"state_sha256":"72fdead4bd0970f0c045e8d3a611b025ba23b7a141e1910f5e252ccaa004b541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"es+IK+fWmRfjltdPD5fgS1tsuiEbSL4Jsp1eWjSPAYM7NuL3XyCLoM03nRgU5f6zq9wu0+5b3d40LT1BxlQtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T12:20:35.128761Z","bundle_sha256":"4fc60d54f3058e646b02589580710d4ec616bede4d1dc27d2b94c037e6b5218e"}}