{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:RMFBL3SU7S7VC2ZSTY5B63OKZD","short_pith_number":"pith:RMFBL3SU","schema_version":"1.0","canonical_sha256":"8b0a15ee54fcbf516b329e3a1f6dcac8e7763f9886c9b31449218de7cb35d27c","source":{"kind":"arxiv","id":"astro-ph/9406065","version":1},"attestation_state":"computed","paper":{"title":"Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors","license":"","headline":"","cross_cats":[],"primary_cat":"astro-ph","authors_text":"U. Becciani, V. Antonuccio-Delogu","submitted_at":"1994-06-24T09:38:31Z","abstract_excerpt":"We have implemented a parallel version of the Barnes-Hut 3-D N-body tree algorithm under PVM 3.2.5, adopting an SPMD paradigm. We parallelize the problem by decomposing the physical domain by means of the {\\bf Orthogonal Recursive Bisection} oct-tree scheme suggested by Salmon (1991), but we modify the original hypercube communication pattern into an incomplete hypercube, which is more suitable for a generic inhomogenous cluster architecture.\\\\ We address dynamical load balancing by assigning different \"weights\" to the spawned tasks according to the dynamically changing workloads of each task."},"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":"astro-ph/9406065","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"astro-ph","submitted_at":"1994-06-24T09:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"05b147dd3b2bf79c01afeb2c23efdebc7df67672d016a5318d49cb43cb6013a6","abstract_canon_sha256":"c4fa36108458932149992e2f5e4dd7e7222925d4cd61fc8eb8041e57c4ca334b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:14:28.575699Z","signature_b64":"K6QLgoGWq+dauQ/Rgb6yZBv23pmo4QyJ2MGZlbvPWCIK6xSkFRgZe5RPhzSgEwq8viGxXBveidbSD69R4iruAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b0a15ee54fcbf516b329e3a1f6dcac8e7763f9886c9b31449218de7cb35d27c","last_reissued_at":"2026-07-04T14:14:28.575286Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:14:28.575286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capanic: A Parallel Tree N-Body Code for Inhomogeneous Clusters of Processors","license":"","headline":"","cross_cats":[],"primary_cat":"astro-ph","authors_text":"U. Becciani, V. Antonuccio-Delogu","submitted_at":"1994-06-24T09:38:31Z","abstract_excerpt":"We have implemented a parallel version of the Barnes-Hut 3-D N-body tree algorithm under PVM 3.2.5, adopting an SPMD paradigm. We parallelize the problem by decomposing the physical domain by means of the {\\bf Orthogonal Recursive Bisection} oct-tree scheme suggested by Salmon (1991), but we modify the original hypercube communication pattern into an incomplete hypercube, which is more suitable for a generic inhomogenous cluster architecture.\\\\ We address dynamical load balancing by assigning different \"weights\" to the spawned tasks according to the dynamically changing workloads of each task."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"astro-ph/9406065","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/astro-ph/9406065/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":"astro-ph/9406065","created_at":"2026-07-04T14:14:28.575361+00:00"},{"alias_kind":"arxiv_version","alias_value":"astro-ph/9406065v1","created_at":"2026-07-04T14:14:28.575361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.astro-ph/9406065","created_at":"2026-07-04T14:14:28.575361+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMFBL3SU7S7V","created_at":"2026-07-04T14:14:28.575361+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMFBL3SU7S7VC2ZS","created_at":"2026-07-04T14:14:28.575361+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMFBL3SU","created_at":"2026-07-04T14:14:28.575361+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/RMFBL3SU7S7VC2ZSTY5B63OKZD","json":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD.json","graph_json":"https://pith.science/api/pith-number/RMFBL3SU7S7VC2ZSTY5B63OKZD/graph.json","events_json":"https://pith.science/api/pith-number/RMFBL3SU7S7VC2ZSTY5B63OKZD/events.json","paper":"https://pith.science/paper/RMFBL3SU"},"agent_actions":{"view_html":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD","download_json":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD.json","view_paper":"https://pith.science/paper/RMFBL3SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=astro-ph/9406065&json=true","fetch_graph":"https://pith.science/api/pith-number/RMFBL3SU7S7VC2ZSTY5B63OKZD/graph.json","fetch_events":"https://pith.science/api/pith-number/RMFBL3SU7S7VC2ZSTY5B63OKZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD/action/storage_attestation","attest_author":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD/action/author_attestation","sign_citation":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD/action/citation_signature","submit_replication":"https://pith.science/pith/RMFBL3SU7S7VC2ZSTY5B63OKZD/action/replication_record"}},"created_at":"2026-07-04T14:14:28.575361+00:00","updated_at":"2026-07-04T14:14:28.575361+00:00"}