{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T2SVEDDWZYMFKQX2Z45Q2FOTWY","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":"6ec6d3d6e431c04a60eb4127be86142f1fdd90b98018e085be060e1857ee6c85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T07:56:46Z","title_canon_sha256":"a30eb647ee5208d4ea1c6e7a15bae7a33ebe955b427022c19a13dc7c745c5d97"},"schema_version":"1.0","source":{"id":"1902.03391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03391","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03391v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03391","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"T2SVEDDWZYMF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T2SVEDDWZYMFKQX2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T2SVEDDW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:026e82cc9cffa5063737faa188d880237dc117a189692f9bed963d9492aea59b","target":"graph","created_at":"2026-05-17T23:54:20Z","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":"One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding problem. In this paper we compute the lower bound for dilation and congestion of embedding onto wheel-like networks. Further, we compute the exact dilation of embedding wheel-like networks into hypertrees, proving that the lower bound obtained is sharp. Again, we compute the exact congestion of embedding windmill graphs into circulant graphs, proving tha","authors_text":"A. Arul Shantrinal, K. Jagadeesh Kumar, R. Sundara Rajan, Sudeep Stephen, T.M. Rajalaxmi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T07:56:46Z","title":"Embedding onto Wheel-like Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03391","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:7a317d93235edc001c69b3da759db9528b17af76532442f92f7d0d185e0772fe","target":"record","created_at":"2026-05-17T23:54:20Z","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":"6ec6d3d6e431c04a60eb4127be86142f1fdd90b98018e085be060e1857ee6c85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T07:56:46Z","title_canon_sha256":"a30eb647ee5208d4ea1c6e7a15bae7a33ebe955b427022c19a13dc7c745c5d97"},"schema_version":"1.0","source":{"id":"1902.03391","kind":"arxiv","version":1}},"canonical_sha256":"9ea5520c76ce185542facf3b0d15d3b6006562a86883c88644fbc2ca64baee1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ea5520c76ce185542facf3b0d15d3b6006562a86883c88644fbc2ca64baee1d","first_computed_at":"2026-05-17T23:54:20.981580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:20.981580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oHRLplNAPQ/mtsvv50V7DVcqg20RdxLJnJrgiP94SblZWiNLrkRsFkE5Fk9QLftzSNVlBJ4Yqy2GDe91W93VAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:20.982228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a317d93235edc001c69b3da759db9528b17af76532442f92f7d0d185e0772fe","sha256:026e82cc9cffa5063737faa188d880237dc117a189692f9bed963d9492aea59b"],"state_sha256":"289ec20b3fe75389482d0e9dcf0286ab25e0c83fe75c61bd139a96e87b1ea268"}