{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T4C6WDM32IOJZS7IGIEHCXI2JX","short_pith_number":"pith:T4C6WDM3","schema_version":"1.0","canonical_sha256":"9f05eb0d9bd21c9ccbe83208715d1a4dec8802f9616c4bd504daea350baad257","source":{"kind":"arxiv","id":"1603.09487","version":1},"attestation_state":"computed","paper":{"title":"Rectangular Schroder Parking Functions Combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francois Bergeron, Jean-Christophe Aval","submitted_at":"2016-03-31T08:32:20Z","abstract_excerpt":"We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of (m,n)-parking functions, and associated (q,t)-analogs."},"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":"1603.09487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-31T08:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"69f8f1294f088c71f5f9f3e679b5b4da9b471e8a75354ba866556750418b547c","abstract_canon_sha256":"99e4230fa5c626e3a6012ce9d62c622e82b62311230a8c3b79e45e358a497e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.485285Z","signature_b64":"RdAynyaJ42Wx7HUWoSWxpxdlYO/qC4CBDu07eMJ33k5vyuFoFx1Mph6xDnkaYBwZj66K9IsQGNmIWCsYfQ6qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f05eb0d9bd21c9ccbe83208715d1a4dec8802f9616c4bd504daea350baad257","last_reissued_at":"2026-05-18T01:17:58.484638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.484638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rectangular Schroder Parking Functions Combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francois Bergeron, Jean-Christophe Aval","submitted_at":"2016-03-31T08:32:20Z","abstract_excerpt":"We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of (m,n)-parking functions, and associated (q,t)-analogs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09487","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":"1603.09487","created_at":"2026-05-18T01:17:58.484728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09487v1","created_at":"2026-05-18T01:17:58.484728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09487","created_at":"2026-05-18T01:17:58.484728+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4C6WDM32IOJ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4C6WDM32IOJZS7I","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4C6WDM3","created_at":"2026-05-18T12:30:44.179134+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/T4C6WDM32IOJZS7IGIEHCXI2JX","json":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX.json","graph_json":"https://pith.science/api/pith-number/T4C6WDM32IOJZS7IGIEHCXI2JX/graph.json","events_json":"https://pith.science/api/pith-number/T4C6WDM32IOJZS7IGIEHCXI2JX/events.json","paper":"https://pith.science/paper/T4C6WDM3"},"agent_actions":{"view_html":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX","download_json":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX.json","view_paper":"https://pith.science/paper/T4C6WDM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09487&json=true","fetch_graph":"https://pith.science/api/pith-number/T4C6WDM32IOJZS7IGIEHCXI2JX/graph.json","fetch_events":"https://pith.science/api/pith-number/T4C6WDM32IOJZS7IGIEHCXI2JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX/action/storage_attestation","attest_author":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX/action/author_attestation","sign_citation":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX/action/citation_signature","submit_replication":"https://pith.science/pith/T4C6WDM32IOJZS7IGIEHCXI2JX/action/replication_record"}},"created_at":"2026-05-18T01:17:58.484728+00:00","updated_at":"2026-05-18T01:17:58.484728+00:00"}