{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QPLVZF32HZSGZDMQOTGRN24RYD","short_pith_number":"pith:QPLVZF32","schema_version":"1.0","canonical_sha256":"83d75c977a3e646c8d9074cd16eb91c0dbd679b7119fbaad752d1a12d62d57ac","source":{"kind":"arxiv","id":"1701.02991","version":1},"attestation_state":"computed","paper":{"title":"Node-Independent Spanning Trees in Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anton Cerny, Bader AlBdaiwi, Zaid Hussain","submitted_at":"2017-01-11T14:43:05Z","abstract_excerpt":"Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$. Independent spanning trees have applications in fault-tolerant communications and secure message distributions. Gaussian networks and two-dimensional toroidal networks share similar topological characteristics. They are regular of degree four, symmetric, and "},"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":"1701.02991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-11T14:43:05Z","cross_cats_sorted":[],"title_canon_sha256":"56329d9603d7d3411362c145e78793aa4d26b2eedb294c71e2360f318f0dad82","abstract_canon_sha256":"6cb3bc11dbd0eb4a6cb52f29e5d9c226d21e0124f5284cd253616c9ea034be3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:52.772280Z","signature_b64":"9SFl+R1i/8RZDBIkNaXAJpOv4tV9GBWLcmzf183i2hmFekvQyeu5hcpxR69xAcP+3Dm7zufuW+Ukjw49dyXlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d75c977a3e646c8d9074cd16eb91c0dbd679b7119fbaad752d1a12d62d57ac","last_reissued_at":"2026-05-18T00:33:52.771311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:52.771311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node-Independent Spanning Trees in Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anton Cerny, Bader AlBdaiwi, Zaid Hussain","submitted_at":"2017-01-11T14:43:05Z","abstract_excerpt":"Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$. Independent spanning trees have applications in fault-tolerant communications and secure message distributions. Gaussian networks and two-dimensional toroidal networks share similar topological characteristics. They are regular of degree four, symmetric, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02991","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":""},"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":"1701.02991","created_at":"2026-05-18T00:33:52.771756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02991v1","created_at":"2026-05-18T00:33:52.771756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02991","created_at":"2026-05-18T00:33:52.771756+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPLVZF32HZSG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPLVZF32HZSGZDMQ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPLVZF32","created_at":"2026-05-18T12:31:39.905425+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/QPLVZF32HZSGZDMQOTGRN24RYD","json":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD.json","graph_json":"https://pith.science/api/pith-number/QPLVZF32HZSGZDMQOTGRN24RYD/graph.json","events_json":"https://pith.science/api/pith-number/QPLVZF32HZSGZDMQOTGRN24RYD/events.json","paper":"https://pith.science/paper/QPLVZF32"},"agent_actions":{"view_html":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD","download_json":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD.json","view_paper":"https://pith.science/paper/QPLVZF32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02991&json=true","fetch_graph":"https://pith.science/api/pith-number/QPLVZF32HZSGZDMQOTGRN24RYD/graph.json","fetch_events":"https://pith.science/api/pith-number/QPLVZF32HZSGZDMQOTGRN24RYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD/action/storage_attestation","attest_author":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD/action/author_attestation","sign_citation":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD/action/citation_signature","submit_replication":"https://pith.science/pith/QPLVZF32HZSGZDMQOTGRN24RYD/action/replication_record"}},"created_at":"2026-05-18T00:33:52.771756+00:00","updated_at":"2026-05-18T00:33:52.771756+00:00"}