{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:M3BC3EA7RUJZWECWEDDP4ZLIPS","short_pith_number":"pith:M3BC3EA7","canonical_record":{"source":{"id":"1002.2054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-10T10:05:18Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"f87ff3d34450250eec51ca2216e10161680614cd3778e181976193876736645a","abstract_canon_sha256":"89d2b1143c02f661b70a7e44b519dcffa219b73d9f2eca72abca867f46881ef1"},"schema_version":"1.0"},"canonical_sha256":"66c22d901f8d139b105620c6fe65687c9b93cdd6c3d6e2ccfb05f206e97c0eac","source":{"kind":"arxiv","id":"1002.2054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2054","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2054v1","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2054","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"M3BC3EA7RUJZ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M3BC3EA7RUJZWECW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M3BC3EA7","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:M3BC3EA7RUJZWECWEDDP4ZLIPS","target":"record","payload":{"canonical_record":{"source":{"id":"1002.2054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-10T10:05:18Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"f87ff3d34450250eec51ca2216e10161680614cd3778e181976193876736645a","abstract_canon_sha256":"89d2b1143c02f661b70a7e44b519dcffa219b73d9f2eca72abca867f46881ef1"},"schema_version":"1.0"},"canonical_sha256":"66c22d901f8d139b105620c6fe65687c9b93cdd6c3d6e2ccfb05f206e97c0eac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.679881Z","signature_b64":"oBs/Fg51HrY6iuXTmVTpfhyA5ptayjzPL8R0ty7EBweCuJtQWaF5YmRZA3abq6HcDErb81W98qLnIHroUbFZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c22d901f8d139b105620c6fe65687c9b93cdd6c3d6e2ccfb05f206e97c0eac","last_reissued_at":"2026-05-18T01:02:59.679437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.679437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.2054","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-05-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XY2Me8txD7Hhub8QG+f2c9rObru7P6sZb9psOKzuaTuSO0E9xJgb7OX2YDW8/1H+Xk5vd5bw6ZBDLtLyevGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:55:13.689274Z"},"content_sha256":"d507c0ceae2d77465dc98191ca219a58e55cd86c9a5d87fbfa724310fe1b6c49","schema_version":"1.0","event_id":"sha256:d507c0ceae2d77465dc98191ca219a58e55cd86c9a5d87fbfa724310fe1b6c49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:M3BC3EA7RUJZWECWEDDP4ZLIPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of permutations with k inversions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"G\\'abor Heged\\\"us","submitted_at":"2010-02-10T10:05:18Z","abstract_excerpt":"Let $n\\geq 1$, $0\\leq t\\leq {n \\choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\\geq 1$ and $0\\leq t\\leq (d-1)n$ be arbitrary integers. Define {\\em the polynomial coefficients} $H(n,d,t)$ as the numbers of compositions of $t$ with at most $n$ parts, no one of which is greater than $d-1$. In our article we give explicit formulas for the numbers $I_n(t)$ and $H(n,d,t)$ using the theory of Gr\\\"obner bases and free resolutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2054","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"},"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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtzfiBTIcrj+AUX1Z+HYiC1jJg+mENoBSohY3Ule38fqR5s015GMcbrOmalutJBKNmrxYx9H5tjfChFDvd02Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:55:13.689977Z"},"content_sha256":"e26eae922dee21cd5aa040cc7a3e027c44da0d489ef8cd8213d71a88f2bc3f4a","schema_version":"1.0","event_id":"sha256:e26eae922dee21cd5aa040cc7a3e027c44da0d489ef8cd8213d71a88f2bc3f4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/bundle.json","state_url":"https://pith.science/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/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-07T23:55:13Z","links":{"resolver":"https://pith.science/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS","bundle":"https://pith.science/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/bundle.json","state":"https://pith.science/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3BC3EA7RUJZWECWEDDP4ZLIPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:M3BC3EA7RUJZWECWEDDP4ZLIPS","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":"89d2b1143c02f661b70a7e44b519dcffa219b73d9f2eca72abca867f46881ef1","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-10T10:05:18Z","title_canon_sha256":"f87ff3d34450250eec51ca2216e10161680614cd3778e181976193876736645a"},"schema_version":"1.0","source":{"id":"1002.2054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2054","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2054v1","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2054","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"M3BC3EA7RUJZ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M3BC3EA7RUJZWECW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M3BC3EA7","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:e26eae922dee21cd5aa040cc7a3e027c44da0d489ef8cd8213d71a88f2bc3f4a","target":"graph","created_at":"2026-05-18T01:02:59Z","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 $n\\geq 1$, $0\\leq t\\leq {n \\choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\\geq 1$ and $0\\leq t\\leq (d-1)n$ be arbitrary integers. Define {\\em the polynomial coefficients} $H(n,d,t)$ as the numbers of compositions of $t$ with at most $n$ parts, no one of which is greater than $d-1$. In our article we give explicit formulas for the numbers $I_n(t)$ and $H(n,d,t)$ using the theory of Gr\\\"obner bases and free resolutions.","authors_text":"G\\'abor Heged\\\"us","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-10T10:05:18Z","title":"The number of permutations with k inversions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2054","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:d507c0ceae2d77465dc98191ca219a58e55cd86c9a5d87fbfa724310fe1b6c49","target":"record","created_at":"2026-05-18T01:02:59Z","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":"89d2b1143c02f661b70a7e44b519dcffa219b73d9f2eca72abca867f46881ef1","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-10T10:05:18Z","title_canon_sha256":"f87ff3d34450250eec51ca2216e10161680614cd3778e181976193876736645a"},"schema_version":"1.0","source":{"id":"1002.2054","kind":"arxiv","version":1}},"canonical_sha256":"66c22d901f8d139b105620c6fe65687c9b93cdd6c3d6e2ccfb05f206e97c0eac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66c22d901f8d139b105620c6fe65687c9b93cdd6c3d6e2ccfb05f206e97c0eac","first_computed_at":"2026-05-18T01:02:59.679437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.679437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBs/Fg51HrY6iuXTmVTpfhyA5ptayjzPL8R0ty7EBweCuJtQWaF5YmRZA3abq6HcDErb81W98qLnIHroUbFZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.679881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.2054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d507c0ceae2d77465dc98191ca219a58e55cd86c9a5d87fbfa724310fe1b6c49","sha256:e26eae922dee21cd5aa040cc7a3e027c44da0d489ef8cd8213d71a88f2bc3f4a"],"state_sha256":"4e6d4f6203036cce3d04f063aaa1f2f692cafef419dd62fa9a381efb8ee5e04a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNaQKaG1r9F+gkDAhdvutTzDyfcbQ4xsowYhy8p2/VUZt5x/RfwN0VYqXPxWpKzskxgPlCSkxMtLjkpo7A6YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:55:13.693979Z","bundle_sha256":"ffb47f7dca68b52624ae4af65d017c4631791efc3cd2b9787f15b93c81037121"}}