{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NLPT2MK77STBZWG4T2LHZSE3Q2","short_pith_number":"pith:NLPT2MK7","canonical_record":{"source":{"id":"1404.3318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T20:05:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1f4d3c7cfe8e23115a7a922b8e275eae831af48da42d70a56a2a8eb0f7f9af8c","abstract_canon_sha256":"27e6a6e7043441684607b959a78a0b6e619584dce77a5c22f255ef9e24cf6b90"},"schema_version":"1.0"},"canonical_sha256":"6adf3d315ffca61cd8dc9e967cc89b86bd15841278bc5cd4a62d50204ecc36cb","source":{"kind":"arxiv","id":"1404.3318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3318","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3318v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3318","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"NLPT2MK77STB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLPT2MK77STBZWG4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLPT2MK7","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NLPT2MK77STBZWG4T2LHZSE3Q2","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T20:05:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1f4d3c7cfe8e23115a7a922b8e275eae831af48da42d70a56a2a8eb0f7f9af8c","abstract_canon_sha256":"27e6a6e7043441684607b959a78a0b6e619584dce77a5c22f255ef9e24cf6b90"},"schema_version":"1.0"},"canonical_sha256":"6adf3d315ffca61cd8dc9e967cc89b86bd15841278bc5cd4a62d50204ecc36cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.415094Z","signature_b64":"ed8PzCp804p7sJeaaaB2jwkcuPrFRQ3soKTtJSXgxa/R/WATSqKAkIKZZVtFvvlQNn9L3zmjKFID8nwH/RxTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6adf3d315ffca61cd8dc9e967cc89b86bd15841278bc5cd4a62d50204ecc36cb","last_reissued_at":"2026-05-18T02:54:15.414633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.414633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3318","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHE+8795YNAmLXiG9beOGmARFG420Aqb1cmrBtIDfZK74PUy4T7I8ykzd++jwHPJYIwEAgV8fmhFB8oAl1RZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:58:58.686962Z"},"content_sha256":"f5b46a7461eebc8b24c45375c48497b00656caa8f65601aae279a231f84792a8","schema_version":"1.0","event_id":"sha256:f5b46a7461eebc8b24c45375c48497b00656caa8f65601aae279a231f84792a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NLPT2MK77STBZWG4T2LHZSE3Q2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network-Oblivious Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrea Pietracaprina, Francesco Silvestri, Geppino Pucci, Gianfranco Bilardi, Michele Scquizzato","submitted_at":"2014-04-12T20:05:06Z","abstract_excerpt":"A framework is proposed for the design and analysis of \\emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem's input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that, for a wide class of network-oblivious algorithms,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3318","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dcagtxhtOvLVKbLjRJbgnVPV/r81BwLJeUwIkAPUEZRr/Un7JuzNlGB8ZZTuFJd7WIond7oEG5haka/eCfpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:58:58.687307Z"},"content_sha256":"7ac1b7a19730ae468b50fd577d5163d1b0a0699d3060b7dc17ee7b73ad1b2f21","schema_version":"1.0","event_id":"sha256:7ac1b7a19730ae468b50fd577d5163d1b0a0699d3060b7dc17ee7b73ad1b2f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/bundle.json","state_url":"https://pith.science/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T17:58:58Z","links":{"resolver":"https://pith.science/pith/NLPT2MK77STBZWG4T2LHZSE3Q2","bundle":"https://pith.science/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/bundle.json","state":"https://pith.science/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLPT2MK77STBZWG4T2LHZSE3Q2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NLPT2MK77STBZWG4T2LHZSE3Q2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27e6a6e7043441684607b959a78a0b6e619584dce77a5c22f255ef9e24cf6b90","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T20:05:06Z","title_canon_sha256":"1f4d3c7cfe8e23115a7a922b8e275eae831af48da42d70a56a2a8eb0f7f9af8c"},"schema_version":"1.0","source":{"id":"1404.3318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3318","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3318v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3318","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"NLPT2MK77STB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLPT2MK77STBZWG4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLPT2MK7","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:7ac1b7a19730ae468b50fd577d5163d1b0a0699d3060b7dc17ee7b73ad1b2f21","target":"graph","created_at":"2026-05-18T02:54:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A framework is proposed for the design and analysis of \\emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem's input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that, for a wide class of network-oblivious algorithms,","authors_text":"Andrea Pietracaprina, Francesco Silvestri, Geppino Pucci, Gianfranco Bilardi, Michele Scquizzato","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T20:05:06Z","title":"Network-Oblivious Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3318","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f5b46a7461eebc8b24c45375c48497b00656caa8f65601aae279a231f84792a8","target":"record","created_at":"2026-05-18T02:54:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27e6a6e7043441684607b959a78a0b6e619584dce77a5c22f255ef9e24cf6b90","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-12T20:05:06Z","title_canon_sha256":"1f4d3c7cfe8e23115a7a922b8e275eae831af48da42d70a56a2a8eb0f7f9af8c"},"schema_version":"1.0","source":{"id":"1404.3318","kind":"arxiv","version":1}},"canonical_sha256":"6adf3d315ffca61cd8dc9e967cc89b86bd15841278bc5cd4a62d50204ecc36cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6adf3d315ffca61cd8dc9e967cc89b86bd15841278bc5cd4a62d50204ecc36cb","first_computed_at":"2026-05-18T02:54:15.414633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:15.414633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ed8PzCp804p7sJeaaaB2jwkcuPrFRQ3soKTtJSXgxa/R/WATSqKAkIKZZVtFvvlQNn9L3zmjKFID8nwH/RxTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:15.415094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5b46a7461eebc8b24c45375c48497b00656caa8f65601aae279a231f84792a8","sha256:7ac1b7a19730ae468b50fd577d5163d1b0a0699d3060b7dc17ee7b73ad1b2f21"],"state_sha256":"3b20084b168018933cc42442c5f1164fb1d5d37cf6abb17e762ae5be586ec67b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"folXbiTmQFyG1GKmk0Ppa1xN1ndWjmgnCXVGb4A7j11sktPQ2CxJa/S7i0UklaPkHxdGdwUDSry9njDwP9tZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:58:58.689432Z","bundle_sha256":"ac87d975c2adc5b1936b6a6c754f703035b17dbb3dc6b2ad3e7562c79b7be468"}}