{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7FGA5KNXNSGVDBELEGOGSOZC6Q","short_pith_number":"pith:7FGA5KNX","schema_version":"1.0","canonical_sha256":"f94c0ea9b76c8d51848b219c693b22f41f2f4078d4b51fa7fb4605fad0264459","source":{"kind":"arxiv","id":"1309.3783","version":1},"attestation_state":"computed","paper":{"title":"SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.CO","cs.DC"],"primary_cat":"astro-ph.IM","authors_text":"Aidan B. G. Chalk, Matthieu Schaller, Pedro Gonnet, Tom Theuns","submitted_at":"2013-09-15T17:53:42Z","abstract_excerpt":"This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions, and a task-based formulation. It is shown to be faster than traditional tree-based codes, and to scale better than domain decomposition-based approaches on shared-memory parallel architectures such as multi-cores."},"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":"1309.3783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2013-09-15T17:53:42Z","cross_cats_sorted":["astro-ph.CO","cs.DC"],"title_canon_sha256":"93b2054440b97a3f6b66ff30a9356c84d63e95807307ba830150194968c84090","abstract_canon_sha256":"166af0d7f6eb711f025f7ed0492041c6c673ffbbce151ca4ff3914c75b186b3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.562784Z","signature_b64":"VdPPcMM3pB+mFWnK1EdSFX1OoTncc/sYP14RsHIPIdjSr6hc+Czpix3LJVSBCg/wbGg/4eo4x1tWVRRYJFyCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94c0ea9b76c8d51848b219c693b22f41f2f4078d4b51fa7fb4605fad0264459","last_reissued_at":"2026-05-18T03:13:20.562055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.562055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SWIFT: Fast algorithms for multi-resolution SPH on multi-core architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.CO","cs.DC"],"primary_cat":"astro-ph.IM","authors_text":"Aidan B. G. Chalk, Matthieu Schaller, Pedro Gonnet, Tom Theuns","submitted_at":"2013-09-15T17:53:42Z","abstract_excerpt":"This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions, and a task-based formulation. It is shown to be faster than traditional tree-based codes, and to scale better than domain decomposition-based approaches on shared-memory parallel architectures such as multi-cores."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3783","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":"1309.3783","created_at":"2026-05-18T03:13:20.562169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3783v1","created_at":"2026-05-18T03:13:20.562169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3783","created_at":"2026-05-18T03:13:20.562169+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FGA5KNXNSGV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FGA5KNXNSGVDBEL","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FGA5KNX","created_at":"2026-05-18T12:27:36.564083+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/7FGA5KNXNSGVDBELEGOGSOZC6Q","json":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q.json","graph_json":"https://pith.science/api/pith-number/7FGA5KNXNSGVDBELEGOGSOZC6Q/graph.json","events_json":"https://pith.science/api/pith-number/7FGA5KNXNSGVDBELEGOGSOZC6Q/events.json","paper":"https://pith.science/paper/7FGA5KNX"},"agent_actions":{"view_html":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q","download_json":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q.json","view_paper":"https://pith.science/paper/7FGA5KNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3783&json=true","fetch_graph":"https://pith.science/api/pith-number/7FGA5KNXNSGVDBELEGOGSOZC6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7FGA5KNXNSGVDBELEGOGSOZC6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q/action/storage_attestation","attest_author":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q/action/author_attestation","sign_citation":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q/action/citation_signature","submit_replication":"https://pith.science/pith/7FGA5KNXNSGVDBELEGOGSOZC6Q/action/replication_record"}},"created_at":"2026-05-18T03:13:20.562169+00:00","updated_at":"2026-05-18T03:13:20.562169+00:00"}