{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WEQDEJJ77C5ADC26F75CJXAGC5","short_pith_number":"pith:WEQDEJJ7","schema_version":"1.0","canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","source":{"kind":"arxiv","id":"1807.03994","version":1},"attestation_state":"computed","paper":{"title":"An upper bound for topological complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Gregory Lupton, John Oprea, Mark Grant, Michael Farber","submitted_at":"2018-07-11T08:31:54Z","abstract_excerpt":"In arXiv:1711.10132 a new approximating invariant ${\\mathsf{TC}}^{\\mathcal{D}}$ for topological complexity was introduced called $\\mathcal{D}$-topological complexity. In this paper, we explore more fully the properties of ${\\mathsf{TC}}^{\\mathcal{D}}$ and the connections between ${\\mathsf{TC}}^{\\mathcal{D}}$ and invariants of Lusternik-Schnirelmann type. We also introduce a new $\\mathsf{TC}$-type invariant $\\widetilde{\\mathsf{TC}}$ that can be used to give an upper bound for $\\mathsf{TC}$, $$\\mathsf{TC}(X)\\le {\\mathsf{TC}}^{\\mathcal{D}}(X) + \\left\\lceil \\frac{2\\dim X -k}{k+1}\\right\\rceil,$$ wh"},"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":"1807.03994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-07-11T08:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"c602f1205520a0705148a593facf4b9b8fe904854860214baf876f4a074bf02c","abstract_canon_sha256":"49f8b7bb626ca5b727f8734fd8fb51fbe1babb8d68d031a71175faf781b7edf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.376373Z","signature_b64":"vQF5KT636QdmXt6NpFesbgEzk9k3Cj+NWzBCckyPUmSNRLhnOZhONepuU97yqCGCSVwuM1ypZnQf4TR2nWuKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","last_reissued_at":"2026-05-18T00:10:58.375541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.375541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound for topological complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Gregory Lupton, John Oprea, Mark Grant, Michael Farber","submitted_at":"2018-07-11T08:31:54Z","abstract_excerpt":"In arXiv:1711.10132 a new approximating invariant ${\\mathsf{TC}}^{\\mathcal{D}}$ for topological complexity was introduced called $\\mathcal{D}$-topological complexity. In this paper, we explore more fully the properties of ${\\mathsf{TC}}^{\\mathcal{D}}$ and the connections between ${\\mathsf{TC}}^{\\mathcal{D}}$ and invariants of Lusternik-Schnirelmann type. We also introduce a new $\\mathsf{TC}$-type invariant $\\widetilde{\\mathsf{TC}}$ that can be used to give an upper bound for $\\mathsf{TC}$, $$\\mathsf{TC}(X)\\le {\\mathsf{TC}}^{\\mathcal{D}}(X) + \\left\\lceil \\frac{2\\dim X -k}{k+1}\\right\\rceil,$$ wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03994","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":"1807.03994","created_at":"2026-05-18T00:10:58.375664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03994v1","created_at":"2026-05-18T00:10:58.375664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03994","created_at":"2026-05-18T00:10:58.375664+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEQDEJJ77C5A","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEQDEJJ77C5ADC26","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEQDEJJ7","created_at":"2026-05-18T12:32:59.047623+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/WEQDEJJ77C5ADC26F75CJXAGC5","json":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5.json","graph_json":"https://pith.science/api/pith-number/WEQDEJJ77C5ADC26F75CJXAGC5/graph.json","events_json":"https://pith.science/api/pith-number/WEQDEJJ77C5ADC26F75CJXAGC5/events.json","paper":"https://pith.science/paper/WEQDEJJ7"},"agent_actions":{"view_html":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5","download_json":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5.json","view_paper":"https://pith.science/paper/WEQDEJJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03994&json=true","fetch_graph":"https://pith.science/api/pith-number/WEQDEJJ77C5ADC26F75CJXAGC5/graph.json","fetch_events":"https://pith.science/api/pith-number/WEQDEJJ77C5ADC26F75CJXAGC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/action/storage_attestation","attest_author":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/action/author_attestation","sign_citation":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/action/citation_signature","submit_replication":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/action/replication_record"}},"created_at":"2026-05-18T00:10:58.375664+00:00","updated_at":"2026-05-18T00:10:58.375664+00:00"}