{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3EPA7EENU4BVXOAAPAYGLLIFVH","short_pith_number":"pith:3EPA7EEN","schema_version":"1.0","canonical_sha256":"d91e0f908da7035bb800783065ad05a9ea7dc6877adc44dc3c7fdc3a8be2f870","source":{"kind":"arxiv","id":"1106.1590","version":1},"attestation_state":"computed","paper":{"title":"Scheduling links for heavy traffic on interfering routes in wireless mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fabio R. J. Vieira, Jos\\'e F. de Rezende, Serge Fdida, Valmir C. Barbosa","submitted_at":"2011-06-08T16:17:14Z","abstract_excerpt":"We consider wireless mesh networks and the problem of scheduling the links of a given set of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol provides a background of synchronized time slots and seek to schedule the routes' links to maximize the number of packets that get delivered to their destinations per time slot. Our approach is to construct an undirected graph G and to heuristically obtain node multicolorings for G that can be turned into efficient link schedules. In G each node represents a link to be scheduled and the edges are set up to represent ev"},"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":"1106.1590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-08T16:17:14Z","cross_cats_sorted":[],"title_canon_sha256":"f36bbed30a1b42edfd3db471f7cc10bf5c1fc319a97ec13281b15d600ee4f968","abstract_canon_sha256":"add87b3a44d5ad59f6f9378e71aa8734cf75287bc9cb2fc21e389d3c333ef6c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:28.417407Z","signature_b64":"Bi8VT6A3I43tH/IClIk/wZXhVvxENo18sq6qrMSj5oTgU45br9vp/8rrssPyTPf/ihCF7usr9QuxDc54It09Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d91e0f908da7035bb800783065ad05a9ea7dc6877adc44dc3c7fdc3a8be2f870","last_reissued_at":"2026-05-18T04:00:28.416358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:28.416358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling links for heavy traffic on interfering routes in wireless mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fabio R. J. Vieira, Jos\\'e F. de Rezende, Serge Fdida, Valmir C. Barbosa","submitted_at":"2011-06-08T16:17:14Z","abstract_excerpt":"We consider wireless mesh networks and the problem of scheduling the links of a given set of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol provides a background of synchronized time slots and seek to schedule the routes' links to maximize the number of packets that get delivered to their destinations per time slot. Our approach is to construct an undirected graph G and to heuristically obtain node multicolorings for G that can be turned into efficient link schedules. In G each node represents a link to be scheduled and the edges are set up to represent ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1590","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":"1106.1590","created_at":"2026-05-18T04:00:28.416824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1590v1","created_at":"2026-05-18T04:00:28.416824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1590","created_at":"2026-05-18T04:00:28.416824+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EPA7EENU4BV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EPA7EENU4BVXOAA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EPA7EEN","created_at":"2026-05-18T12:26:18.847500+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/3EPA7EENU4BVXOAAPAYGLLIFVH","json":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH.json","graph_json":"https://pith.science/api/pith-number/3EPA7EENU4BVXOAAPAYGLLIFVH/graph.json","events_json":"https://pith.science/api/pith-number/3EPA7EENU4BVXOAAPAYGLLIFVH/events.json","paper":"https://pith.science/paper/3EPA7EEN"},"agent_actions":{"view_html":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH","download_json":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH.json","view_paper":"https://pith.science/paper/3EPA7EEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1590&json=true","fetch_graph":"https://pith.science/api/pith-number/3EPA7EENU4BVXOAAPAYGLLIFVH/graph.json","fetch_events":"https://pith.science/api/pith-number/3EPA7EENU4BVXOAAPAYGLLIFVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH/action/storage_attestation","attest_author":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH/action/author_attestation","sign_citation":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH/action/citation_signature","submit_replication":"https://pith.science/pith/3EPA7EENU4BVXOAAPAYGLLIFVH/action/replication_record"}},"created_at":"2026-05-18T04:00:28.416824+00:00","updated_at":"2026-05-18T04:00:28.416824+00:00"}