{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FG3DB2X3LI5XXG5XBWMRB56NMW","short_pith_number":"pith:FG3DB2X3","schema_version":"1.0","canonical_sha256":"29b630eafb5a3b7b9bb70d9910f7cd6580ed0e0b8dd5c28fe41ec153f06d7f9a","source":{"kind":"arxiv","id":"1409.0932","version":2},"attestation_state":"computed","paper":{"title":"On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Jeffrey Wildman, Steven Weber","submitted_at":"2014-09-03T00:43:20Z","abstract_excerpt":"The study of the optimality of low-complexity greedy scheduling techniques in wireless communications networks is a very complex problem. The Local Pooling (LoP) factor provides a single-parameter means of expressing the achievable capacity region (and optimality) of one such scheme, greedy maximal scheduling (GMS). The exact LoP factor for an arbitrary network graph is generally difficult to obtain, but may be evaluated or bounded based on the network graph's particular structure. In this paper, we provide rigorous characterizations of the LoP factor in large networks modeled as Erd\\H{o}s-R\\'"},"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":"1409.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T00:43:20Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"dd6c5c90e8e18541a3b159bafd3a68255d26a0213dc5d53160524f73bf14e21c","abstract_canon_sha256":"07fcba66f2b8299238c154e72c36246747b2d343108f106b0e3408c1b31b1c57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:01.896931Z","signature_b64":"/KeSKenCiZZcqXFMG3nmsH5rcgbmt4D3uToCh0fm1rDm3JlS6jOpGLq70p5kW3GwW0c/+w9R0DzxOQtOAqzYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b630eafb5a3b7b9bb70d9910f7cd6580ed0e0b8dd5c28fe41ec153f06d7f9a","last_reissued_at":"2026-05-18T01:36:01.896507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:01.896507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Jeffrey Wildman, Steven Weber","submitted_at":"2014-09-03T00:43:20Z","abstract_excerpt":"The study of the optimality of low-complexity greedy scheduling techniques in wireless communications networks is a very complex problem. The Local Pooling (LoP) factor provides a single-parameter means of expressing the achievable capacity region (and optimality) of one such scheme, greedy maximal scheduling (GMS). The exact LoP factor for an arbitrary network graph is generally difficult to obtain, but may be evaluated or bounded based on the network graph's particular structure. In this paper, we provide rigorous characterizations of the LoP factor in large networks modeled as Erd\\H{o}s-R\\'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0932","kind":"arxiv","version":2},"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":"1409.0932","created_at":"2026-05-18T01:36:01.896582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0932v2","created_at":"2026-05-18T01:36:01.896582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0932","created_at":"2026-05-18T01:36:01.896582+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG3DB2X3LI5X","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG3DB2X3LI5XXG5X","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG3DB2X3","created_at":"2026-05-18T12:28:28.263976+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/FG3DB2X3LI5XXG5XBWMRB56NMW","json":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW.json","graph_json":"https://pith.science/api/pith-number/FG3DB2X3LI5XXG5XBWMRB56NMW/graph.json","events_json":"https://pith.science/api/pith-number/FG3DB2X3LI5XXG5XBWMRB56NMW/events.json","paper":"https://pith.science/paper/FG3DB2X3"},"agent_actions":{"view_html":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW","download_json":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW.json","view_paper":"https://pith.science/paper/FG3DB2X3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0932&json=true","fetch_graph":"https://pith.science/api/pith-number/FG3DB2X3LI5XXG5XBWMRB56NMW/graph.json","fetch_events":"https://pith.science/api/pith-number/FG3DB2X3LI5XXG5XBWMRB56NMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW/action/storage_attestation","attest_author":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW/action/author_attestation","sign_citation":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW/action/citation_signature","submit_replication":"https://pith.science/pith/FG3DB2X3LI5XXG5XBWMRB56NMW/action/replication_record"}},"created_at":"2026-05-18T01:36:01.896582+00:00","updated_at":"2026-05-18T01:36:01.896582+00:00"}