{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XYOZVC6RONH6QUMJCS7IIPQQIE","short_pith_number":"pith:XYOZVC6R","schema_version":"1.0","canonical_sha256":"be1d9a8bd1734fe8518914be843e104131a22dfddd43ac6c1bac23b257da5e0a","source":{"kind":"arxiv","id":"1703.10446","version":2},"attestation_state":"computed","paper":{"title":"Gelly-Scheduling: Distributed Graph Processing for Network Service Placement in Community Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandre P. Francisco, Felix Freitag, Lu\\'is Veiga, Mennan Selimi, Miguel E. Coimbra","submitted_at":"2017-03-30T12:52:46Z","abstract_excerpt":"Community networks (CNs) have seen an increase in the last fifteen years. Their members contact nodes which operate Internet proxies, web servers, user file storage and video streaming services, to name a few. Detecting communities of nodes with properties (such as co-location) and assessing node eligibility for service placement is thus a key-factor in optimizing the experience of users. We present a novel solution for the problem of service placement as a two-phase approach, based on: 1) community finding using a scalable graph label propagation technique and 2) a decentralized election proc"},"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":"1703.10446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-30T12:52:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8586d5d4c788384cee450215e9748ae15248d16deeb4ee42126b3779c797ee23","abstract_canon_sha256":"9a8861cc67dac42ffc664b7c2f7b3bd75a67031bf4f44741fe113f3ed6e5432b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:39.571920Z","signature_b64":"HJ0nHlDOv9IxKGCUeC/vbm9b/ara3yxFq2D8TqlDMtOqF2n37tb/Hpw0/6L4ikkpW5t8JEtOHpQOr2RbJJMkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be1d9a8bd1734fe8518914be843e104131a22dfddd43ac6c1bac23b257da5e0a","last_reissued_at":"2026-05-18T00:25:39.571354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:39.571354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gelly-Scheduling: Distributed Graph Processing for Network Service Placement in Community Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandre P. Francisco, Felix Freitag, Lu\\'is Veiga, Mennan Selimi, Miguel E. Coimbra","submitted_at":"2017-03-30T12:52:46Z","abstract_excerpt":"Community networks (CNs) have seen an increase in the last fifteen years. Their members contact nodes which operate Internet proxies, web servers, user file storage and video streaming services, to name a few. Detecting communities of nodes with properties (such as co-location) and assessing node eligibility for service placement is thus a key-factor in optimizing the experience of users. We present a novel solution for the problem of service placement as a two-phase approach, based on: 1) community finding using a scalable graph label propagation technique and 2) a decentralized election proc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10446","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":"1703.10446","created_at":"2026-05-18T00:25:39.571430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10446v2","created_at":"2026-05-18T00:25:39.571430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10446","created_at":"2026-05-18T00:25:39.571430+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYOZVC6RONH6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYOZVC6RONH6QUMJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYOZVC6R","created_at":"2026-05-18T12:31:56.362134+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/XYOZVC6RONH6QUMJCS7IIPQQIE","json":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE.json","graph_json":"https://pith.science/api/pith-number/XYOZVC6RONH6QUMJCS7IIPQQIE/graph.json","events_json":"https://pith.science/api/pith-number/XYOZVC6RONH6QUMJCS7IIPQQIE/events.json","paper":"https://pith.science/paper/XYOZVC6R"},"agent_actions":{"view_html":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE","download_json":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE.json","view_paper":"https://pith.science/paper/XYOZVC6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10446&json=true","fetch_graph":"https://pith.science/api/pith-number/XYOZVC6RONH6QUMJCS7IIPQQIE/graph.json","fetch_events":"https://pith.science/api/pith-number/XYOZVC6RONH6QUMJCS7IIPQQIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE/action/storage_attestation","attest_author":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE/action/author_attestation","sign_citation":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE/action/citation_signature","submit_replication":"https://pith.science/pith/XYOZVC6RONH6QUMJCS7IIPQQIE/action/replication_record"}},"created_at":"2026-05-18T00:25:39.571430+00:00","updated_at":"2026-05-18T00:25:39.571430+00:00"}