{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SAVVJSJDL3JNOPSFLL2NZKKJ2B","short_pith_number":"pith:SAVVJSJD","canonical_record":{"source":{"id":"1802.06748","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T18:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"55da17e7f04ea06f923ac2be3b5d64212c04bd5ab61c5c4a21ed83c6694d1a62","abstract_canon_sha256":"0fa8a51af32d9bfde3d8c0092198ada2f3efbb29fb49007258697452807f0a0d"},"schema_version":"1.0"},"canonical_sha256":"902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c","source":{"kind":"arxiv","id":"1802.06748","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06748","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06748v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06748","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"SAVVJSJDL3JN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SAVVJSJDL3JNOPSF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SAVVJSJD","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SAVVJSJDL3JNOPSFLL2NZKKJ2B","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06748","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T18:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"55da17e7f04ea06f923ac2be3b5d64212c04bd5ab61c5c4a21ed83c6694d1a62","abstract_canon_sha256":"0fa8a51af32d9bfde3d8c0092198ada2f3efbb29fb49007258697452807f0a0d"},"schema_version":"1.0"},"canonical_sha256":"902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.010952Z","signature_b64":"JRDsdWzNn46P761cfbux9ztiFO6iUQVEqpAGb+0/b9WQk9mFFsaPqZxOEt85IzU3UEewlu5eS3c9OoTAzD91DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c","last_reissued_at":"2026-05-17T23:45:10.010270Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.010270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06748","source_version":3,"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HHOt7L0Xk5IRBMzcal1gAgOGwctE0vu8gCNGDGPqf1suFyXG8Fjw8ZTwA7U3grDcUAkxvjbfT5C9+oKFjgRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:40:47.865831Z"},"content_sha256":"f96ef0630b431c9e78ec96a88d7d118ce565b8657bf3bcec7ec625b708ea39eb","schema_version":"1.0","event_id":"sha256:f96ef0630b431c9e78ec96a88d7d118ce565b8657bf3bcec7ec625b708ea39eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SAVVJSJDL3JNOPSFLL2NZKKJ2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Manuela Fischer, Sebastian Brandt","submitted_at":"2018-02-19T18:29:32Z","abstract_excerpt":"Recently, studying fundamental graph problems in the \\emph{Massively Parallel Computation (MPC) framework, inspired by the MapReduce paradigm, has gained a lot of attention. An assumption common to a vast majority of approaches is to allow $\\widetilde{\\Omega}(n)$ memory per machine, where $n$ is the number of nodes in the graph and $\\widetilde{\\Omega}$ hides polylogarithmic factors. However, as pointed out by Karloff et al. [SODA'10] and Czumaj et al. [STOC'18], it might be unrealistic for a single machine to have linear or only slightly sublinear memory.\n  In this paper, we thus study a more "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06748","kind":"arxiv","version":3},"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMyZY6yEAFJH+IuvWm8HcNxfaSS5jwTm7ZxoxZQ+6G6b95pjU+gTuwJaRavPBMk0nziM58z+zyUykXGlWTbkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:40:47.866226Z"},"content_sha256":"f46a4874c6ceb458aed4bd11fe0c956ec997d99ce53518f165abff764ad3227c","schema_version":"1.0","event_id":"sha256:f46a4874c6ceb458aed4bd11fe0c956ec997d99ce53518f165abff764ad3227c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/bundle.json","state_url":"https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/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-05-26T23:40:47Z","links":{"resolver":"https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B","bundle":"https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/bundle.json","state":"https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SAVVJSJDL3JNOPSFLL2NZKKJ2B","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":"0fa8a51af32d9bfde3d8c0092198ada2f3efbb29fb49007258697452807f0a0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T18:29:32Z","title_canon_sha256":"55da17e7f04ea06f923ac2be3b5d64212c04bd5ab61c5c4a21ed83c6694d1a62"},"schema_version":"1.0","source":{"id":"1802.06748","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06748","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06748v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06748","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"SAVVJSJDL3JN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SAVVJSJDL3JNOPSF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SAVVJSJD","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:f46a4874c6ceb458aed4bd11fe0c956ec997d99ce53518f165abff764ad3227c","target":"graph","created_at":"2026-05-17T23:45:10Z","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":"Recently, studying fundamental graph problems in the \\emph{Massively Parallel Computation (MPC) framework, inspired by the MapReduce paradigm, has gained a lot of attention. An assumption common to a vast majority of approaches is to allow $\\widetilde{\\Omega}(n)$ memory per machine, where $n$ is the number of nodes in the graph and $\\widetilde{\\Omega}$ hides polylogarithmic factors. However, as pointed out by Karloff et al. [SODA'10] and Czumaj et al. [STOC'18], it might be unrealistic for a single machine to have linear or only slightly sublinear memory.\n  In this paper, we thus study a more ","authors_text":"Jara Uitto, Manuela Fischer, Sebastian Brandt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T18:29:32Z","title":"Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06748","kind":"arxiv","version":3},"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:f96ef0630b431c9e78ec96a88d7d118ce565b8657bf3bcec7ec625b708ea39eb","target":"record","created_at":"2026-05-17T23:45:10Z","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":"0fa8a51af32d9bfde3d8c0092198ada2f3efbb29fb49007258697452807f0a0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T18:29:32Z","title_canon_sha256":"55da17e7f04ea06f923ac2be3b5d64212c04bd5ab61c5c4a21ed83c6694d1a62"},"schema_version":"1.0","source":{"id":"1802.06748","kind":"arxiv","version":3}},"canonical_sha256":"902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c","first_computed_at":"2026-05-17T23:45:10.010270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.010270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRDsdWzNn46P761cfbux9ztiFO6iUQVEqpAGb+0/b9WQk9mFFsaPqZxOEt85IzU3UEewlu5eS3c9OoTAzD91DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.010952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06748","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f96ef0630b431c9e78ec96a88d7d118ce565b8657bf3bcec7ec625b708ea39eb","sha256:f46a4874c6ceb458aed4bd11fe0c956ec997d99ce53518f165abff764ad3227c"],"state_sha256":"1f7752ae52c926d6659e841f52ac78ea55e88e673bb41d9b286d17c83b617693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yg4DXqsRNL0gqvhpTWdbOoOzjZJvco5KjnKDh1mXLOVWLuXnm6urR59jZc/FL+e7kuBulu5SeOYzCysQbiTNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:40:47.870819Z","bundle_sha256":"cebff284b93f9b3543809918563fb42840027277e6ce95e80f3794c5a4d1ea5a"}}