{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UTKFMLOQLYP33ZD7R7WVZ7WWXK","short_pith_number":"pith:UTKFMLOQ","canonical_record":{"source":{"id":"1403.2749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-11T20:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"0f5e13a27d683c9aaa9a39051e0065ebae46fd40214f340595f277d757ad8ab9","abstract_canon_sha256":"41e4cbcd9e787569f5713568f778e7a252753db543230c3c1a94871bd5361417"},"schema_version":"1.0"},"canonical_sha256":"a4d4562dd05e1fbde47f8fed5cfed6ba9d6ad6537666f95cc731c5856614721b","source":{"kind":"arxiv","id":"1403.2749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2749","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2749v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2749","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"UTKFMLOQLYP3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UTKFMLOQLYP33ZD7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UTKFMLOQ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UTKFMLOQLYP33ZD7R7WVZ7WWXK","target":"record","payload":{"canonical_record":{"source":{"id":"1403.2749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-11T20:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"0f5e13a27d683c9aaa9a39051e0065ebae46fd40214f340595f277d757ad8ab9","abstract_canon_sha256":"41e4cbcd9e787569f5713568f778e7a252753db543230c3c1a94871bd5361417"},"schema_version":"1.0"},"canonical_sha256":"a4d4562dd05e1fbde47f8fed5cfed6ba9d6ad6537666f95cc731c5856614721b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:34.245935Z","signature_b64":"dfGkiWNTHDWRtl0q+CNZ08ZXQKc2U/RrnmGV+wCv/+E8EBCHbugGysLGEd49hVhGFEDWbMlz/3AdDOmX9WD7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d4562dd05e1fbde47f8fed5cfed6ba9d6ad6537666f95cc731c5856614721b","last_reissued_at":"2026-05-18T02:56:34.245127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:34.245127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.2749","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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OazIeysbwEg6ztVJCVC941mo6DqYhTk5YYbQj45WQDPb18FWBH6zg/kTyf/RVzwOhjD7xTh1Gve1uoYdYu/PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:09:47.313084Z"},"content_sha256":"5bac1f9a585be9df4305634aaece3438b3ad4d868f6b124a0510eba0548be724","schema_version":"1.0","event_id":"sha256:5bac1f9a585be9df4305634aaece3438b3ad4d868f6b124a0510eba0548be724"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UTKFMLOQLYP33ZD7R7WVZ7WWXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding multidimensional grids into optimal hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Pritikin, I.H. Sudborough, Zevi Miller","submitted_at":"2014-03-11T20:45:51Z","abstract_excerpt":"Let $G$ and $H$ be graphs, with $|V(H)|\\geq |V(G)| $, and $f:V(G)\\rightarrow V(H)$ a one to one map of their vertices. Let $dilation(f) = max\\{ dist_{H}(f(x),f(y)): xy\\in E(G) \\}$, where $dist_{H}(v,w)$ is the distance between vertices $v$ and $w$ of $H$. Now let $B(G,H)$ = $min_{f}\\{ dilation(f) \\}$, over all such maps $f$.\n  The parameter $B(G,H)$ is a generalization of the classic and well studied \"bandwidth\" of $G$, defined as $B(G,P(n))$, where $P(n)$ is the path on $n$ points and $n = |V(G)|$. Let $[a_{1}\\times a_{2}\\times \\cdots \\times a_{k} ]$ be the $k$-dimensional grid graph with int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2749","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-18T02:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2Bmxsb/EmOwo8CS1Vve2uKU3RvmgbWwWC1fM4p5G+J7+vNY0NPq4xvC1Lx1LSl70XodCKEGGwA3N57h0OwqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:09:47.313877Z"},"content_sha256":"2c5026dbeb3eb233c1c15d6bc43e213277e7f5e8346e27b2b14d33de5e6fbdfc","schema_version":"1.0","event_id":"sha256:2c5026dbeb3eb233c1c15d6bc43e213277e7f5e8346e27b2b14d33de5e6fbdfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/bundle.json","state_url":"https://pith.science/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/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-06-09T04:09:47Z","links":{"resolver":"https://pith.science/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK","bundle":"https://pith.science/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/bundle.json","state":"https://pith.science/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTKFMLOQLYP33ZD7R7WVZ7WWXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UTKFMLOQLYP33ZD7R7WVZ7WWXK","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":"41e4cbcd9e787569f5713568f778e7a252753db543230c3c1a94871bd5361417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-11T20:45:51Z","title_canon_sha256":"0f5e13a27d683c9aaa9a39051e0065ebae46fd40214f340595f277d757ad8ab9"},"schema_version":"1.0","source":{"id":"1403.2749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2749","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2749v1","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2749","created_at":"2026-05-18T02:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"UTKFMLOQLYP3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UTKFMLOQLYP33ZD7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UTKFMLOQ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:2c5026dbeb3eb233c1c15d6bc43e213277e7f5e8346e27b2b14d33de5e6fbdfc","target":"graph","created_at":"2026-05-18T02:56:34Z","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":"Let $G$ and $H$ be graphs, with $|V(H)|\\geq |V(G)| $, and $f:V(G)\\rightarrow V(H)$ a one to one map of their vertices. Let $dilation(f) = max\\{ dist_{H}(f(x),f(y)): xy\\in E(G) \\}$, where $dist_{H}(v,w)$ is the distance between vertices $v$ and $w$ of $H$. Now let $B(G,H)$ = $min_{f}\\{ dilation(f) \\}$, over all such maps $f$.\n  The parameter $B(G,H)$ is a generalization of the classic and well studied \"bandwidth\" of $G$, defined as $B(G,P(n))$, where $P(n)$ is the path on $n$ points and $n = |V(G)|$. Let $[a_{1}\\times a_{2}\\times \\cdots \\times a_{k} ]$ be the $k$-dimensional grid graph with int","authors_text":"Dan Pritikin, I.H. Sudborough, Zevi Miller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-11T20:45:51Z","title":"Embedding multidimensional grids into optimal hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2749","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:5bac1f9a585be9df4305634aaece3438b3ad4d868f6b124a0510eba0548be724","target":"record","created_at":"2026-05-18T02:56:34Z","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":"41e4cbcd9e787569f5713568f778e7a252753db543230c3c1a94871bd5361417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-11T20:45:51Z","title_canon_sha256":"0f5e13a27d683c9aaa9a39051e0065ebae46fd40214f340595f277d757ad8ab9"},"schema_version":"1.0","source":{"id":"1403.2749","kind":"arxiv","version":1}},"canonical_sha256":"a4d4562dd05e1fbde47f8fed5cfed6ba9d6ad6537666f95cc731c5856614721b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4d4562dd05e1fbde47f8fed5cfed6ba9d6ad6537666f95cc731c5856614721b","first_computed_at":"2026-05-18T02:56:34.245127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:34.245127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dfGkiWNTHDWRtl0q+CNZ08ZXQKc2U/RrnmGV+wCv/+E8EBCHbugGysLGEd49hVhGFEDWbMlz/3AdDOmX9WD7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:34.245935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bac1f9a585be9df4305634aaece3438b3ad4d868f6b124a0510eba0548be724","sha256:2c5026dbeb3eb233c1c15d6bc43e213277e7f5e8346e27b2b14d33de5e6fbdfc"],"state_sha256":"b7b31e184cff735830c3e97142b15963317032535067ba2accf0b156b050c3af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Sekp5T58C//kwnP/qdcRqx3L5xjRRvfQ0DQCWmTp6wFQ4UBo8P2DWxAWZJs83puA3Uo5aOX8tG7EfyCPNy0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:09:47.318079Z","bundle_sha256":"b4c62ec9b69a118700112613ae8a2a25030b398a1ad834c3298a06ac635f4ff9"}}