{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74GV3PRRYW7LE5DTU3VSXHJHDF","short_pith_number":"pith:74GV3PRR","schema_version":"1.0","canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","source":{"kind":"arxiv","id":"1806.00659","version":2},"attestation_state":"computed","paper":{"title":"Topological complexity of configuration spaces of fully articulated graphs and banana graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"Daniel L\\\"utgehetmann, David Recio-Mitter","submitted_at":"2018-06-02T16:12:52Z","abstract_excerpt":"In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully articulated graphs and banana graphs. We also complete the computation in the case of trees to include configuration spaces with any number of points, extending a proof of Farber. At the end we show that an unordered configuration space on a graph does not always have the same topological complexity as the corresponding ordered configuration space (not even when they"},"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":"1806.00659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-06-02T16:12:52Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"292a383a075c416255ea1369c8dd01eae4a575c1777cfc0ff3c8ec3143f9a9f5","abstract_canon_sha256":"265a0858766562132900625206a9744582b0cfee6f17a1e77ebae25a4487ef8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:52.836499Z","signature_b64":"zR7jfHjIoyMgiLo/BPvKCTRCsTSAd5oc6e6kDM0iV2vLnqVgdKbzmCdwhaCAfb2SJzMaHhEXsDYHGU58hatlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","last_reissued_at":"2026-05-17T23:48:52.835980Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:52.835980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological complexity of configuration spaces of fully articulated graphs and banana graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.AT","authors_text":"Daniel L\\\"utgehetmann, David Recio-Mitter","submitted_at":"2018-06-02T16:12:52Z","abstract_excerpt":"In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully articulated graphs and banana graphs. We also complete the computation in the case of trees to include configuration spaces with any number of points, extending a proof of Farber. At the end we show that an unordered configuration space on a graph does not always have the same topological complexity as the corresponding ordered configuration space (not even when they"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00659","kind":"arxiv","version":2},"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":"1806.00659","created_at":"2026-05-17T23:48:52.836061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00659v2","created_at":"2026-05-17T23:48:52.836061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00659","created_at":"2026-05-17T23:48:52.836061+00:00"},{"alias_kind":"pith_short_12","alias_value":"74GV3PRRYW7L","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"74GV3PRRYW7LE5DT","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"74GV3PRR","created_at":"2026-05-18T12:32:11.075285+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/74GV3PRRYW7LE5DTU3VSXHJHDF","json":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF.json","graph_json":"https://pith.science/api/pith-number/74GV3PRRYW7LE5DTU3VSXHJHDF/graph.json","events_json":"https://pith.science/api/pith-number/74GV3PRRYW7LE5DTU3VSXHJHDF/events.json","paper":"https://pith.science/paper/74GV3PRR"},"agent_actions":{"view_html":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF","download_json":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF.json","view_paper":"https://pith.science/paper/74GV3PRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00659&json=true","fetch_graph":"https://pith.science/api/pith-number/74GV3PRRYW7LE5DTU3VSXHJHDF/graph.json","fetch_events":"https://pith.science/api/pith-number/74GV3PRRYW7LE5DTU3VSXHJHDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/action/storage_attestation","attest_author":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/action/author_attestation","sign_citation":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/action/citation_signature","submit_replication":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/action/replication_record"}},"created_at":"2026-05-17T23:48:52.836061+00:00","updated_at":"2026-05-17T23:48:52.836061+00:00"}