{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HIRU3FWQOZKSXVOA7ZXPKKHABY","short_pith_number":"pith:HIRU3FWQ","schema_version":"1.0","canonical_sha256":"3a234d96d076552bd5c0fe6ef528e00e08b81150db1ab592465d55dbb3d37ba2","source":{"kind":"arxiv","id":"1604.04855","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.04855","created_at":"2026-05-18T00:34:31.760353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04855v3","created_at":"2026-05-18T00:34:31.760353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04855","created_at":"2026-05-18T00:34:31.760353+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIRU3FWQOZKS","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIRU3FWQOZKSXVOA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIRU3FWQ","created_at":"2026-05-18T12:30:19.053100+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/HIRU3FWQOZKSXVOA7ZXPKKHABY","json":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY.json","graph_json":"https://pith.science/api/pith-number/HIRU3FWQOZKSXVOA7ZXPKKHABY/graph.json","events_json":"https://pith.science/api/pith-number/HIRU3FWQOZKSXVOA7ZXPKKHABY/events.json","paper":"https://pith.science/paper/HIRU3FWQ"},"agent_actions":{"view_html":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY","download_json":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY.json","view_paper":"https://pith.science/paper/HIRU3FWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04855&json=true","fetch_graph":"https://pith.science/api/pith-number/HIRU3FWQOZKSXVOA7ZXPKKHABY/graph.json","fetch_events":"https://pith.science/api/pith-number/HIRU3FWQOZKSXVOA7ZXPKKHABY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/action/storage_attestation","attest_author":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/action/author_attestation","sign_citation":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/action/citation_signature","submit_replication":"https://pith.science/pith/HIRU3FWQOZKSXVOA7ZXPKKHABY/action/replication_record"}},"created_at":"2026-05-18T00:34:31.760353+00:00","updated_at":"2026-05-18T00:34:31.760353+00:00"}