{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:3UQMPNPUEU3UGOQMGNYCL52SQS","short_pith_number":"pith:3UQMPNPU","schema_version":"1.0","canonical_sha256":"dd20c7b5f42537433a0c337025f75284939f729c00cd7936f874e38e37f7bb8b","source":{"kind":"arxiv","id":"math/0509521","version":2},"attestation_state":"computed","paper":{"title":"Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonas Sjostrand","submitted_at":"2005-09-22T15:44:57Z","abstract_excerpt":"The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger:\n  There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2.\n  We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice paths."},"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":"math/0509521","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-09-22T15:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"a821c4a4ebc7069266a840fb890c0bd9aab35afb4108283508c3a99662a3da76","abstract_canon_sha256":"4117a095d00ae456afa87d03d802489298ec8bd860278635f98b7883c8145f60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:23.115502Z","signature_b64":"fKJborEV4+zubkgjtx3JLjdzYmouXdjv7TvtzFdaDmq5u+VFbHLQ46/LsOowOW8DQMU+JNLHsY8zUVdxAcg7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd20c7b5f42537433a0c337025f75284939f729c00cd7936f874e38e37f7bb8b","last_reissued_at":"2026-05-18T01:05:23.114857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:23.114857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonas Sjostrand","submitted_at":"2005-09-22T15:44:57Z","abstract_excerpt":"The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger:\n  There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2.\n  We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0509521","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0509521","created_at":"2026-05-18T01:05:23.114952+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0509521v2","created_at":"2026-05-18T01:05:23.114952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0509521","created_at":"2026-05-18T01:05:23.114952+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UQMPNPUEU3U","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UQMPNPUEU3UGOQM","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UQMPNPU","created_at":"2026-05-18T12:25:52.687210+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/3UQMPNPUEU3UGOQMGNYCL52SQS","json":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS.json","graph_json":"https://pith.science/api/pith-number/3UQMPNPUEU3UGOQMGNYCL52SQS/graph.json","events_json":"https://pith.science/api/pith-number/3UQMPNPUEU3UGOQMGNYCL52SQS/events.json","paper":"https://pith.science/paper/3UQMPNPU"},"agent_actions":{"view_html":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS","download_json":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS.json","view_paper":"https://pith.science/paper/3UQMPNPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0509521&json=true","fetch_graph":"https://pith.science/api/pith-number/3UQMPNPUEU3UGOQMGNYCL52SQS/graph.json","fetch_events":"https://pith.science/api/pith-number/3UQMPNPUEU3UGOQMGNYCL52SQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS/action/storage_attestation","attest_author":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS/action/author_attestation","sign_citation":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS/action/citation_signature","submit_replication":"https://pith.science/pith/3UQMPNPUEU3UGOQMGNYCL52SQS/action/replication_record"}},"created_at":"2026-05-18T01:05:23.114952+00:00","updated_at":"2026-05-18T01:05:23.114952+00:00"}