{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QKLKDBZUYSGSWQPMQXWEXWM2TV","short_pith_number":"pith:QKLKDBZU","canonical_record":{"source":{"id":"1404.0653","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T19:01:31Z","cross_cats_sorted":["cs.CC","math.RT"],"title_canon_sha256":"dd203561e7182ddf6a6cab61341053120c2e11528884a4c696948a5210039008","abstract_canon_sha256":"a2774ccdb777a686c47cb6a95dffd1813543566f3d0a2f6958015b275e247407"},"schema_version":"1.0"},"canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","source":{"kind":"arxiv","id":"1404.0653","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0653","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0653v3","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0653","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"QKLKDBZUYSGS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QKLKDBZUYSGSWQPM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QKLKDBZU","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QKLKDBZUYSGSWQPMQXWEXWM2TV","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0653","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T19:01:31Z","cross_cats_sorted":["cs.CC","math.RT"],"title_canon_sha256":"dd203561e7182ddf6a6cab61341053120c2e11528884a4c696948a5210039008","abstract_canon_sha256":"a2774ccdb777a686c47cb6a95dffd1813543566f3d0a2f6958015b275e247407"},"schema_version":"1.0"},"canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:31.826041Z","signature_b64":"D6D48D6A+wy4yK0J0/1yG/bRKyBD+NwF2sj7U7TX7JaOkLSFAvn/q1Foy400ew8BgK2EvSF5WRGvlCpp+JALDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","last_reissued_at":"2026-05-18T02:26:31.825637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:31.825637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0653","source_version":3,"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-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXIEOKYXElPB2rreWaQrUzZ4n9Zed78ujK8DqQIpr/+CxQ50/Sn2wQLkOC7rqRNmqRjx4QtWKIhJehpyKYUKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:47.421080Z"},"content_sha256":"c3f2614bc34de6a2bb4d7821fa9dfc32fbfcaa5ee0dd581aab74dd8a170e80a3","schema_version":"1.0","event_id":"sha256:c3f2614bc34de6a2bb4d7821fa9dfc32fbfcaa5ee0dd581aab74dd8a170e80a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QKLKDBZUYSGSWQPMQXWEXWM2TV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of computing Kronecker coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.RT"],"primary_cat":"math.CO","authors_text":"Greta Panova, Igor Pak","submitted_at":"2014-04-02T19:01:31Z","abstract_excerpt":"We study the complexity of computing Kronecker coefficients $g(\\lambda,\\mu,\\nu)$. We give explicit bounds in terms of the number of parts $\\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three partitions. When $M = O(1)$, i.e. one of the partitions is hook-like, the bounds are linear in $\\log N$, but depend exponentially on $\\ell$. Moreover, similar bounds hold even when $M=e^{O(\\ell)}$. By a separate argument, we show that the positivity of Kronecker coefficients can be decided in $O(\\log N)$ time for a bounded number $\\ell$ of parts and without re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0653","kind":"arxiv","version":3},"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-18T02:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqDTLegeIhD8bDjQQcGr9DQTlf9ygbBvlslIJb0rG8Iw1lHhHjOOc2T8dXlMcKs6+rqvnHXKnI4opQTt5QM1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:47.421566Z"},"content_sha256":"eaf55ac901266b3e892c55eeb1a9149d9c6c767be717cfb911829b4d939437a9","schema_version":"1.0","event_id":"sha256:eaf55ac901266b3e892c55eeb1a9149d9c6c767be717cfb911829b4d939437a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/bundle.json","state_url":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/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-05-30T20:01:47Z","links":{"resolver":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV","bundle":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/bundle.json","state":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QKLKDBZUYSGSWQPMQXWEXWM2TV","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":"a2774ccdb777a686c47cb6a95dffd1813543566f3d0a2f6958015b275e247407","cross_cats_sorted":["cs.CC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T19:01:31Z","title_canon_sha256":"dd203561e7182ddf6a6cab61341053120c2e11528884a4c696948a5210039008"},"schema_version":"1.0","source":{"id":"1404.0653","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0653","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0653v3","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0653","created_at":"2026-05-18T02:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"QKLKDBZUYSGS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QKLKDBZUYSGSWQPM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QKLKDBZU","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:eaf55ac901266b3e892c55eeb1a9149d9c6c767be717cfb911829b4d939437a9","target":"graph","created_at":"2026-05-18T02:26:31Z","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":"We study the complexity of computing Kronecker coefficients $g(\\lambda,\\mu,\\nu)$. We give explicit bounds in terms of the number of parts $\\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three partitions. When $M = O(1)$, i.e. one of the partitions is hook-like, the bounds are linear in $\\log N$, but depend exponentially on $\\ell$. Moreover, similar bounds hold even when $M=e^{O(\\ell)}$. By a separate argument, we show that the positivity of Kronecker coefficients can be decided in $O(\\log N)$ time for a bounded number $\\ell$ of parts and without re","authors_text":"Greta Panova, Igor Pak","cross_cats":["cs.CC","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T19:01:31Z","title":"On the complexity of computing Kronecker coefficients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0653","kind":"arxiv","version":3},"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:c3f2614bc34de6a2bb4d7821fa9dfc32fbfcaa5ee0dd581aab74dd8a170e80a3","target":"record","created_at":"2026-05-18T02:26:31Z","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":"a2774ccdb777a686c47cb6a95dffd1813543566f3d0a2f6958015b275e247407","cross_cats_sorted":["cs.CC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-02T19:01:31Z","title_canon_sha256":"dd203561e7182ddf6a6cab61341053120c2e11528884a4c696948a5210039008"},"schema_version":"1.0","source":{"id":"1404.0653","kind":"arxiv","version":3}},"canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","first_computed_at":"2026-05-18T02:26:31.825637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:31.825637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D6D48D6A+wy4yK0J0/1yG/bRKyBD+NwF2sj7U7TX7JaOkLSFAvn/q1Foy400ew8BgK2EvSF5WRGvlCpp+JALDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:31.826041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0653","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f2614bc34de6a2bb4d7821fa9dfc32fbfcaa5ee0dd581aab74dd8a170e80a3","sha256:eaf55ac901266b3e892c55eeb1a9149d9c6c767be717cfb911829b4d939437a9"],"state_sha256":"4ebd4ecbf1e3e464f1f903299be01e3205a37c80bddef740972029ff512a3291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVfiGnzeqmUXblIg1fklp/f+LByurHpWiuV/LtUZmp1+EYTPuppVTGWaq52goNgXRp93umh2TZ4h3YH7q/MIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:01:47.424494Z","bundle_sha256":"88d16b02ff8c0f99e681ac338dd08c2cc0cf6fa300c2f47921d4644e9ce5d605"}}