{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SILCJHXNKGEGAEZXE4A3AJBRF7","short_pith_number":"pith:SILCJHXN","schema_version":"1.0","canonical_sha256":"9216249eed51886013372701b024312fd85ccb6221ffb5bc3b4116594c3060ba","source":{"kind":"arxiv","id":"1203.4069","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.4069","created_at":"2026-05-18T03:59:48.349702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4069v1","created_at":"2026-05-18T03:59:48.349702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4069","created_at":"2026-05-18T03:59:48.349702+00:00"},{"alias_kind":"pith_short_12","alias_value":"SILCJHXNKGEG","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SILCJHXNKGEGAEZX","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SILCJHXN","created_at":"2026-05-18T12:27:20.899486+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/SILCJHXNKGEGAEZXE4A3AJBRF7","json":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7.json","graph_json":"https://pith.science/api/pith-number/SILCJHXNKGEGAEZXE4A3AJBRF7/graph.json","events_json":"https://pith.science/api/pith-number/SILCJHXNKGEGAEZXE4A3AJBRF7/events.json","paper":"https://pith.science/paper/SILCJHXN"},"agent_actions":{"view_html":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7","download_json":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7.json","view_paper":"https://pith.science/paper/SILCJHXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4069&json=true","fetch_graph":"https://pith.science/api/pith-number/SILCJHXNKGEGAEZXE4A3AJBRF7/graph.json","fetch_events":"https://pith.science/api/pith-number/SILCJHXNKGEGAEZXE4A3AJBRF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/action/storage_attestation","attest_author":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/action/author_attestation","sign_citation":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/action/citation_signature","submit_replication":"https://pith.science/pith/SILCJHXNKGEGAEZXE4A3AJBRF7/action/replication_record"}},"created_at":"2026-05-18T03:59:48.349702+00:00","updated_at":"2026-05-18T03:59:48.349702+00:00"}