{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","short_pith_number":"pith:A5THMPH6","schema_version":"1.0","canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","source":{"kind":"arxiv","id":"2607.07404","version":1},"attestation_state":"computed","paper":{"title":"Network Realignment Complexes over General Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Fabienne Klatt, Iason Papadopoulos, Marc Raffelsiefen","submitted_at":"2026-07-08T13:38:19Z","abstract_excerpt":"Network realignment complexes were introduced by Kozlov. We generalise their definition to arbitrary connected base graphs.\n  For a connected graph $G$, we characterise the connected components of the associated network realignment complex $X_G$ and show that $X_G$ admits an $\\operatorname{Aut}(G)$-equivariant strong deformation retraction onto the disjoint union of a complete graph and a discrete $\\operatorname{Aut}(G)$-space. For the complete base graph $K_n$, we study the metric structure of the network realignment graph $\\mathcal{G}_n$ and obtain explicit upper and lower bounds for its dia"},"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":"2607.07404","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:38:19Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"9d4f1b4e14071c4cc221e789c31db6797fb432d8a0127a9230e5d7a83ada5b1b","abstract_canon_sha256":"df71e3381bcdb028ead6fd0db3cc6e823b8de097443f418dc2104391a1ef3d0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:24.101074Z","signature_b64":"w+BUwKBhKhb1etBwHwkDJjD9yACVPdl0imQw3JwnVv0gmDeBdQd0qGnudAhcBj8m/mTj/JYoiB/hpSKBn5fZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","last_reissued_at":"2026-07-09T01:20:24.100671Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:24.100671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Realignment Complexes over General Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Fabienne Klatt, Iason Papadopoulos, Marc Raffelsiefen","submitted_at":"2026-07-08T13:38:19Z","abstract_excerpt":"Network realignment complexes were introduced by Kozlov. We generalise their definition to arbitrary connected base graphs.\n  For a connected graph $G$, we characterise the connected components of the associated network realignment complex $X_G$ and show that $X_G$ admits an $\\operatorname{Aut}(G)$-equivariant strong deformation retraction onto the disjoint union of a complete graph and a discrete $\\operatorname{Aut}(G)$-space. For the complete base graph $K_n$, we study the metric structure of the network realignment graph $\\mathcal{G}_n$ and obtain explicit upper and lower bounds for its dia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.07404","created_at":"2026-07-09T01:20:24.100732+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07404v1","created_at":"2026-07-09T01:20:24.100732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07404","created_at":"2026-07-09T01:20:24.100732+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5THMPH6UHK6","created_at":"2026-07-09T01:20:24.100732+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5THMPH6UHK6PF3C","created_at":"2026-07-09T01:20:24.100732+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5THMPH6","created_at":"2026-07-09T01:20:24.100732+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/A5THMPH6UHK6PF3C76WU2UCQTN","json":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN.json","graph_json":"https://pith.science/api/pith-number/A5THMPH6UHK6PF3C76WU2UCQTN/graph.json","events_json":"https://pith.science/api/pith-number/A5THMPH6UHK6PF3C76WU2UCQTN/events.json","paper":"https://pith.science/paper/A5THMPH6"},"agent_actions":{"view_html":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN","download_json":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN.json","view_paper":"https://pith.science/paper/A5THMPH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07404&json=true","fetch_graph":"https://pith.science/api/pith-number/A5THMPH6UHK6PF3C76WU2UCQTN/graph.json","fetch_events":"https://pith.science/api/pith-number/A5THMPH6UHK6PF3C76WU2UCQTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/action/storage_attestation","attest_author":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/action/author_attestation","sign_citation":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/action/citation_signature","submit_replication":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/action/replication_record"}},"created_at":"2026-07-09T01:20:24.100732+00:00","updated_at":"2026-07-09T01:20:24.100732+00:00"}