{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WEQDEJJ77C5ADC26F75CJXAGC5","short_pith_number":"pith:WEQDEJJ7","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"},"canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","source":{"kind":"arxiv","id":"1807.03994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03994","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03994v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03994","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"WEQDEJJ77C5A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEQDEJJ77C5ADC26","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEQDEJJ7","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WEQDEJJ77C5ADC26F75CJXAGC5","target":"record","payload":{"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"},"canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","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"},"source_kind":"arxiv","source_id":"1807.03994","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-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gADI7PPi4T2B2meIxCItRWxDsLYqZUdLVsnPPnAm8VEkVnNVjVh26j4dPL4z9LkU4g0XtyCagdQnIBftlFExAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:07:17.387330Z"},"content_sha256":"90e74287717a6599070e1e74def10fdf6263de27682811cfeb7e467fa93f2d6f","schema_version":"1.0","event_id":"sha256:90e74287717a6599070e1e74def10fdf6263de27682811cfeb7e467fa93f2d6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WEQDEJJ77C5ADC26F75CJXAGC5","target":"graph","payload":{"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"},"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-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GYFQa3MTk7aXh1/dOAOTBrLcZZjdwuOHFEPyqFk5RKE0XBa9K+htLMhFsLS9eTS1bvJx6hyIyq0VDjit6tsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:07:17.387867Z"},"content_sha256":"0c223028c881dc42fcde996555d3a83af5b82050360d4c4981f84cfb236e74ae","schema_version":"1.0","event_id":"sha256:0c223028c881dc42fcde996555d3a83af5b82050360d4c4981f84cfb236e74ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/bundle.json","state_url":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEQDEJJ77C5ADC26F75CJXAGC5/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-07T04:07:17Z","links":{"resolver":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5","bundle":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/bundle.json","state":"https://pith.science/pith/WEQDEJJ77C5ADC26F75CJXAGC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEQDEJJ77C5ADC26F75CJXAGC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WEQDEJJ77C5ADC26F75CJXAGC5","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":"49f8b7bb626ca5b727f8734fd8fb51fbe1babb8d68d031a71175faf781b7edf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-07-11T08:31:54Z","title_canon_sha256":"c602f1205520a0705148a593facf4b9b8fe904854860214baf876f4a074bf02c"},"schema_version":"1.0","source":{"id":"1807.03994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03994","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03994v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03994","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"WEQDEJJ77C5A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEQDEJJ77C5ADC26","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEQDEJJ7","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:0c223028c881dc42fcde996555d3a83af5b82050360d4c4981f84cfb236e74ae","target":"graph","created_at":"2026-05-18T00:10:58Z","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":"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","authors_text":"Gregory Lupton, John Oprea, Mark Grant, Michael Farber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-07-11T08:31:54Z","title":"An upper bound for topological complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03994","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:90e74287717a6599070e1e74def10fdf6263de27682811cfeb7e467fa93f2d6f","target":"record","created_at":"2026-05-18T00:10:58Z","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":"49f8b7bb626ca5b727f8734fd8fb51fbe1babb8d68d031a71175faf781b7edf5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-07-11T08:31:54Z","title_canon_sha256":"c602f1205520a0705148a593facf4b9b8fe904854860214baf876f4a074bf02c"},"schema_version":"1.0","source":{"id":"1807.03994","kind":"arxiv","version":1}},"canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b12032253ff8ba018b5e2ffa24dc061760e89caa4fda50a61a7a13f23d01fc68","first_computed_at":"2026-05-18T00:10:58.375541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:58.375541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vQF5KT636QdmXt6NpFesbgEzk9k3Cj+NWzBCckyPUmSNRLhnOZhONepuU97yqCGCSVwuM1ypZnQf4TR2nWuKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:58.376373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90e74287717a6599070e1e74def10fdf6263de27682811cfeb7e467fa93f2d6f","sha256:0c223028c881dc42fcde996555d3a83af5b82050360d4c4981f84cfb236e74ae"],"state_sha256":"7463b1f8550fa882375da8e58001fc85dfe5406058556a84fc65146c2d941ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jO/Fa28r+6mDq4YfkcyG1uNZEzLc57woTIaPXE9Pzveo5F+EywkaXhZswPKKDaR2VGb1xL1tO3jvs5eYHd3KAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:07:17.390864Z","bundle_sha256":"ea15cb34d43cce247780fbbc640c0c5b5a2135902301a093e22ba170c6d87552"}}