{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SILCJHXNKGEGAEZXE4A3AJBRF7","short_pith_number":"pith:SILCJHXN","canonical_record":{"source":{"id":"1203.4069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-19T10:01:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dffab754e50b22b31e07bf80ed107891660e23dae2bc62d84f518969e3736256","abstract_canon_sha256":"51c7bd2c3f172ea74fa44b740dedb907cd854f3401fdbd50deae17b6ae1f9c0f"},"schema_version":"1.0"},"canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","source":{"kind":"arxiv","id":"1203.4069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4069","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4069v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4069","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"SILCJHXNKGEG","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SILCJHXNKGEGAEZX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SILCJHXN","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SILCJHXNKGEGAEZXE4A3AJBRF7","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-19T10:01:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dffab754e50b22b31e07bf80ed107891660e23dae2bc62d84f518969e3736256","abstract_canon_sha256":"51c7bd2c3f172ea74fa44b740dedb907cd854f3401fdbd50deae17b6ae1f9c0f"},"schema_version":"1.0"},"canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.350073Z","signature_b64":"Kgd6kEmT5fwbBbUcZ1ffLn3fzYmnzq9hPgxf7Hldr0ztZochR5DAfN45LOTc72JINfnMEYHKIq2tr/EGJG9jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","last_reissued_at":"2026-05-18T03:59:48.349641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.349641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4069","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-18T03:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Se6cXYfZreSvJf7vn1y4SzX8JJ62duY/6YNz5a4XnuLHZr5/HGzcfRjdXb6EQbaXEgT7fB3WZ8g+TR9oyvUWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:28:35.602703Z"},"content_sha256":"6cb2a1a6d188d61f66ee54bd51d4b1705846cabd9f8070ab897a05eed5abedd2","schema_version":"1.0","event_id":"sha256:6cb2a1a6d188d61f66ee54bd51d4b1705846cabd9f8070ab897a05eed5abedd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SILCJHXNKGEGAEZXE4A3AJBRF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hebert Perez-Roses, Joe Ryan, Mirka Miller","submitted_at":"2012-03-19T10:01:50Z","abstract_excerpt":"The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\\Delta$ and the diameter $D$, was introduced in \\cite{maxddbs}, as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a $k$-dimensional mesh. We provide some general bounds for the order of the largest subgraph in arbitrary dimension $k$, and for the particular cases of $k=3, \\Delta = 4$ and $k=2, \\Delta = 3$, we give constructions t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4069","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-18T03:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKPrtwbxG1IkjNxDlimuLKGQh20blDPHrYAQ9Ag60GuRCdJUwQwHjEdnWKdFNWs768xAijhm8oDGnWoQ6vYoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:28:35.603389Z"},"content_sha256":"b81da53e4a04b1da23dfab3906d580ff94f0aaf4d794ca8941d68f126d4dcb84","schema_version":"1.0","event_id":"sha256:b81da53e4a04b1da23dfab3906d580ff94f0aaf4d794ca8941d68f126d4dcb84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/bundle.json","state_url":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/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-05-31T17:28:35Z","links":{"resolver":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7","bundle":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/bundle.json","state":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SILCJHXNKGEGAEZXE4A3AJBRF7","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":"51c7bd2c3f172ea74fa44b740dedb907cd854f3401fdbd50deae17b6ae1f9c0f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-19T10:01:50Z","title_canon_sha256":"dffab754e50b22b31e07bf80ed107891660e23dae2bc62d84f518969e3736256"},"schema_version":"1.0","source":{"id":"1203.4069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4069","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4069v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4069","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"SILCJHXNKGEG","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SILCJHXNKGEGAEZX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SILCJHXN","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:b81da53e4a04b1da23dfab3906d580ff94f0aaf4d794ca8941d68f126d4dcb84","target":"graph","created_at":"2026-05-18T03:59:48Z","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 problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\\Delta$ and the diameter $D$, was introduced in \\cite{maxddbs}, as a generalization of the Degree-Diameter Problem. A case of special interest is when the host graph is a common parallel architecture. Here we discuss the case when the host graph is a $k$-dimensional mesh. We provide some general bounds for the order of the largest subgraph in arbitrary dimension $k$, and for the particular cases of $k=3, \\Delta = 4$ and $k=2, \\Delta = 3$, we give constructions t","authors_text":"Hebert Perez-Roses, Joe Ryan, Mirka Miller","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-19T10:01:50Z","title":"The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4069","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:6cb2a1a6d188d61f66ee54bd51d4b1705846cabd9f8070ab897a05eed5abedd2","target":"record","created_at":"2026-05-18T03:59:48Z","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":"51c7bd2c3f172ea74fa44b740dedb907cd854f3401fdbd50deae17b6ae1f9c0f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-19T10:01:50Z","title_canon_sha256":"dffab754e50b22b31e07bf80ed107891660e23dae2bc62d84f518969e3736256"},"schema_version":"1.0","source":{"id":"1203.4069","kind":"arxiv","version":1}},"canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","first_computed_at":"2026-05-18T03:59:48.349641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:48.349641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kgd6kEmT5fwbBbUcZ1ffLn3fzYmnzq9hPgxf7Hldr0ztZochR5DAfN45LOTc72JINfnMEYHKIq2tr/EGJG9jAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:48.350073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cb2a1a6d188d61f66ee54bd51d4b1705846cabd9f8070ab897a05eed5abedd2","sha256:b81da53e4a04b1da23dfab3906d580ff94f0aaf4d794ca8941d68f126d4dcb84"],"state_sha256":"6b8d2f08182672d072d23419626f3cac625b576933479d99799ade2bcdd795b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ipk8zC4MPjFjP/qBGasSq6LC1ofYYsO1mVWN52+sJbulGPe1ldPya5fYcSlOnqnKTkwqVosJrgAc8eXTZx5ACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:28:35.606859Z","bundle_sha256":"7f51a070aab9ce8215117bd5db5a9b2c4c5d4b1aabaad1f1fe5e8a3ada39bbe5"}}