{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2KW3YUD7AZSCOVMJEZNDPSB4EG","short_pith_number":"pith:2KW3YUD7","canonical_record":{"source":{"id":"2605.14882","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:27:01Z","cross_cats_sorted":[],"title_canon_sha256":"e8e5f3a3e4959ded6833a5893d4b0108556d3ea8370b84828ab10690efd97560","abstract_canon_sha256":"f7f01be8c7b70f947dc7c52d2988f48fd916aa941ac240a147d00174dc5db4e3"},"schema_version":"1.0"},"canonical_sha256":"d2adbc507f0664275589265a37c83c21b6b0fd180e19726553d0a85d39f36546","source":{"kind":"arxiv","id":"2605.14882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14882","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14882v1","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14882","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"2KW3YUD7AZSC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2KW3YUD7AZSCOVMJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2KW3YUD7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2KW3YUD7AZSCOVMJEZNDPSB4EG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14882","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:27:01Z","cross_cats_sorted":[],"title_canon_sha256":"e8e5f3a3e4959ded6833a5893d4b0108556d3ea8370b84828ab10690efd97560","abstract_canon_sha256":"f7f01be8c7b70f947dc7c52d2988f48fd916aa941ac240a147d00174dc5db4e3"},"schema_version":"1.0"},"canonical_sha256":"d2adbc507f0664275589265a37c83c21b6b0fd180e19726553d0a85d39f36546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:56.033959Z","signature_b64":"5NpjE2HdhBxdoFzzVa/PQVDJEAe1+Lge1XF96jLZ6fH3uAl9VJmPJL96j/jIMwt8YJiZ4DsnIEQZiTJd2abqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2adbc507f0664275589265a37c83c21b6b0fd180e19726553d0a85d39f36546","last_reissued_at":"2026-05-17T23:38:56.033185Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:56.033185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14882","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-17T23:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFKcE0jt3/og5afffG7VkE7UFBLkx7pq5qSEgcn6ndCF2vzdxGTFymW0htyOvh+LlmXSFpQWqMNO/a3kvFOYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:41:54.654182Z"},"content_sha256":"0fe7ef3bce14891271fa29e40090911f918a26313430505a667de144f53c6b64","schema_version":"1.0","event_id":"sha256:0fe7ef3bce14891271fa29e40090911f918a26313430505a667de144f53c6b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2KW3YUD7AZSCOVMJEZNDPSB4EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbation of the largest matching root of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiang-Chao Wan, Yi Wang","submitted_at":"2026-05-14T14:27:01Z","abstract_excerpt":"The largest matching root of a $k$-graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In this paper, we investigate the perturbation of the largest matching root of $k$-graphs. We determine all $k$-graphs whose largest matching root attains the maximum among all $k$-cacti and linear $k$-cacti with a given number of cycles and edges, where a $k$-cactus is a $k$-graph in which every two distinct cycles have at most one vertex in common. To achieve this, we prove that the celebrated shifting operation of $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14882","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-17T23:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQpp8SDogSjvaGt4yrWoOUIo4/Kl4Rp7qThcoMGlrcg8RR9mWH+8QAvcljVC9PJ3n+1ZKnC5JoSgRiNV20kCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:41:54.654775Z"},"content_sha256":"af48107aa77157c54dbd517bfbb1976d91c5866d46d14f1033243edd6a33530a","schema_version":"1.0","event_id":"sha256:af48107aa77157c54dbd517bfbb1976d91c5866d46d14f1033243edd6a33530a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/bundle.json","state_url":"https://pith.science/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/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-07-07T02:41:54Z","links":{"resolver":"https://pith.science/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG","bundle":"https://pith.science/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/bundle.json","state":"https://pith.science/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KW3YUD7AZSCOVMJEZNDPSB4EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2KW3YUD7AZSCOVMJEZNDPSB4EG","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":"f7f01be8c7b70f947dc7c52d2988f48fd916aa941ac240a147d00174dc5db4e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:27:01Z","title_canon_sha256":"e8e5f3a3e4959ded6833a5893d4b0108556d3ea8370b84828ab10690efd97560"},"schema_version":"1.0","source":{"id":"2605.14882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14882","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14882v1","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14882","created_at":"2026-05-17T23:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"2KW3YUD7AZSC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2KW3YUD7AZSCOVMJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2KW3YUD7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:af48107aa77157c54dbd517bfbb1976d91c5866d46d14f1033243edd6a33530a","target":"graph","created_at":"2026-05-17T23:38:56Z","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":"The largest matching root of a $k$-graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In this paper, we investigate the perturbation of the largest matching root of $k$-graphs. We determine all $k$-graphs whose largest matching root attains the maximum among all $k$-cacti and linear $k$-cacti with a given number of cycles and edges, where a $k$-cactus is a $k$-graph in which every two distinct cycles have at most one vertex in common. To achieve this, we prove that the celebrated shifting operation of $k","authors_text":"Jiang-Chao Wan, Yi Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:27:01Z","title":"Perturbation of the largest matching root of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14882","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:0fe7ef3bce14891271fa29e40090911f918a26313430505a667de144f53c6b64","target":"record","created_at":"2026-05-17T23:38:56Z","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":"f7f01be8c7b70f947dc7c52d2988f48fd916aa941ac240a147d00174dc5db4e3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T14:27:01Z","title_canon_sha256":"e8e5f3a3e4959ded6833a5893d4b0108556d3ea8370b84828ab10690efd97560"},"schema_version":"1.0","source":{"id":"2605.14882","kind":"arxiv","version":1}},"canonical_sha256":"d2adbc507f0664275589265a37c83c21b6b0fd180e19726553d0a85d39f36546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2adbc507f0664275589265a37c83c21b6b0fd180e19726553d0a85d39f36546","first_computed_at":"2026-05-17T23:38:56.033185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:56.033185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NpjE2HdhBxdoFzzVa/PQVDJEAe1+Lge1XF96jLZ6fH3uAl9VJmPJL96j/jIMwt8YJiZ4DsnIEQZiTJd2abqDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:56.033959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fe7ef3bce14891271fa29e40090911f918a26313430505a667de144f53c6b64","sha256:af48107aa77157c54dbd517bfbb1976d91c5866d46d14f1033243edd6a33530a"],"state_sha256":"cd453ae1772286cf50c61eb6af41b4548395bdc698d27c6abbc7ce54aef6ed1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1vkwe1KWMUiuPXXBToZm3fFbC9Q8+91xvvCgJJCW4/ALrwH2LOTDr2atHkztgNlGeALPDSSLY6iDAntlbMgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:41:54.657302Z","bundle_sha256":"35e79140a316d0f5a3e2351602fc5fcbf7420559a8974da6b82ad2fb8950ead7"}}