{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7LLZIVGMUGZBICL7PS4PE77Q7Q","short_pith_number":"pith:7LLZIVGM","schema_version":"1.0","canonical_sha256":"fad79454cca1b214097f7cb8f27ff0fc315973a072f83fddc760ea2d726550b4","source":{"kind":"arxiv","id":"2606.13329","version":1},"attestation_state":"computed","paper":{"title":"Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dorian Chenet, Jonas Posner, Mia Reitz","submitted_at":"2026-06-11T13:22:55Z","abstract_excerpt":"Asynchronous Many-Task (AMT) is a parallel programming model used in High Performance Computing (HPC). An AMT runtime can distribute fine-grained tasks across processing units called workers, through work stealing: when a worker has no tasks left to process, it tries to steal tasks from other workers. Workers are not restricted to a single compute node but can also be distributed across multiple nodes of an HPC cluster. Existing AMT runtimes assume a fully connected network with low, uniform latency and perform global work stealing, selecting another worker at random from all workers in the sy"},"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":"2606.13329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-11T13:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"09b060aa33fc04aab15d41880114881b5711b65f482433d983843e86a1587991","abstract_canon_sha256":"f6bba04e0387cb0eb8f37f0df46580220477e96892f3085102c3c6b9ae000dc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:52.721994Z","signature_b64":"+HcYauwRh4mrivTqlHwHqVKJ7sI2iWzbX0HAimDq4mEiaWkkJx2ESbIfQuzE6rDXsvVfRRpmUq2Ocl4CryA0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad79454cca1b214097f7cb8f27ff0fc315973a072f83fddc760ea2d726550b4","last_reissued_at":"2026-06-12T01:09:52.721212Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:52.721212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dorian Chenet, Jonas Posner, Mia Reitz","submitted_at":"2026-06-11T13:22:55Z","abstract_excerpt":"Asynchronous Many-Task (AMT) is a parallel programming model used in High Performance Computing (HPC). An AMT runtime can distribute fine-grained tasks across processing units called workers, through work stealing: when a worker has no tasks left to process, it tries to steal tasks from other workers. Workers are not restricted to a single compute node but can also be distributed across multiple nodes of an HPC cluster. Existing AMT runtimes assume a fully connected network with low, uniform latency and perform global work stealing, selecting another worker at random from all workers in the sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13329","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/2606.13329/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":"2606.13329","created_at":"2026-06-12T01:09:52.721331+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13329v1","created_at":"2026-06-12T01:09:52.721331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13329","created_at":"2026-06-12T01:09:52.721331+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LLZIVGMUGZB","created_at":"2026-06-12T01:09:52.721331+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LLZIVGMUGZBICL7","created_at":"2026-06-12T01:09:52.721331+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LLZIVGM","created_at":"2026-06-12T01:09:52.721331+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/7LLZIVGMUGZBICL7PS4PE77Q7Q","json":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q.json","graph_json":"https://pith.science/api/pith-number/7LLZIVGMUGZBICL7PS4PE77Q7Q/graph.json","events_json":"https://pith.science/api/pith-number/7LLZIVGMUGZBICL7PS4PE77Q7Q/events.json","paper":"https://pith.science/paper/7LLZIVGM"},"agent_actions":{"view_html":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q","download_json":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q.json","view_paper":"https://pith.science/paper/7LLZIVGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13329&json=true","fetch_graph":"https://pith.science/api/pith-number/7LLZIVGMUGZBICL7PS4PE77Q7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7LLZIVGMUGZBICL7PS4PE77Q7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q/action/storage_attestation","attest_author":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q/action/author_attestation","sign_citation":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q/action/citation_signature","submit_replication":"https://pith.science/pith/7LLZIVGMUGZBICL7PS4PE77Q7Q/action/replication_record"}},"created_at":"2026-06-12T01:09:52.721331+00:00","updated_at":"2026-06-12T01:09:52.721331+00:00"}