{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LHMPHLCVH6WIEV2J2H5MSJRWSR","short_pith_number":"pith:LHMPHLCV","schema_version":"1.0","canonical_sha256":"59d8f3ac553fac825749d1fac9263694499b3cb7dceec6cf951f4e967f9eb2a9","source":{"kind":"arxiv","id":"1404.4889","version":2},"attestation_state":"computed","paper":{"title":"A simpler formula for the number of diagonal inversions of an (m,n)-Parking Function and a returning Fermionic formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Hicks, Emily Leven","submitted_at":"2014-04-18T21:16:25Z","abstract_excerpt":"Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has been defined using a complicated generalization of the dinv statistic which is composed of three parts and which is not obviously non-negative. Here we simplify the definition of dinv, prove that it is always non-negative, and give a geometric description of the statistic in the style of the classical case. We go on to show that in the n x (n+1) lattice, parki"},"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":"1404.4889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-18T21:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"d59f851b423c65a06dedef1d7f40fe3d3b45a667c572fee800625f02312ae099","abstract_canon_sha256":"2c5feb806027cd393e44ad5dfdeb480389ab6cce88585bebc65d4bb203bd8da5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:05.992731Z","signature_b64":"P08uKJuvtWp1198oMOoPxjc/fksq2Y66WCZrp97OyxdwEhBk5docer6RpABw0eVxB6emesDx8bqNNjd6b5XZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d8f3ac553fac825749d1fac9263694499b3cb7dceec6cf951f4e967f9eb2a9","last_reissued_at":"2026-05-18T02:46:05.992205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:05.992205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simpler formula for the number of diagonal inversions of an (m,n)-Parking Function and a returning Fermionic formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Hicks, Emily Leven","submitted_at":"2014-04-18T21:16:25Z","abstract_excerpt":"Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has been defined using a complicated generalization of the dinv statistic which is composed of three parts and which is not obviously non-negative. Here we simplify the definition of dinv, prove that it is always non-negative, and give a geometric description of the statistic in the style of the classical case. We go on to show that in the n x (n+1) lattice, parki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4889","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":"1404.4889","created_at":"2026-05-18T02:46:05.992279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4889v2","created_at":"2026-05-18T02:46:05.992279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4889","created_at":"2026-05-18T02:46:05.992279+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHMPHLCVH6WI","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHMPHLCVH6WIEV2J","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHMPHLCV","created_at":"2026-05-18T12:28:38.356838+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/LHMPHLCVH6WIEV2J2H5MSJRWSR","json":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR.json","graph_json":"https://pith.science/api/pith-number/LHMPHLCVH6WIEV2J2H5MSJRWSR/graph.json","events_json":"https://pith.science/api/pith-number/LHMPHLCVH6WIEV2J2H5MSJRWSR/events.json","paper":"https://pith.science/paper/LHMPHLCV"},"agent_actions":{"view_html":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR","download_json":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR.json","view_paper":"https://pith.science/paper/LHMPHLCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4889&json=true","fetch_graph":"https://pith.science/api/pith-number/LHMPHLCVH6WIEV2J2H5MSJRWSR/graph.json","fetch_events":"https://pith.science/api/pith-number/LHMPHLCVH6WIEV2J2H5MSJRWSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR/action/storage_attestation","attest_author":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR/action/author_attestation","sign_citation":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR/action/citation_signature","submit_replication":"https://pith.science/pith/LHMPHLCVH6WIEV2J2H5MSJRWSR/action/replication_record"}},"created_at":"2026-05-18T02:46:05.992279+00:00","updated_at":"2026-05-18T02:46:05.992279+00:00"}