{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OF6VGPWJM7LRNXHRO3K7TQ5EC3","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":"d1ac837723bc1c54a918345d86cc235d52ba34e60fbe1516f29bfaa844197914","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T15:41:44Z","title_canon_sha256":"826a45d808745c5ef60698c74e076f795c9659de4d7f15e613e26d7099f8a07d"},"schema_version":"1.0","source":{"id":"2605.23773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23773","created_at":"2026-05-25T02:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23773v1","created_at":"2026-05-25T02:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23773","created_at":"2026-05-25T02:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"OF6VGPWJM7LR","created_at":"2026-05-25T02:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"OF6VGPWJM7LRNXHR","created_at":"2026-05-25T02:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"OF6VGPWJ","created_at":"2026-05-25T02:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:eaf93448cefc2ed3081ed179085327a494bca4ef14fe0434b61966bb216e1747","target":"graph","created_at":"2026-05-25T02:02:31Z","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/2605.23773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the square $n\\times n$ grid has the largest number of spanning trees. The proof starts with the Laplacian product formula, passes to hyperbolic coordinates, and compares logarithms by separating a discrete-concavity term from a positive decreasing residual term.","authors_text":"Jiechen Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T15:41:44Z","title":"A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23773","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:f38f483963f64efc989217f3afbb399e3a5cbfd3f573f8653ba79d7afaf5e2a6","target":"record","created_at":"2026-05-25T02:02:31Z","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":"d1ac837723bc1c54a918345d86cc235d52ba34e60fbe1516f29bfaa844197914","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-22T15:41:44Z","title_canon_sha256":"826a45d808745c5ef60698c74e076f795c9659de4d7f15e613e26d7099f8a07d"},"schema_version":"1.0","source":{"id":"2605.23773","kind":"arxiv","version":1}},"canonical_sha256":"717d533ec967d716dcf176d5f9c3a416dbaf07a760ec0df037b7acd7f78ddca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"717d533ec967d716dcf176d5f9c3a416dbaf07a760ec0df037b7acd7f78ddca7","first_computed_at":"2026-05-25T02:02:31.835084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:31.835084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2cSagWhIJPMnOxcBDh+KZrNvDtkJ48+FIeYVPZlsEPKySia6pO9a4nuVILgubn8jI+vFfNSQgPFBHkGBdMH+BQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:31.835947Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f38f483963f64efc989217f3afbb399e3a5cbfd3f573f8653ba79d7afaf5e2a6","sha256:eaf93448cefc2ed3081ed179085327a494bca4ef14fe0434b61966bb216e1747"],"state_sha256":"46ac95e4710aa285ffc30cb68ffdc1a0226b20670550c906ef979a7ff7d627c5"}