{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QKLKDBZUYSGSWQPMQXWEXWM2TV","short_pith_number":"pith:QKLKDBZU","schema_version":"1.0","canonical_sha256":"8296a18734c48d2b41ec85ec4bd99a9d6387642f0eb834ec045c8ae6fd52fdd1","source":{"kind":"arxiv","id":"1404.0653","version":3},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.0653","created_at":"2026-05-18T02:26:31.825705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0653v3","created_at":"2026-05-18T02:26:31.825705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0653","created_at":"2026-05-18T02:26:31.825705+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKLKDBZUYSGS","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKLKDBZUYSGSWQPM","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKLKDBZU","created_at":"2026-05-18T12:28:46.137349+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/QKLKDBZUYSGSWQPMQXWEXWM2TV","json":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV.json","graph_json":"https://pith.science/api/pith-number/QKLKDBZUYSGSWQPMQXWEXWM2TV/graph.json","events_json":"https://pith.science/api/pith-number/QKLKDBZUYSGSWQPMQXWEXWM2TV/events.json","paper":"https://pith.science/paper/QKLKDBZU"},"agent_actions":{"view_html":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV","download_json":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV.json","view_paper":"https://pith.science/paper/QKLKDBZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0653&json=true","fetch_graph":"https://pith.science/api/pith-number/QKLKDBZUYSGSWQPMQXWEXWM2TV/graph.json","fetch_events":"https://pith.science/api/pith-number/QKLKDBZUYSGSWQPMQXWEXWM2TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/action/storage_attestation","attest_author":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/action/author_attestation","sign_citation":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/action/citation_signature","submit_replication":"https://pith.science/pith/QKLKDBZUYSGSWQPMQXWEXWM2TV/action/replication_record"}},"created_at":"2026-05-18T02:26:31.825705+00:00","updated_at":"2026-05-18T02:26:31.825705+00:00"}