{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UMVZCXYNPPXHVPH2YOR5BY77WS","short_pith_number":"pith:UMVZCXYN","schema_version":"1.0","canonical_sha256":"a32b915f0d7bee7abcfac3a3d0e3ffb4b336134fd440ed6bf72a13751d453962","source":{"kind":"arxiv","id":"2606.16892","version":1},"attestation_state":"computed","paper":{"title":"A Unified Constant-Time Switch Rule for Constructing Edge-Disjoint Hamiltonian Cycles in Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader","submitted_at":"2026-06-15T16:02:36Z","abstract_excerpt":"Gaussian networks are degree-four symmetric interconnection networks defined over residue classes of Gaussian integers. Earlier work showed that when the generator $\\alpha=a+bi$ satisfies $\\gcd(a,b)=1$, the real and imaginary dimensions directly form two edge-disjoint Hamiltonian cycles. A later construction extended the result to the non-coprime case $\\gcd(a,b)=d>1$, but its proof used long node-sequence tables and separate odd/even cases for $d$. This paper gives a unified closed-form construction that covers both $d=1$ and $d>1$, and also covers both odd and even $d$, without separate case "},"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.16892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-15T16:02:36Z","cross_cats_sorted":["cs.DM","cs.IT","cs.NI","math.IT"],"title_canon_sha256":"2c9359370fcb09885f6d09ceace08b5ae3bbbc94ed19a2ea567003e221ef501b","abstract_canon_sha256":"7cdf5bf6e5ca71ac1893a56d03c778e9caaeb023c9dab52f06e3904f2b849833"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:16:31.969216Z","signature_b64":"VqN4R0d1/UNIrEafhfji1RRaYPEwIkFEGiBaYhnvEE0DycK+CfOdBEiN7ytXubNNL4O2/Tzr3/2afU0EHJn/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32b915f0d7bee7abcfac3a3d0e3ffb4b336134fd440ed6bf72a13751d453962","last_reissued_at":"2026-06-30T01:16:31.968641Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:16:31.968641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Constant-Time Switch Rule for Constructing Edge-Disjoint Hamiltonian Cycles in Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader","submitted_at":"2026-06-15T16:02:36Z","abstract_excerpt":"Gaussian networks are degree-four symmetric interconnection networks defined over residue classes of Gaussian integers. Earlier work showed that when the generator $\\alpha=a+bi$ satisfies $\\gcd(a,b)=1$, the real and imaginary dimensions directly form two edge-disjoint Hamiltonian cycles. A later construction extended the result to the non-coprime case $\\gcd(a,b)=d>1$, but its proof used long node-sequence tables and separate odd/even cases for $d$. This paper gives a unified closed-form construction that covers both $d=1$ and $d>1$, and also covers both odd and even $d$, without separate case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.16892","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.16892/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.16892","created_at":"2026-06-30T01:16:31.968714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.16892v1","created_at":"2026-06-30T01:16:31.968714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.16892","created_at":"2026-06-30T01:16:31.968714+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMVZCXYNPPXH","created_at":"2026-06-30T01:16:31.968714+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMVZCXYNPPXHVPH2","created_at":"2026-06-30T01:16:31.968714+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMVZCXYN","created_at":"2026-06-30T01:16:31.968714+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/UMVZCXYNPPXHVPH2YOR5BY77WS","json":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS.json","graph_json":"https://pith.science/api/pith-number/UMVZCXYNPPXHVPH2YOR5BY77WS/graph.json","events_json":"https://pith.science/api/pith-number/UMVZCXYNPPXHVPH2YOR5BY77WS/events.json","paper":"https://pith.science/paper/UMVZCXYN"},"agent_actions":{"view_html":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS","download_json":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS.json","view_paper":"https://pith.science/paper/UMVZCXYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.16892&json=true","fetch_graph":"https://pith.science/api/pith-number/UMVZCXYNPPXHVPH2YOR5BY77WS/graph.json","fetch_events":"https://pith.science/api/pith-number/UMVZCXYNPPXHVPH2YOR5BY77WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS/action/storage_attestation","attest_author":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS/action/author_attestation","sign_citation":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS/action/citation_signature","submit_replication":"https://pith.science/pith/UMVZCXYNPPXHVPH2YOR5BY77WS/action/replication_record"}},"created_at":"2026-06-30T01:16:31.968714+00:00","updated_at":"2026-06-30T01:16:31.968714+00:00"}