{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IJ6UFFHPLGYJOXP4I2NNY5GDZM","short_pith_number":"pith:IJ6UFFHP","schema_version":"1.0","canonical_sha256":"427d4294ef59b0975dfc469adc74c3cb0a56b7800fa434ff7f9a9bbbda6a1508","source":{"kind":"arxiv","id":"1106.3399","version":1},"attestation_state":"computed","paper":{"title":"Topological Complexity of H-Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Gregory Lupton, J\\'er\\^ome Scherer","submitted_at":"2011-06-17T07:16:09Z","abstract_excerpt":"Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(X^n), for n >= 1, where TC_{n+1}(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the Lusternik-Schnirelmann category. We also generalize this equality to an inequality, which gives an upper bound for TC_{n+1}(X), in the setting of a space Y acting on X."},"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":"1106.3399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-06-17T07:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"9787acc1fcc920982e5cdd2d2087bd3002dc9dd781bf53f0d69508cd162e255c","abstract_canon_sha256":"4341c9453a75a39ca8040ec2e766910b430e6920aa9b228723d167ae393a07db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:52.844528Z","signature_b64":"5w/tRLyfpzlsPIrd/jj7AB1yhM7/FQdadNGifa0Xd1Sujx6GQqsvNP8mo5IWNKY3madl6tZy1EKwT/Zv3DSICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427d4294ef59b0975dfc469adc74c3cb0a56b7800fa434ff7f9a9bbbda6a1508","last_reissued_at":"2026-05-18T04:19:52.843856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:52.843856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Complexity of H-Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Gregory Lupton, J\\'er\\^ome Scherer","submitted_at":"2011-06-17T07:16:09Z","abstract_excerpt":"Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(X^n), for n >= 1, where TC_{n+1}(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the Lusternik-Schnirelmann category. We also generalize this equality to an inequality, which gives an upper bound for TC_{n+1}(X), in the setting of a space Y acting on X."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3399","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.3399","created_at":"2026-05-18T04:19:52.843954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3399v1","created_at":"2026-05-18T04:19:52.843954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3399","created_at":"2026-05-18T04:19:52.843954+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJ6UFFHPLGYJ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJ6UFFHPLGYJOXP4","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJ6UFFHP","created_at":"2026-05-18T12:26:30.835961+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/IJ6UFFHPLGYJOXP4I2NNY5GDZM","json":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM.json","graph_json":"https://pith.science/api/pith-number/IJ6UFFHPLGYJOXP4I2NNY5GDZM/graph.json","events_json":"https://pith.science/api/pith-number/IJ6UFFHPLGYJOXP4I2NNY5GDZM/events.json","paper":"https://pith.science/paper/IJ6UFFHP"},"agent_actions":{"view_html":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM","download_json":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM.json","view_paper":"https://pith.science/paper/IJ6UFFHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3399&json=true","fetch_graph":"https://pith.science/api/pith-number/IJ6UFFHPLGYJOXP4I2NNY5GDZM/graph.json","fetch_events":"https://pith.science/api/pith-number/IJ6UFFHPLGYJOXP4I2NNY5GDZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM/action/storage_attestation","attest_author":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM/action/author_attestation","sign_citation":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM/action/citation_signature","submit_replication":"https://pith.science/pith/IJ6UFFHPLGYJOXP4I2NNY5GDZM/action/replication_record"}},"created_at":"2026-05-18T04:19:52.843954+00:00","updated_at":"2026-05-18T04:19:52.843954+00:00"}