{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","short_pith_number":"pith:A5THMPH6","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"},"canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","source":{"kind":"arxiv","id":"2607.07404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07404","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07404v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07404","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"A5THMPH6UHK6","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"A5THMPH6UHK6PF3C","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"A5THMPH6","created_at":"2026-07-09T01:20:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","target":"record","payload":{"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"},"canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","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"},"source_kind":"arxiv","source_id":"2607.07404","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-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxDau5j8EE3XViwTGnPnJXOWbrEYV9Bntw0q0ynDF+5gTUePTPbdJ3jcwiHXPnuuc6Q3x4F000mesHHpPpc7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:03:21.234122Z"},"content_sha256":"f235f9bba03436e8adbdb217b06e85ce96f81ab1a85546cc3ce9b766a322564a","schema_version":"1.0","event_id":"sha256:f235f9bba03436e8adbdb217b06e85ce96f81ab1a85546cc3ce9b766a322564a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","target":"graph","payload":{"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"},"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-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/qy/CqBN2P0EcvDnDFiogWQD06OfJ0NVSIFR2b1sJ89lSd5tok0FlIPRwHvl0wW9LQjUCb9c7z5ohEr3wzJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:03:21.234651Z"},"content_sha256":"fb30e870a9658e0b490d17be53a89f98bab1d2f9cf51c97c135f6acfe259edaf","schema_version":"1.0","event_id":"sha256:fb30e870a9658e0b490d17be53a89f98bab1d2f9cf51c97c135f6acfe259edaf"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0097-3165(78) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"L. Lov´ asz. “Kneser’s conjecture, chromatic number, and homotopy”. In:Journal of Combi- natorial Theory, Series A25 (1978), pp. 319–324.doi:https://doi.org/10.1016/0097- 3165(78)90022-5","arxiv_id":"2607.07404","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"L. Lov´ asz. “Kneser’s conjecture, chromatic number, and homotopy”. In:Journal of Combi- natorial Theory, Series A25 (1978), pp. 319–324.doi:https://doi.org/10.1016/0097- 3165(78)90022-5","reconstructed_doi":"10.1016/0097-3165(78"},"severity":"advisory","ref_index":19,"audited_at":"2026-07-09T12:22:02.759831Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0097-3165(78","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9d77f03d62d0520f3092f44ea80b656ced1c13d110f1e51980da99961805b870","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":8836,"payload_sha256":"70b9a6606ab85261eecca0e6870e5a75c36a7f2be53d5f94e441582347177207","signature_b64":"DdyvkuxBpqlczXbT1dr6wbLC1rCAg6E1BPTW6qpxO74XjrUTciRSE/tftzafqC3J5iWSw25k2QwrZKt9/gOODw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T12:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Blf7DTGbnGFyWFyxCVYj8uYfJkbq8Wq/jjyDO4DFAwWAbad1WRTALG/AHNwhjPcgqVXWtoP2zi/259nI8Hz1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:03:21.238207Z"},"content_sha256":"9304102ba4a66113dbc27f9da1ecbd834bbd239353da29ce967568f127cd48b4","schema_version":"1.0","event_id":"sha256:9304102ba4a66113dbc27f9da1ecbd834bbd239353da29ce967568f127cd48b4"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0012-365X(00) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"V. Estivill-Castro, M. Noy, and J. Urrutia. “On the chromatic number of tree graphs”. In: Discrete Mathematics223 (2000), pp. 363–366.doi:https://doi.org/10.1016/S0012- 365X(00)00092-3","arxiv_id":"2607.07404","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"V. Estivill-Castro, M. Noy, and J. Urrutia. “On the chromatic number of tree graphs”. In: Discrete Mathematics223 (2000), pp. 363–366.doi:https://doi.org/10.1016/S0012- 365X(00)00092-3","reconstructed_doi":"10.1016/S0012-365X(00"},"severity":"advisory","ref_index":6,"audited_at":"2026-07-09T12:22:02.759831Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0012-365X(00","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"db13c167d7d76c84127f7dc26508bf183e0218f46e74b1076ddecf424cbd8680","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":8835,"payload_sha256":"d484ff3830f3d29961c669975a959bf530857fdf42b0c681d5299c2746928b72","signature_b64":"oO+26+rs+76dQOqfyXKqGNCxMVZ2t4c5n7gqgevWSi/2JeENpHqcXuoD52HKOAV8C3gpBHTEaNz9qCofek4yBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T12:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHMqnixCfLu6wCvgn+k9RcuDplONKtWPls7+AfPfYuNfLlWuV+HV4tGSFzwocN6NYDl4wQwadC9WuHcGO3FBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:03:21.238612Z"},"content_sha256":"6de770d040bad7111aa5dc64845070f463f1a07051111d8cf9a705961b54943b","schema_version":"1.0","event_id":"sha256:6de770d040bad7111aa5dc64845070f463f1a07051111d8cf9a705961b54943b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/bundle.json","state_url":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5THMPH6UHK6PF3C76WU2UCQTN/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-08-06T13:03:21Z","links":{"resolver":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN","bundle":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/bundle.json","state":"https://pith.science/pith/A5THMPH6UHK6PF3C76WU2UCQTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5THMPH6UHK6PF3C76WU2UCQTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A5THMPH6UHK6PF3C76WU2UCQTN","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df71e3381bcdb028ead6fd0db3cc6e823b8de097443f418dc2104391a1ef3d0e","cross_cats_sorted":["math.AT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:38:19Z","title_canon_sha256":"9d4f1b4e14071c4cc221e789c31db6797fb432d8a0127a9230e5d7a83ada5b1b"},"schema_version":"1.0","source":{"id":"2607.07404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07404","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07404v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07404","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"A5THMPH6UHK6","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"A5THMPH6UHK6PF3C","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"A5THMPH6","created_at":"2026-07-09T01:20:24Z"}],"graph_snapshots":[{"event_id":"sha256:fb30e870a9658e0b490d17be53a89f98bab1d2f9cf51c97c135f6acfe259edaf","target":"graph","created_at":"2026-07-09T01:20:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fabienne Klatt, Iason Papadopoulos, Marc Raffelsiefen","cross_cats":["math.AT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:38:19Z","title":"Network Realignment Complexes over General Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07404","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:f235f9bba03436e8adbdb217b06e85ce96f81ab1a85546cc3ce9b766a322564a","target":"record","created_at":"2026-07-09T01:20:24Z","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":"df71e3381bcdb028ead6fd0db3cc6e823b8de097443f418dc2104391a1ef3d0e","cross_cats_sorted":["math.AT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:38:19Z","title_canon_sha256":"9d4f1b4e14071c4cc221e789c31db6797fb432d8a0127a9230e5d7a83ada5b1b"},"schema_version":"1.0","source":{"id":"2607.07404","kind":"arxiv","version":1}},"canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0766763cfea1d5e79762ffad4d50509b61b5d1eba845bb1d45ad72bd8b15b672","first_computed_at":"2026-07-09T01:20:24.100671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:24.100671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w+BUwKBhKhb1etBwHwkDJjD9yACVPdl0imQw3JwnVv0gmDeBdQd0qGnudAhcBj8m/mTj/JYoiB/hpSKBn5fZDQ==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:24.101074Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07404","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:6de770d040bad7111aa5dc64845070f463f1a07051111d8cf9a705961b54943b","sha256:9304102ba4a66113dbc27f9da1ecbd834bbd239353da29ce967568f127cd48b4"]}],"invalid_events":[],"applied_event_ids":["sha256:f235f9bba03436e8adbdb217b06e85ce96f81ab1a85546cc3ce9b766a322564a","sha256:fb30e870a9658e0b490d17be53a89f98bab1d2f9cf51c97c135f6acfe259edaf"],"state_sha256":"4a06056812624be27e3a6aca00c06dd9926d515aa0ce2266fe08e31a4ec8d62c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhd2Wz8SkuNZxkchCy/wZ6fuYjkzwCQanoPwZkOPB4NFpgoY2YgCeVDRHPECgAcBGx7gwYlD0/fLSoWnohH8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:03:21.241380Z","bundle_sha256":"1c99f4499c69bb7449c626d82186118859f3ac3a5e2b4c3cae3ca8885757dde8"}}