{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ACUVQI7S4KEZ4WDUEY2ZFHZ7PA","short_pith_number":"pith:ACUVQI7S","canonical_record":{"source":{"id":"1112.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-12-05T00:00:33Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"957f5f52e36ebfae21cba2a2a618c6cab930240d4114d0de995bbd8fe29f7069","abstract_canon_sha256":"0604f78d06d5a2cca136216f8a89cd236701984f29d31f5e8be15523e46631ff"},"schema_version":"1.0"},"canonical_sha256":"00a95823f2e2899e58742635929f3f780a2c2f1694fe38bf149af7239d5b72cc","source":{"kind":"arxiv","id":"1112.0812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0812","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0812v1","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0812","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACUVQI7S4KEZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ACUVQI7S4KEZ4WDU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ACUVQI7S","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ACUVQI7S4KEZ4WDUEY2ZFHZ7PA","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-12-05T00:00:33Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"957f5f52e36ebfae21cba2a2a618c6cab930240d4114d0de995bbd8fe29f7069","abstract_canon_sha256":"0604f78d06d5a2cca136216f8a89cd236701984f29d31f5e8be15523e46631ff"},"schema_version":"1.0"},"canonical_sha256":"00a95823f2e2899e58742635929f3f780a2c2f1694fe38bf149af7239d5b72cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:57.729801Z","signature_b64":"2K8i0yL7piMTqIDgKoNvM9uSv/nWWWOfbWlxF9bSdgR3gnBTt7VaQC2e2bxk0eYXUt+o1xT3nG+BFiicYvhzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a95823f2e2899e58742635929f3f780a2c2f1694fe38bf149af7239d5b72cc","last_reissued_at":"2026-05-18T04:06:57.729106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:57.729106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0812","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:06:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZvZlf1dh5i2yR1qZeG5LISKYcQZKFgzLZIStbY7XoOaIHM+dkcPllZp5wQPDf0yMiWmA8+82r1un6MNJJ3dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:36:07.250326Z"},"content_sha256":"9e1579dcbf27c9c8eb37c34cb22452edec96cc6e78e1ffc77b17175fa93c7b02","schema_version":"1.0","event_id":"sha256:9e1579dcbf27c9c8eb37c34cb22452edec96cc6e78e1ffc77b17175fa93c7b02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ACUVQI7S4KEZ4WDUEY2ZFHZ7PA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational complexity of topological invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.AT","authors_text":"Manuel Amann","submitted_at":"2011-12-05T00:00:33Z","abstract_excerpt":"We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\\qq)$ and $\\pi_*(X)\\otimes \\qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length and the rational Lusternik--Schnirelmann category of $X$?\n  Basically, by a reduction from the decision problem whether a given graph is $k$-colourable (for $k\\geq 3$) we show that (even stricter versions of the) problems above are $\\mathbf{NP}$-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0812","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:06:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIQ8zIp5V08kWmjpFCttoulfPiZ66JkEQI9OwvZc8QCf28RXei+JI8ie0MtbB2vAa++8cuyDPrhbsGwBW6uEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:36:07.250762Z"},"content_sha256":"c0daa86f5482a4e2e1d4eaffb1228ce401b9df4d505bfdf98885da8fef2a1755","schema_version":"1.0","event_id":"sha256:c0daa86f5482a4e2e1d4eaffb1228ce401b9df4d505bfdf98885da8fef2a1755"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/bundle.json","state_url":"https://pith.science/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/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-07T15:36:07Z","links":{"resolver":"https://pith.science/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA","bundle":"https://pith.science/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/bundle.json","state":"https://pith.science/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACUVQI7S4KEZ4WDUEY2ZFHZ7PA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ACUVQI7S4KEZ4WDUEY2ZFHZ7PA","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":"0604f78d06d5a2cca136216f8a89cd236701984f29d31f5e8be15523e46631ff","cross_cats_sorted":["math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-12-05T00:00:33Z","title_canon_sha256":"957f5f52e36ebfae21cba2a2a618c6cab930240d4114d0de995bbd8fe29f7069"},"schema_version":"1.0","source":{"id":"1112.0812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0812","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0812v1","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0812","created_at":"2026-05-18T04:06:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACUVQI7S4KEZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ACUVQI7S4KEZ4WDU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ACUVQI7S","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:c0daa86f5482a4e2e1d4eaffb1228ce401b9df4d505bfdf98885da8fef2a1755","target":"graph","created_at":"2026-05-18T04:06:57Z","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 answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\\qq)$ and $\\pi_*(X)\\otimes \\qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length and the rational Lusternik--Schnirelmann category of $X$?\n  Basically, by a reduction from the decision problem whether a given graph is $k$-colourable (for $k\\geq 3$) we show that (even stricter versions of the) problems above are $\\mathbf{NP}$-hard.","authors_text":"Manuel Amann","cross_cats":["math.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-12-05T00:00:33Z","title":"Computational complexity of topological invariants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0812","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:9e1579dcbf27c9c8eb37c34cb22452edec96cc6e78e1ffc77b17175fa93c7b02","target":"record","created_at":"2026-05-18T04:06:57Z","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":"0604f78d06d5a2cca136216f8a89cd236701984f29d31f5e8be15523e46631ff","cross_cats_sorted":["math.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2011-12-05T00:00:33Z","title_canon_sha256":"957f5f52e36ebfae21cba2a2a618c6cab930240d4114d0de995bbd8fe29f7069"},"schema_version":"1.0","source":{"id":"1112.0812","kind":"arxiv","version":1}},"canonical_sha256":"00a95823f2e2899e58742635929f3f780a2c2f1694fe38bf149af7239d5b72cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a95823f2e2899e58742635929f3f780a2c2f1694fe38bf149af7239d5b72cc","first_computed_at":"2026-05-18T04:06:57.729106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:57.729106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2K8i0yL7piMTqIDgKoNvM9uSv/nWWWOfbWlxF9bSdgR3gnBTt7VaQC2e2bxk0eYXUt+o1xT3nG+BFiicYvhzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:57.729801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e1579dcbf27c9c8eb37c34cb22452edec96cc6e78e1ffc77b17175fa93c7b02","sha256:c0daa86f5482a4e2e1d4eaffb1228ce401b9df4d505bfdf98885da8fef2a1755"],"state_sha256":"e85c3424be0ad5713b45d78dc379344aa2ffdd1a51c182661f43cb1cb3c8f4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQpAR8w3FHJaQ9KJyJBx/eMQrdABdLe7IxYsslidIMW6jw/9hx2BqsrczW0YZ40T1HD/Pv1zjb+ftKyFJOvvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:36:07.254954Z","bundle_sha256":"a9e76c14871fd6875cfe6382cbc81bcda31cac1276c3c96e7820880657d088f3"}}