{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ITY6LPPXAY5TITX22ET3WXZ3CV","short_pith_number":"pith:ITY6LPPX","canonical_record":{"source":{"id":"1611.03707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T14:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"f08f772f72bdb1841f93ca671f98897afac1c5ee772bb2da16ca3ee036b69613","abstract_canon_sha256":"525b830fc785a29d4bc3fb3f968e62c90568d151e4cd1d3892698c5c9ad02be3"},"schema_version":"1.0"},"canonical_sha256":"44f1e5bdf7063b344efad127bb5f3b1541df2e31d5663a0cda1ea0b22a708643","source":{"kind":"arxiv","id":"1611.03707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03707","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03707v2","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03707","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"ITY6LPPXAY5T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ITY6LPPXAY5TITX2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ITY6LPPX","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ITY6LPPXAY5TITX22ET3WXZ3CV","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T14:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"f08f772f72bdb1841f93ca671f98897afac1c5ee772bb2da16ca3ee036b69613","abstract_canon_sha256":"525b830fc785a29d4bc3fb3f968e62c90568d151e4cd1d3892698c5c9ad02be3"},"schema_version":"1.0"},"canonical_sha256":"44f1e5bdf7063b344efad127bb5f3b1541df2e31d5663a0cda1ea0b22a708643","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:23.366046Z","signature_b64":"+QL6rtnZhlsTnEJmqPo0l2X00Eg8w2nkcJ0TBNiONInQcm+jkbaxpxtpsDq1Yvk9UbhFYWrnwmqNWr1kgEwYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f1e5bdf7063b344efad127bb5f3b1541df2e31d5663a0cda1ea0b22a708643","last_reissued_at":"2026-05-18T00:49:23.365469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:23.365469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03707","source_version":2,"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-18T00:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAo2o7KdGiPeI+9rlN08k6CTUGbOW8Kxk6/KfHleVJpzwOLQE3DU2RNTdfVATeQu1fIq/v0f9aEud3GGVTaMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:43:29.467528Z"},"content_sha256":"180f057275e705e142c44b3e11020eb6b47d197382ff5b018f53ac5a9a30bc5a","schema_version":"1.0","event_id":"sha256:180f057275e705e142c44b3e11020eb6b47d197382ff5b018f53ac5a9a30bc5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ITY6LPPXAY5TITX22ET3WXZ3CV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of parking functions with center of a given length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Guedes de Oliveira, Rui Duarte","submitted_at":"2016-11-11T14:06:20Z","abstract_excerpt":"Let $1\\leq r\\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property. We count the number of elements of $R$.\n  For this purpose, we first consider a bijection, due to Parkinson, Yang and Yu, that maps $R$ onto the set of parking function with center (defined by the authors in a previous article) of size $r$. A second bijection maps this set onto the set of parking functions with run $r$, a property that we introduce here. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03707","kind":"arxiv","version":2},"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-18T00:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPjPMKkGs6Y2kbtfWyQRX7+6+f66e9mNdu0nYtMjaE11mayUHFPDvDC7o6I9cBlMrb3wz8vnKdNEWWbvedYKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:43:29.467860Z"},"content_sha256":"84a716060920b534abf1a5204ea205dd606d7f29be70e4e1c15815b7d87459b5","schema_version":"1.0","event_id":"sha256:84a716060920b534abf1a5204ea205dd606d7f29be70e4e1c15815b7d87459b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/bundle.json","state_url":"https://pith.science/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/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-22T22:43:29Z","links":{"resolver":"https://pith.science/pith/ITY6LPPXAY5TITX22ET3WXZ3CV","bundle":"https://pith.science/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/bundle.json","state":"https://pith.science/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITY6LPPXAY5TITX22ET3WXZ3CV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ITY6LPPXAY5TITX22ET3WXZ3CV","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":"525b830fc785a29d4bc3fb3f968e62c90568d151e4cd1d3892698c5c9ad02be3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T14:06:20Z","title_canon_sha256":"f08f772f72bdb1841f93ca671f98897afac1c5ee772bb2da16ca3ee036b69613"},"schema_version":"1.0","source":{"id":"1611.03707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03707","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03707v2","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03707","created_at":"2026-05-18T00:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"ITY6LPPXAY5T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ITY6LPPXAY5TITX2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ITY6LPPX","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:84a716060920b534abf1a5204ea205dd606d7f29be70e4e1c15815b7d87459b5","target":"graph","created_at":"2026-05-18T00:49:23Z","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":"Let $1\\leq r\\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property. We count the number of elements of $R$.\n  For this purpose, we first consider a bijection, due to Parkinson, Yang and Yu, that maps $R$ onto the set of parking function with center (defined by the authors in a previous article) of size $r$. A second bijection maps this set onto the set of parking functions with run $r$, a property that we introduce here. We ","authors_text":"Ant\\'onio Guedes de Oliveira, Rui Duarte","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T14:06:20Z","title":"The number of parking functions with center of a given length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03707","kind":"arxiv","version":2},"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:180f057275e705e142c44b3e11020eb6b47d197382ff5b018f53ac5a9a30bc5a","target":"record","created_at":"2026-05-18T00:49:23Z","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":"525b830fc785a29d4bc3fb3f968e62c90568d151e4cd1d3892698c5c9ad02be3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T14:06:20Z","title_canon_sha256":"f08f772f72bdb1841f93ca671f98897afac1c5ee772bb2da16ca3ee036b69613"},"schema_version":"1.0","source":{"id":"1611.03707","kind":"arxiv","version":2}},"canonical_sha256":"44f1e5bdf7063b344efad127bb5f3b1541df2e31d5663a0cda1ea0b22a708643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f1e5bdf7063b344efad127bb5f3b1541df2e31d5663a0cda1ea0b22a708643","first_computed_at":"2026-05-18T00:49:23.365469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:23.365469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+QL6rtnZhlsTnEJmqPo0l2X00Eg8w2nkcJ0TBNiONInQcm+jkbaxpxtpsDq1Yvk9UbhFYWrnwmqNWr1kgEwYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:23.366046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:180f057275e705e142c44b3e11020eb6b47d197382ff5b018f53ac5a9a30bc5a","sha256:84a716060920b534abf1a5204ea205dd606d7f29be70e4e1c15815b7d87459b5"],"state_sha256":"a6f2f14c295a03421e2df5c55948872d283c9d9553a6dbbf19bb978f25c14f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaOnAT7N5FyvAAjKcBAOfjPexJvUtDiKsg6VMgwJNw/bWvyWjt0XrMvkOPe1sx1lhZ9nt3dDh+kbURNL979pCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:43:29.470160Z","bundle_sha256":"3557c3a2d44ba9a0e8ede05a7ded80555be5bc0520a95e9537c19e56c879122c"}}