{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:74GV3PRRYW7LE5DTU3VSXHJHDF","short_pith_number":"pith:74GV3PRR","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"},"canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","source":{"kind":"arxiv","id":"1806.00659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00659","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00659v2","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00659","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"74GV3PRRYW7L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74GV3PRRYW7LE5DT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74GV3PRR","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:74GV3PRRYW7LE5DTU3VSXHJHDF","target":"record","payload":{"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"},"canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","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"},"source_kind":"arxiv","source_id":"1806.00659","source_version":2,"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-17T23:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9ztO/xyZsjDZvhCGs6QmLB1VHjAFIKUsg1qZQt44VCGLyX8F4K8zZeMlT+VlJ1UsVf9hYyO3rRSIimldsHwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:14:09.482492Z"},"content_sha256":"3fe1a55b2dd975c9f88e2e1c7babf1536b30f3eb908eb1320cfa452a7f1edc79","schema_version":"1.0","event_id":"sha256:3fe1a55b2dd975c9f88e2e1c7babf1536b30f3eb908eb1320cfa452a7f1edc79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:74GV3PRRYW7LE5DTU3VSXHJHDF","target":"graph","payload":{"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"},"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-17T23:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEKQccE/WLgno+2Zw7QDctEf8sTnOTA1+1LMnmBTgZTUh+Wc/6lmrCzeF5eo9XawhDM3LKg4H1eHlmhalNP0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:14:09.482834Z"},"content_sha256":"c7a342bebcada5252113787e899eef4a386a7a1aaca48dabe1bf2efe2b4c58bf","schema_version":"1.0","event_id":"sha256:c7a342bebcada5252113787e899eef4a386a7a1aaca48dabe1bf2efe2b4c58bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/bundle.json","state_url":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/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-27T21:14:09Z","links":{"resolver":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF","bundle":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/bundle.json","state":"https://pith.science/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74GV3PRRYW7LE5DTU3VSXHJHDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74GV3PRRYW7LE5DTU3VSXHJHDF","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":"265a0858766562132900625206a9744582b0cfee6f17a1e77ebae25a4487ef8f","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-06-02T16:12:52Z","title_canon_sha256":"292a383a075c416255ea1369c8dd01eae4a575c1777cfc0ff3c8ec3143f9a9f5"},"schema_version":"1.0","source":{"id":"1806.00659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00659","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00659v2","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00659","created_at":"2026-05-17T23:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"74GV3PRRYW7L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74GV3PRRYW7LE5DT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74GV3PRR","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:c7a342bebcada5252113787e899eef4a386a7a1aaca48dabe1bf2efe2b4c58bf","target":"graph","created_at":"2026-05-17T23:48:52Z","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 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","authors_text":"Daniel L\\\"utgehetmann, David Recio-Mitter","cross_cats":["math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-06-02T16:12:52Z","title":"Topological complexity of configuration spaces of fully articulated graphs and banana graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00659","kind":"arxiv","version":2},"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:3fe1a55b2dd975c9f88e2e1c7babf1536b30f3eb908eb1320cfa452a7f1edc79","target":"record","created_at":"2026-05-17T23:48:52Z","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":"265a0858766562132900625206a9744582b0cfee6f17a1e77ebae25a4487ef8f","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2018-06-02T16:12:52Z","title_canon_sha256":"292a383a075c416255ea1369c8dd01eae4a575c1777cfc0ff3c8ec3143f9a9f5"},"schema_version":"1.0","source":{"id":"1806.00659","kind":"arxiv","version":2}},"canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff0d5dbe31c5beb27473a6eb2b9d27194a53c701cddd4a260b68350454f19e21","first_computed_at":"2026-05-17T23:48:52.835980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:52.835980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zR7jfHjIoyMgiLo/BPvKCTRCsTSAd5oc6e6kDM0iV2vLnqVgdKbzmCdwhaCAfb2SJzMaHhEXsDYHGU58hatlCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:52.836499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fe1a55b2dd975c9f88e2e1c7babf1536b30f3eb908eb1320cfa452a7f1edc79","sha256:c7a342bebcada5252113787e899eef4a386a7a1aaca48dabe1bf2efe2b4c58bf"],"state_sha256":"68fa5d1bbc153e2a319b6c38082c7437d30cf37236d8cfa9f391ae1e0b28445d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAaXGvd1enb95re6UbSLmJ6sZExQiMi4Ige2DM6K3x0DRjoc3u7G3Ou5P46bNQQUIjnfIeIOdS7C7sU8A0FCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:14:09.484695Z","bundle_sha256":"5b01a60b208fcb5b667bbffdf31d5e42d35761b67a79d952d9369cf2b3ad4acf"}}