{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MQRFQJ2KCLHJ4ZPAE43LEOJZ4L","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":"951d93b0f428bcb1ee53c2df7536f1de875ec1e3cf548f57329813672e1df165","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T07:33:32Z","title_canon_sha256":"8a6253f7c1ad057c33e87c6c6f28341c8793f4328b059639299011df82971b6b"},"schema_version":"1.0","source":{"id":"1807.08252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08252","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08252v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08252","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"MQRFQJ2KCLHJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MQRFQJ2KCLHJ4ZPA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MQRFQJ2K","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:ab838ae103e1a9395b3b5c2f4c8bfdda37e43b674b6c66e826fcc745afc40dc8","target":"graph","created_at":"2026-05-18T00:10:08Z","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 minimum stretch spaning tree problem for a grah G is to find a spaning tree T of G such as that the maximum distance in T between two adjacent vertices is minimized. The minimum value of this optimization problem gives rise to a grpah invariant {\\sigma} T(G) called the tree stretch of G. The problem has been studied in the algorithmic aspects, such as NP-hardness and fixed-parameter solvability. This paper presents the exact values {\\sigma} T(G) of hamming graphs Kn1 * Kn2 * ... * Knd and the higer-dimensional grids Pn1 * Pn2 * ... * Pnd.","authors_text":"Lan Lin, Yixun Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T07:33:32Z","title":"Minimum tree-stretch of Hamming graphs and higher-dimensional grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08252","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:7d3d12ea32efc97e500caaeaff920a3790450f266110c1e92700620565c9180e","target":"record","created_at":"2026-05-18T00:10:08Z","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":"951d93b0f428bcb1ee53c2df7536f1de875ec1e3cf548f57329813672e1df165","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T07:33:32Z","title_canon_sha256":"8a6253f7c1ad057c33e87c6c6f28341c8793f4328b059639299011df82971b6b"},"schema_version":"1.0","source":{"id":"1807.08252","kind":"arxiv","version":1}},"canonical_sha256":"642258274a12ce9e65e02736b23939e2d615c33987dca8b9ad5b3fe62470dc9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"642258274a12ce9e65e02736b23939e2d615c33987dca8b9ad5b3fe62470dc9c","first_computed_at":"2026-05-18T00:10:08.740158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:08.740158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGu7b7drGmMeL1OaIiFrtPdnnFoXOBkS2AHF49glV4lQ0J5BValdCduJ8sMzJwTrEckaYQ3cAFHp/z+njy4BAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:08.740734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d3d12ea32efc97e500caaeaff920a3790450f266110c1e92700620565c9180e","sha256:ab838ae103e1a9395b3b5c2f4c8bfdda37e43b674b6c66e826fcc745afc40dc8"],"state_sha256":"16b890991b5c88a6b440294914e02bfad9408b58f2153be6aa3d3aedc6687a6f"}