{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HIRU3FWQOZKSXVOA7ZXPKKHABY","short_pith_number":"pith:HIRU3FWQ","canonical_record":{"source":{"id":"1604.04855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T09:42:38Z","cross_cats_sorted":["cs.NI","math.CO"],"title_canon_sha256":"65e65c868332b3470d857b152ef7905ffba3e30abd5d1f38bef152dd4d3f7953","abstract_canon_sha256":"656cd8ea0eab72a615be25e6d3ed1950e9de0bb60b9bb310e79b6fae6aca6f8c"},"schema_version":"1.0"},"canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","source":{"kind":"arxiv","id":"1604.04855","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04855","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04855v3","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04855","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"HIRU3FWQOZKS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIRU3FWQOZKSXVOA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIRU3FWQ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HIRU3FWQOZKSXVOA7ZXPKKHABY","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T09:42:38Z","cross_cats_sorted":["cs.NI","math.CO"],"title_canon_sha256":"65e65c868332b3470d857b152ef7905ffba3e30abd5d1f38bef152dd4d3f7953","abstract_canon_sha256":"656cd8ea0eab72a615be25e6d3ed1950e9de0bb60b9bb310e79b6fae6aca6f8c"},"schema_version":"1.0"},"canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.760679Z","signature_b64":"d47oJhHH91GbBIBqXBStNoXCEN3rJrM5stj8YSi/0nJs5yikiRxA84OxM6EMSISGaGNJGeGk0EPj5C7hAGaRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","last_reissued_at":"2026-05-18T00:34:31.760258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.760258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04855","source_version":3,"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CImZqHc0eoKdx+N0IH83xEqCoWNOIoiVGodSPapCL/mxtRpYV3m9hHgFBn8lVbkB31bFbY3JmkIlZzGvRjiZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:28:06.987769Z"},"content_sha256":"a39604e0aee797e668625fd35500146e4118c10443c75b482999847900110123","schema_version":"1.0","event_id":"sha256:a39604e0aee797e668625fd35500146e4118c10443c75b482999847900110123"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HIRU3FWQOZKSXVOA7ZXPKKHABY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault tolerant supergraphs with automorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.CO"],"primary_cat":"cs.DM","authors_text":"Ashwin Ganesan","submitted_at":"2016-04-17T09:42:38Z","abstract_excerpt":"Given a graph $Y$ on $n$ vertices and a desired level of fault-tolerance $k$, an objective in fault-tolerant system design is to construct a supergraph $X$ on $n + k$ vertices such that the removal of any $k$ nodes from $X$ leaves a graph containing $Y$. In order to reconfigure around faults when they occur, it is also required that any two subsets of $k$ nodes of $X$ are in the same orbit of the action of its automorphism group. In this paper, we prove that such a supergraph must be the complete graph. This implies that it is very expensive to have an interconnection network which is $k$-faul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04855","kind":"arxiv","version":3},"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Slz3gnzuShSnCa+uTKYxx8314uj9TfGjoXfFSRWuDMPL9RRvL01zB6uv6aaVxxG35yWvFmFuPEpG6O8uodn6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:28:06.988442Z"},"content_sha256":"8435ec1a77a18e3f7031b6a8bfb15467f5c66edc708d314d414b7d8a60d1bd63","schema_version":"1.0","event_id":"sha256:8435ec1a77a18e3f7031b6a8bfb15467f5c66edc708d314d414b7d8a60d1bd63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/bundle.json","state_url":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/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-11T21:28:06Z","links":{"resolver":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY","bundle":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/bundle.json","state":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HIRU3FWQOZKSXVOA7ZXPKKHABY","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":"656cd8ea0eab72a615be25e6d3ed1950e9de0bb60b9bb310e79b6fae6aca6f8c","cross_cats_sorted":["cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T09:42:38Z","title_canon_sha256":"65e65c868332b3470d857b152ef7905ffba3e30abd5d1f38bef152dd4d3f7953"},"schema_version":"1.0","source":{"id":"1604.04855","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04855","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04855v3","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04855","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"HIRU3FWQOZKS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIRU3FWQOZKSXVOA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIRU3FWQ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:8435ec1a77a18e3f7031b6a8bfb15467f5c66edc708d314d414b7d8a60d1bd63","target":"graph","created_at":"2026-05-18T00:34:31Z","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":"Given a graph $Y$ on $n$ vertices and a desired level of fault-tolerance $k$, an objective in fault-tolerant system design is to construct a supergraph $X$ on $n + k$ vertices such that the removal of any $k$ nodes from $X$ leaves a graph containing $Y$. In order to reconfigure around faults when they occur, it is also required that any two subsets of $k$ nodes of $X$ are in the same orbit of the action of its automorphism group. In this paper, we prove that such a supergraph must be the complete graph. This implies that it is very expensive to have an interconnection network which is $k$-faul","authors_text":"Ashwin Ganesan","cross_cats":["cs.NI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T09:42:38Z","title":"Fault tolerant supergraphs with automorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04855","kind":"arxiv","version":3},"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:a39604e0aee797e668625fd35500146e4118c10443c75b482999847900110123","target":"record","created_at":"2026-05-18T00:34:31Z","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":"656cd8ea0eab72a615be25e6d3ed1950e9de0bb60b9bb310e79b6fae6aca6f8c","cross_cats_sorted":["cs.NI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-17T09:42:38Z","title_canon_sha256":"65e65c868332b3470d857b152ef7905ffba3e30abd5d1f38bef152dd4d3f7953"},"schema_version":"1.0","source":{"id":"1604.04855","kind":"arxiv","version":3}},"canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","first_computed_at":"2026-05-18T00:34:31.760258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:31.760258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d47oJhHH91GbBIBqXBStNoXCEN3rJrM5stj8YSi/0nJs5yikiRxA84OxM6EMSISGaGNJGeGk0EPj5C7hAGaRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:31.760679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04855","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a39604e0aee797e668625fd35500146e4118c10443c75b482999847900110123","sha256:8435ec1a77a18e3f7031b6a8bfb15467f5c66edc708d314d414b7d8a60d1bd63"],"state_sha256":"39ce4873c440fa4a4a5bf305f149438a0ec79d9c7ae82c7aa2bdf036039d3ddf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oinWzinXlJDcrfz3kmGXL0+14Gqbc+CqGF/UooPBePObIo7aVoy67ZBpU1lqLVDqnzvQONnylwBBTqcqMea0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:28:06.993036Z","bundle_sha256":"03fda8bca6aa6770057d638b73033fa17906fa6be9ea4f27e4923019fad1023f"}}