{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NZ3SIAWFGJKKNRGS4UZ6EJJM6G","short_pith_number":"pith:NZ3SIAWF","canonical_record":{"source":{"id":"1106.2762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-06-14T16:45:14Z","cross_cats_sorted":["math.AG","math.CO","math.RT"],"title_canon_sha256":"d1814013318f1b835aecfb9147fa129c0ebe0901e38ed33a9298fcd059f84b06","abstract_canon_sha256":"51a37213e82261af3e0e6c56d67c7b596cb1f03dfe1876c9013943cbb9251e5c"},"schema_version":"1.0"},"canonical_sha256":"6e772402c53254a6c4d2e533e2252cf199dcb2aa80ec360f14a05074b6f6e67d","source":{"kind":"arxiv","id":"1106.2762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2762","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2762v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2762","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"NZ3SIAWFGJKK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NZ3SIAWFGJKKNRGS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NZ3SIAWF","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NZ3SIAWFGJKKNRGS4UZ6EJJM6G","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-06-14T16:45:14Z","cross_cats_sorted":["math.AG","math.CO","math.RT"],"title_canon_sha256":"d1814013318f1b835aecfb9147fa129c0ebe0901e38ed33a9298fcd059f84b06","abstract_canon_sha256":"51a37213e82261af3e0e6c56d67c7b596cb1f03dfe1876c9013943cbb9251e5c"},"schema_version":"1.0"},"canonical_sha256":"6e772402c53254a6c4d2e533e2252cf199dcb2aa80ec360f14a05074b6f6e67d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:04.196070Z","signature_b64":"LS2QMn/gKDSF5XGekTL4jI8wjGd8WVLnQrR+LWqbaTWebRrQKM4Da4tKbxpoadbN7UV2ll2LI05xbK/FWowSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e772402c53254a6c4d2e533e2252cf199dcb2aa80ec360f14a05074b6f6e67d","last_reissued_at":"2026-05-18T04:20:04.195628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:04.195628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2762","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuQ1jf07pRVWa24MPUVsZNgNjoPGBTrPG5eMO+M9tsx5hSxK+f3rbiov7hxm2EJikN7kJVls2y+gCqX1j4baAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:23:51.036734Z"},"content_sha256":"59cbe7c4acf6eb81616d34b8deff5ef59109278e6bac88cb0a606899f4f01f35","schema_version":"1.0","event_id":"sha256:59cbe7c4acf6eb81616d34b8deff5ef59109278e6bac88cb0a606899f4f01f35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NZ3SIAWFGJKKNRGS4UZ6EJJM6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Generating Invariants Under Semisimple Group and Torus Actions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO","math.RT"],"primary_cat":"math.AC","authors_text":"Harlan Kadish","submitted_at":"2011-06-14T16:45:14Z","abstract_excerpt":"Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime of algorithms that compute invariants. Fix a semisimple linear algebraic group, choose an irreducible representation of highest weight w, and consider the irreducible representations of highest weight nw. As n goes to infinity, the cardinality of a minimal set of generating invariants grows faster than any polynomial in n. On the other hand, combinatorial me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2762","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtRJ+DDV6ku/6QX2iawZKFlCh/dBmRj7J8tHL/gklc3B7JYVfcNzeU3IJxynEEWlkna0arhQ2hxaVFm9eJFkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:23:51.037491Z"},"content_sha256":"e63a3d6eb6a5170e571b027b1a8fa6298d539f92b4f3f8c7d67244b381e9ba2f","schema_version":"1.0","event_id":"sha256:e63a3d6eb6a5170e571b027b1a8fa6298d539f92b4f3f8c7d67244b381e9ba2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/bundle.json","state_url":"https://pith.science/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/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-11T03:23:51Z","links":{"resolver":"https://pith.science/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G","bundle":"https://pith.science/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/bundle.json","state":"https://pith.science/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZ3SIAWFGJKKNRGS4UZ6EJJM6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NZ3SIAWFGJKKNRGS4UZ6EJJM6G","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":"51a37213e82261af3e0e6c56d67c7b596cb1f03dfe1876c9013943cbb9251e5c","cross_cats_sorted":["math.AG","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-06-14T16:45:14Z","title_canon_sha256":"d1814013318f1b835aecfb9147fa129c0ebe0901e38ed33a9298fcd059f84b06"},"schema_version":"1.0","source":{"id":"1106.2762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2762","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2762v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2762","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"NZ3SIAWFGJKK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NZ3SIAWFGJKKNRGS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NZ3SIAWF","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:e63a3d6eb6a5170e571b027b1a8fa6298d539f92b4f3f8c7d67244b381e9ba2f","target":"graph","created_at":"2026-05-18T04:20:04Z","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":"Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime of algorithms that compute invariants. Fix a semisimple linear algebraic group, choose an irreducible representation of highest weight w, and consider the irreducible representations of highest weight nw. As n goes to infinity, the cardinality of a minimal set of generating invariants grows faster than any polynomial in n. On the other hand, combinatorial me","authors_text":"Harlan Kadish","cross_cats":["math.AG","math.CO","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-06-14T16:45:14Z","title":"Counting Generating Invariants Under Semisimple Group and Torus Actions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2762","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:59cbe7c4acf6eb81616d34b8deff5ef59109278e6bac88cb0a606899f4f01f35","target":"record","created_at":"2026-05-18T04:20:04Z","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":"51a37213e82261af3e0e6c56d67c7b596cb1f03dfe1876c9013943cbb9251e5c","cross_cats_sorted":["math.AG","math.CO","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-06-14T16:45:14Z","title_canon_sha256":"d1814013318f1b835aecfb9147fa129c0ebe0901e38ed33a9298fcd059f84b06"},"schema_version":"1.0","source":{"id":"1106.2762","kind":"arxiv","version":1}},"canonical_sha256":"6e772402c53254a6c4d2e533e2252cf199dcb2aa80ec360f14a05074b6f6e67d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e772402c53254a6c4d2e533e2252cf199dcb2aa80ec360f14a05074b6f6e67d","first_computed_at":"2026-05-18T04:20:04.195628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:04.195628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LS2QMn/gKDSF5XGekTL4jI8wjGd8WVLnQrR+LWqbaTWebRrQKM4Da4tKbxpoadbN7UV2ll2LI05xbK/FWowSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:04.196070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cbe7c4acf6eb81616d34b8deff5ef59109278e6bac88cb0a606899f4f01f35","sha256:e63a3d6eb6a5170e571b027b1a8fa6298d539f92b4f3f8c7d67244b381e9ba2f"],"state_sha256":"2cb375627199eff01a0846aa1ab697906dff7cab08c9e342bae38029cc72be2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7zIYalY49YG/7AomTKOhPj1i3jnWK0oRXp8bxFfFUNZWQiCa1bcDqIDJyJx2ZEgv+q/+meYW04Zhaxwy90vAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:23:51.041768Z","bundle_sha256":"651683e648cb6a140ca8df1a08c13718f58bf964eeea71c18ad67b27d6b8e302"}}