{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2UWTWNQJZLE3SSA3R5TIJGJCT7","short_pith_number":"pith:2UWTWNQJ","schema_version":"1.0","canonical_sha256":"d52d3b3609cac9b9481b8f668499229ff20f2298abb626e1be2468cda952c100","source":{"kind":"arxiv","id":"2411.14420","version":2},"attestation_state":"computed","paper":{"title":"Aggregating Funnels for Faster Fetch&Add and Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eric Ruppert, Julian Shun, Panagiota Fatourou, Siddhartha Jayanti, Younghun Roh, Yuanhao Wei","submitted_at":"2024-11-21T18:53:58Z","abstract_excerpt":"Many concurrent algorithms require processes to perform fetch-and-add operations on a single memory location, which can be a hot spot of contention. We present a novel algorithm called Aggregating Funnels that reduces this contention by spreading the fetch-and-add operations across multiple memory locations. It aggregates fetch-and-add operations into batches so that the batch can be performed by a single hardware fetch-and-add instruction on one location and all operations in the batch can efficiently compute their results by performing a fetch-and-add instruction on a different location. We "},"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":"2411.14420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-21T18:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"5f8ee4fa8c7c886f9864673d0ba7682b15bf151e746acdb1a54566f5c085c9f7","abstract_canon_sha256":"bc995df35374a7d76a789c256e2be0c056ad71611b28a0b3186e9104259ebb30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:10.178153Z","signature_b64":"+Rts0NFPrAeOyx8RRCOap8JAtXMSvmOnqr1sUTrOV4EVDq2k2koZsdGfe7NQ6HpcCnD+w+ibQAb4CQXvCS4zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d52d3b3609cac9b9481b8f668499229ff20f2298abb626e1be2468cda952c100","last_reissued_at":"2026-07-05T10:22:10.177609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:10.177609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aggregating Funnels for Faster Fetch&Add and Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eric Ruppert, Julian Shun, Panagiota Fatourou, Siddhartha Jayanti, Younghun Roh, Yuanhao Wei","submitted_at":"2024-11-21T18:53:58Z","abstract_excerpt":"Many concurrent algorithms require processes to perform fetch-and-add operations on a single memory location, which can be a hot spot of contention. We present a novel algorithm called Aggregating Funnels that reduces this contention by spreading the fetch-and-add operations across multiple memory locations. It aggregates fetch-and-add operations into batches so that the batch can be performed by a single hardware fetch-and-add instruction on one location and all operations in the batch can efficiently compute their results by performing a fetch-and-add instruction on a different location. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14420","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14420/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14420","created_at":"2026-07-05T10:22:10.177685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14420v2","created_at":"2026-07-05T10:22:10.177685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14420","created_at":"2026-07-05T10:22:10.177685+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UWTWNQJZLE3","created_at":"2026-07-05T10:22:10.177685+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UWTWNQJZLE3SSA3","created_at":"2026-07-05T10:22:10.177685+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UWTWNQJ","created_at":"2026-07-05T10:22:10.177685+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/2UWTWNQJZLE3SSA3R5TIJGJCT7","json":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7.json","graph_json":"https://pith.science/api/pith-number/2UWTWNQJZLE3SSA3R5TIJGJCT7/graph.json","events_json":"https://pith.science/api/pith-number/2UWTWNQJZLE3SSA3R5TIJGJCT7/events.json","paper":"https://pith.science/paper/2UWTWNQJ"},"agent_actions":{"view_html":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7","download_json":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7.json","view_paper":"https://pith.science/paper/2UWTWNQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14420&json=true","fetch_graph":"https://pith.science/api/pith-number/2UWTWNQJZLE3SSA3R5TIJGJCT7/graph.json","fetch_events":"https://pith.science/api/pith-number/2UWTWNQJZLE3SSA3R5TIJGJCT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7/action/storage_attestation","attest_author":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7/action/author_attestation","sign_citation":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7/action/citation_signature","submit_replication":"https://pith.science/pith/2UWTWNQJZLE3SSA3R5TIJGJCT7/action/replication_record"}},"created_at":"2026-07-05T10:22:10.177685+00:00","updated_at":"2026-07-05T10:22:10.177685+00:00"}