{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OWW6CYFNEFQEJS3RH4Q53R2ZVV","short_pith_number":"pith:OWW6CYFN","schema_version":"1.0","canonical_sha256":"75ade160ad216044cb713f21ddc759ad581a4ba4618cda5f762d14833bb8e76b","source":{"kind":"arxiv","id":"2606.21134","version":1},"attestation_state":"computed","paper":{"title":"Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Gaussian Broadcast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader","submitted_at":"2026-06-19T06:17:26Z","abstract_excerpt":"Dense Gaussian networks are degree-four algebraic networks with compact diameter and coordinate-based routing. Their diameter-level broadcast trees are efficient but fragile under node, link, and runtime-discovered faults. This paper develops a runtime recovery framework for dense Gaussian broadcast networks under static node/link faults and mixed faults, plus single-link faults discovered live. The method re-roots the source so known node faults become boundary leaves whenever possible, then filters failed links and repairs gaps by connecting healthy components of the pruned tree. For a selec"},"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":"2606.21134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-19T06:17:26Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"611c8756285f32f12e1f45fb9d6648d8a0fa37c878f0f2f83767349b117a8090","abstract_canon_sha256":"b3b24b6c93d7af5921883b7574d67ac899e9b9bad613a9d573068f3d9d55a3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:30.974020Z","signature_b64":"ZpCKMvoHEECA2T2yJSda7wBmxfECX3pqV99pOvQoPd5ZU2SLu4/8WlOigabagguvvrhDGHAeEJe5lY5SVYvfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75ade160ad216044cb713f21ddc759ad581a4ba4618cda5f762d14833bb8e76b","last_reissued_at":"2026-06-23T01:12:30.973585Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:30.973585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Gaussian Broadcast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader","submitted_at":"2026-06-19T06:17:26Z","abstract_excerpt":"Dense Gaussian networks are degree-four algebraic networks with compact diameter and coordinate-based routing. Their diameter-level broadcast trees are efficient but fragile under node, link, and runtime-discovered faults. This paper develops a runtime recovery framework for dense Gaussian broadcast networks under static node/link faults and mixed faults, plus single-link faults discovered live. The method re-roots the source so known node faults become boundary leaves whenever possible, then filters failed links and repairs gaps by connecting healthy components of the pruned tree. For a selec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.21134","created_at":"2026-06-23T01:12:30.973648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21134v1","created_at":"2026-06-23T01:12:30.973648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21134","created_at":"2026-06-23T01:12:30.973648+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWW6CYFNEFQE","created_at":"2026-06-23T01:12:30.973648+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWW6CYFNEFQEJS3R","created_at":"2026-06-23T01:12:30.973648+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWW6CYFN","created_at":"2026-06-23T01:12:30.973648+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/OWW6CYFNEFQEJS3RH4Q53R2ZVV","json":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV.json","graph_json":"https://pith.science/api/pith-number/OWW6CYFNEFQEJS3RH4Q53R2ZVV/graph.json","events_json":"https://pith.science/api/pith-number/OWW6CYFNEFQEJS3RH4Q53R2ZVV/events.json","paper":"https://pith.science/paper/OWW6CYFN"},"agent_actions":{"view_html":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV","download_json":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV.json","view_paper":"https://pith.science/paper/OWW6CYFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21134&json=true","fetch_graph":"https://pith.science/api/pith-number/OWW6CYFNEFQEJS3RH4Q53R2ZVV/graph.json","fetch_events":"https://pith.science/api/pith-number/OWW6CYFNEFQEJS3RH4Q53R2ZVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV/action/storage_attestation","attest_author":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV/action/author_attestation","sign_citation":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV/action/citation_signature","submit_replication":"https://pith.science/pith/OWW6CYFNEFQEJS3RH4Q53R2ZVV/action/replication_record"}},"created_at":"2026-06-23T01:12:30.973648+00:00","updated_at":"2026-06-23T01:12:30.973648+00:00"}