{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:56PWDCKD3FHMMVXSTGSGTZ7V55","short_pith_number":"pith:56PWDCKD","schema_version":"1.0","canonical_sha256":"ef9f618943d94ec656f299a469e7f5ef58e2ba4dffac1c35b302e08c0766e33b","source":{"kind":"arxiv","id":"1503.02940","version":1},"attestation_state":"computed","paper":{"title":"Efficient Query Processing for SPARQL Federations with Replicated Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Gabriela Montoya, Hala Skaf-Molli, Maria-Esther Vidal, Pascal Molli","submitted_at":"2015-03-10T14:57:26Z","abstract_excerpt":"Low reliability and availability of public SPARQL endpoints prevent real-world applications from exploiting all the potential of these querying infras-tructures. Fragmenting data on servers can improve data availability but degrades performance. Replicating fragments can offer new tradeoff between performance and availability. We propose FEDRA, a framework for querying Linked Data that takes advantage of client-side data replication, and performs a source selection algorithm that aims to reduce the number of selected public SPARQL endpoints, execution time, and intermediate results. FEDRA has "},"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":"1503.02940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-10T14:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"fd464e1bf1cc6e4bcaf4e5697ed7db6c4159c781a9a133b8840853f2a56550ac","abstract_canon_sha256":"20e7f4b922caef252e0101857bdcb30b2e88440b7cf005a79fce4d5db68d93e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.697744Z","signature_b64":"V/Qyf2cdJEsok5+KX3+PpsmtkqTUmeo2PTfRaQrH/eKmRAxi2f6eMkv8DjQN9A0vD0PzNQneIldHmksYiU7eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef9f618943d94ec656f299a469e7f5ef58e2ba4dffac1c35b302e08c0766e33b","last_reissued_at":"2026-05-18T02:25:12.697232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.697232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Query Processing for SPARQL Federations with Replicated Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Gabriela Montoya, Hala Skaf-Molli, Maria-Esther Vidal, Pascal Molli","submitted_at":"2015-03-10T14:57:26Z","abstract_excerpt":"Low reliability and availability of public SPARQL endpoints prevent real-world applications from exploiting all the potential of these querying infras-tructures. Fragmenting data on servers can improve data availability but degrades performance. Replicating fragments can offer new tradeoff between performance and availability. We propose FEDRA, a framework for querying Linked Data that takes advantage of client-side data replication, and performs a source selection algorithm that aims to reduce the number of selected public SPARQL endpoints, execution time, and intermediate results. FEDRA has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02940","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":"1503.02940","created_at":"2026-05-18T02:25:12.697310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02940v1","created_at":"2026-05-18T02:25:12.697310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02940","created_at":"2026-05-18T02:25:12.697310+00:00"},{"alias_kind":"pith_short_12","alias_value":"56PWDCKD3FHM","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"56PWDCKD3FHMMVXS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"56PWDCKD","created_at":"2026-05-18T12:29:05.191682+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/56PWDCKD3FHMMVXSTGSGTZ7V55","json":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55.json","graph_json":"https://pith.science/api/pith-number/56PWDCKD3FHMMVXSTGSGTZ7V55/graph.json","events_json":"https://pith.science/api/pith-number/56PWDCKD3FHMMVXSTGSGTZ7V55/events.json","paper":"https://pith.science/paper/56PWDCKD"},"agent_actions":{"view_html":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55","download_json":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55.json","view_paper":"https://pith.science/paper/56PWDCKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02940&json=true","fetch_graph":"https://pith.science/api/pith-number/56PWDCKD3FHMMVXSTGSGTZ7V55/graph.json","fetch_events":"https://pith.science/api/pith-number/56PWDCKD3FHMMVXSTGSGTZ7V55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55/action/storage_attestation","attest_author":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55/action/author_attestation","sign_citation":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55/action/citation_signature","submit_replication":"https://pith.science/pith/56PWDCKD3FHMMVXSTGSGTZ7V55/action/replication_record"}},"created_at":"2026-05-18T02:25:12.697310+00:00","updated_at":"2026-05-18T02:25:12.697310+00:00"}