{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MQRFQJ2KCLHJ4ZPAE43LEOJZ4L","short_pith_number":"pith:MQRFQJ2K","schema_version":"1.0","canonical_sha256":"642258274a12ce9e65e02736b23939e2d615c33987dca8b9ad5b3fe62470dc9c","source":{"kind":"arxiv","id":"1807.08252","version":1},"attestation_state":"computed","paper":{"title":"Minimum tree-stretch of Hamming graphs and higher-dimensional grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lan Lin, Yixun Lin","submitted_at":"2018-07-22T07:33:32Z","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."},"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":"1807.08252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T07:33:32Z","cross_cats_sorted":[],"title_canon_sha256":"8a6253f7c1ad057c33e87c6c6f28341c8793f4328b059639299011df82971b6b","abstract_canon_sha256":"951d93b0f428bcb1ee53c2df7536f1de875ec1e3cf548f57329813672e1df165"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.740734Z","signature_b64":"ZGu7b7drGmMeL1OaIiFrtPdnnFoXOBkS2AHF49glV4lQ0J5BValdCduJ8sMzJwTrEckaYQ3cAFHp/z+njy4BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642258274a12ce9e65e02736b23939e2d615c33987dca8b9ad5b3fe62470dc9c","last_reissued_at":"2026-05-18T00:10:08.740158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.740158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum tree-stretch of Hamming graphs and higher-dimensional grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lan Lin, Yixun Lin","submitted_at":"2018-07-22T07:33:32Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08252","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.08252","created_at":"2026-05-18T00:10:08.740245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08252v1","created_at":"2026-05-18T00:10:08.740245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08252","created_at":"2026-05-18T00:10:08.740245+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQRFQJ2KCLHJ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQRFQJ2KCLHJ4ZPA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQRFQJ2K","created_at":"2026-05-18T12:32:40.477152+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/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L","json":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L.json","graph_json":"https://pith.science/api/pith-number/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/graph.json","events_json":"https://pith.science/api/pith-number/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/events.json","paper":"https://pith.science/paper/MQRFQJ2K"},"agent_actions":{"view_html":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L","download_json":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L.json","view_paper":"https://pith.science/paper/MQRFQJ2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08252&json=true","fetch_graph":"https://pith.science/api/pith-number/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/graph.json","fetch_events":"https://pith.science/api/pith-number/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/action/storage_attestation","attest_author":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/action/author_attestation","sign_citation":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/action/citation_signature","submit_replication":"https://pith.science/pith/MQRFQJ2KCLHJ4ZPAE43LEOJZ4L/action/replication_record"}},"created_at":"2026-05-18T00:10:08.740245+00:00","updated_at":"2026-05-18T00:10:08.740245+00:00"}