{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L5RBA4VJGEUPBOXCFVXRGPCRX2","short_pith_number":"pith:L5RBA4VJ","canonical_record":{"source":{"id":"1212.5880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-24T09:22:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"225a19994e708a807a900a614ae754cb7717e646837815e399aa062881bb144a","abstract_canon_sha256":"d0ab8c58409435c038acbf1ca4700457990283c0136fc407789809a1d9f9328a"},"schema_version":"1.0"},"canonical_sha256":"5f621072a93128f0bae22d6f133c51beaf879c2e0a74d47779997319176494b5","source":{"kind":"arxiv","id":"1212.5880","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5880","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5880v2","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5880","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"L5RBA4VJGEUP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L5RBA4VJGEUPBOXC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L5RBA4VJ","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L5RBA4VJGEUPBOXCFVXRGPCRX2","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-24T09:22:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"225a19994e708a807a900a614ae754cb7717e646837815e399aa062881bb144a","abstract_canon_sha256":"d0ab8c58409435c038acbf1ca4700457990283c0136fc407789809a1d9f9328a"},"schema_version":"1.0"},"canonical_sha256":"5f621072a93128f0bae22d6f133c51beaf879c2e0a74d47779997319176494b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:45.687112Z","signature_b64":"xtxCkv2jLw7k6KLHMujK88cldGvrmsmGeUWnY2gCFeMLTFvwjV8q2eJHUtP792ML4ZFIRiqKREB7ZjjPNlDWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f621072a93128f0bae22d6f133c51beaf879c2e0a74d47779997319176494b5","last_reissued_at":"2026-05-18T03:28:45.686195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:45.686195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5880","source_version":2,"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-18T03:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrRATqSBAiU4Sx/wBB1avekCbX9Do35cnuVDObpaL1DZJOH5mZO7rGsCWLtvdN4zQkl0zYV+U0/9Ja7zUpBMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:09:45.926801Z"},"content_sha256":"f232c38f4060af6730728b396ca6b3d2c803b92542238fe91de715517c5c89be","schema_version":"1.0","event_id":"sha256:f232c38f4060af6730728b396ca6b3d2c803b92542238fe91de715517c5c89be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L5RBA4VJGEUPBOXCFVXRGPCRX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Thresholding in General Network Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ran Wolff","submitted_at":"2012-12-24T09:22:28Z","abstract_excerpt":"Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algorithms has always been cycle-free routing. The existence of even one cycle may lead all peers to the wrong outcome. Outside the lab, unfortunately, cycle freedom is not easy to achieve.\n  This work is the first to lift the requirement of cycle freedom by presenting a local thresholding algorithm suitable for general network graphs. The algorithm re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5880","kind":"arxiv","version":2},"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-18T03:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5sMN6E4x/CwS5zo3T5373S5tH7ZSupRyASZ+KECr5HeCzV6G5q1Ov28/kgE7EYLNu0B2lZA0j5Qgn0OEElkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:09:45.927147Z"},"content_sha256":"90f7d72da34784c0be8dd446278377cf18bdd2416c86d26238100dbd56827921","schema_version":"1.0","event_id":"sha256:90f7d72da34784c0be8dd446278377cf18bdd2416c86d26238100dbd56827921"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/bundle.json","state_url":"https://pith.science/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/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-30T20:09:45Z","links":{"resolver":"https://pith.science/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2","bundle":"https://pith.science/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/bundle.json","state":"https://pith.science/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5RBA4VJGEUPBOXCFVXRGPCRX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L5RBA4VJGEUPBOXCFVXRGPCRX2","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":"d0ab8c58409435c038acbf1ca4700457990283c0136fc407789809a1d9f9328a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-24T09:22:28Z","title_canon_sha256":"225a19994e708a807a900a614ae754cb7717e646837815e399aa062881bb144a"},"schema_version":"1.0","source":{"id":"1212.5880","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5880","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5880v2","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5880","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"L5RBA4VJGEUP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L5RBA4VJGEUPBOXC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L5RBA4VJ","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:90f7d72da34784c0be8dd446278377cf18bdd2416c86d26238100dbd56827921","target":"graph","created_at":"2026-05-18T03:28:45Z","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":"Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algorithms has always been cycle-free routing. The existence of even one cycle may lead all peers to the wrong outcome. Outside the lab, unfortunately, cycle freedom is not easy to achieve.\n  This work is the first to lift the requirement of cycle freedom by presenting a local thresholding algorithm suitable for general network graphs. The algorithm re","authors_text":"Ran Wolff","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-24T09:22:28Z","title":"Local Thresholding in General Network Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5880","kind":"arxiv","version":2},"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:f232c38f4060af6730728b396ca6b3d2c803b92542238fe91de715517c5c89be","target":"record","created_at":"2026-05-18T03:28:45Z","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":"d0ab8c58409435c038acbf1ca4700457990283c0136fc407789809a1d9f9328a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-24T09:22:28Z","title_canon_sha256":"225a19994e708a807a900a614ae754cb7717e646837815e399aa062881bb144a"},"schema_version":"1.0","source":{"id":"1212.5880","kind":"arxiv","version":2}},"canonical_sha256":"5f621072a93128f0bae22d6f133c51beaf879c2e0a74d47779997319176494b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f621072a93128f0bae22d6f133c51beaf879c2e0a74d47779997319176494b5","first_computed_at":"2026-05-18T03:28:45.686195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:45.686195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xtxCkv2jLw7k6KLHMujK88cldGvrmsmGeUWnY2gCFeMLTFvwjV8q2eJHUtP792ML4ZFIRiqKREB7ZjjPNlDWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:45.687112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5880","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f232c38f4060af6730728b396ca6b3d2c803b92542238fe91de715517c5c89be","sha256:90f7d72da34784c0be8dd446278377cf18bdd2416c86d26238100dbd56827921"],"state_sha256":"09d7df6789b7cab0b859f3ce454ee3d2494239345e0cce0fe1b025cdac9d8f21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeyqoAEugvNoGcbI71nEZpxKrL/sy36awvuIPk6wor9odw3hIcsVQHcgUkzWi3E8DHh0Lv9RIhwjCoBKg5BDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:09:45.929133Z","bundle_sha256":"942ac3e3e54760f756a02cf8044688871dfdbe43ad7e02f8dc61a0f850fa714f"}}