{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LB7Q7MLQ653LR5QJEEMHDUSBAJ","short_pith_number":"pith:LB7Q7MLQ","canonical_record":{"source":{"id":"2506.06102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-06T14:02:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02e0e981e9f0a2a812d47187368893927c5a2587f56f481f97061dc088a8ea8c","abstract_canon_sha256":"f5bb050acdbf50edbe58ab3c2a647c931b280106d6bcfbd09b875c6d35c09fc5"},"schema_version":"1.0"},"canonical_sha256":"587f0fb170f776b8f609211871d24102404ce8cb062d1495a8914cbe7406ac60","source":{"kind":"arxiv","id":"2506.06102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06102","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06102v1","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06102","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"LB7Q7MLQ653L","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"LB7Q7MLQ653LR5QJ","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"LB7Q7MLQ","created_at":"2026-07-05T11:17:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LB7Q7MLQ653LR5QJEEMHDUSBAJ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-06T14:02:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02e0e981e9f0a2a812d47187368893927c5a2587f56f481f97061dc088a8ea8c","abstract_canon_sha256":"f5bb050acdbf50edbe58ab3c2a647c931b280106d6bcfbd09b875c6d35c09fc5"},"schema_version":"1.0"},"canonical_sha256":"587f0fb170f776b8f609211871d24102404ce8cb062d1495a8914cbe7406ac60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:25.558523Z","signature_b64":"vF1SFNdl5wPFezP6x7dPsFzB6f3fwwq2A6VM8qMG2cpaGeHNDkiGmXUMxOZlZAkyZYRlPpSOZTwtQAtrYQb6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"587f0fb170f776b8f609211871d24102404ce8cb062d1495a8914cbe7406ac60","last_reissued_at":"2026-07-05T11:17:25.557977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:25.557977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06102","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-07-05T11:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzSx1aYyW2MNg/hjUFVzgpUX+WhpEtOol7oLmPozKjzVKE9Wvh+PvlFa17NiJRjWqLhjYcfRBOiUvjFbTZqYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:13:33.556703Z"},"content_sha256":"136e60af90918d750d3c68b1ec047e2e3d31c57b973587d3fed4130527924265","schema_version":"1.0","event_id":"sha256:136e60af90918d750d3c68b1ec047e2e3d31c57b973587d3fed4130527924265"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LB7Q7MLQ653LR5QJEEMHDUSBAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Matching with Few Link Activations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hugo Mirault, Ming Ming Tan, Peter Robinson, Xianbin Zhu","submitted_at":"2025-06-06T14:02:04Z","abstract_excerpt":"We consider the problem of computing a perfect matching problem in a synchronous distributed network, where the network topology corresponds to a complete bipartite graph. The communication between nodes is restricted to activating communication links, which means that instead of sending messages containing a number of bits, each node can only send a pulse over some of its incident links in each round. In the port numbering model, where nodes are unaware of their neighbor's IDs, we give a randomized algorithm that terminates in $O( \\log n )$ rounds and has a pulse complexity of $O( n\\log n )$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06102","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/2506.06102/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"},"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-07-05T11:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiCKt+4b2+a7PD0efvEprOQaAfVIiehYCLbjxBpA39QHO7cZLEc3TvmALmhsLPgo+XAesSJI9v9kXosaDTBNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:13:33.557189Z"},"content_sha256":"388086b0fe2bb1e7581dfeb41b2443f296bc2481871782e923f47d6dde9ea4d1","schema_version":"1.0","event_id":"sha256:388086b0fe2bb1e7581dfeb41b2443f296bc2481871782e923f47d6dde9ea4d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/bundle.json","state_url":"https://pith.science/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/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-08-08T00:13:33Z","links":{"resolver":"https://pith.science/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ","bundle":"https://pith.science/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/bundle.json","state":"https://pith.science/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LB7Q7MLQ653LR5QJEEMHDUSBAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LB7Q7MLQ653LR5QJEEMHDUSBAJ","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":"f5bb050acdbf50edbe58ab3c2a647c931b280106d6bcfbd09b875c6d35c09fc5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-06T14:02:04Z","title_canon_sha256":"02e0e981e9f0a2a812d47187368893927c5a2587f56f481f97061dc088a8ea8c"},"schema_version":"1.0","source":{"id":"2506.06102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06102","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06102v1","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06102","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"LB7Q7MLQ653L","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_16","alias_value":"LB7Q7MLQ653LR5QJ","created_at":"2026-07-05T11:17:25Z"},{"alias_kind":"pith_short_8","alias_value":"LB7Q7MLQ","created_at":"2026-07-05T11:17:25Z"}],"graph_snapshots":[{"event_id":"sha256:388086b0fe2bb1e7581dfeb41b2443f296bc2481871782e923f47d6dde9ea4d1","target":"graph","created_at":"2026-07-05T11:17:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.06102/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of computing a perfect matching problem in a synchronous distributed network, where the network topology corresponds to a complete bipartite graph. The communication between nodes is restricted to activating communication links, which means that instead of sending messages containing a number of bits, each node can only send a pulse over some of its incident links in each round. In the port numbering model, where nodes are unaware of their neighbor's IDs, we give a randomized algorithm that terminates in $O( \\log n )$ rounds and has a pulse complexity of $O( n\\log n )$,","authors_text":"Hugo Mirault, Ming Ming Tan, Peter Robinson, Xianbin Zhu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06102","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:136e60af90918d750d3c68b1ec047e2e3d31c57b973587d3fed4130527924265","target":"record","created_at":"2026-07-05T11:17:25Z","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":"f5bb050acdbf50edbe58ab3c2a647c931b280106d6bcfbd09b875c6d35c09fc5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-06T14:02:04Z","title_canon_sha256":"02e0e981e9f0a2a812d47187368893927c5a2587f56f481f97061dc088a8ea8c"},"schema_version":"1.0","source":{"id":"2506.06102","kind":"arxiv","version":1}},"canonical_sha256":"587f0fb170f776b8f609211871d24102404ce8cb062d1495a8914cbe7406ac60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"587f0fb170f776b8f609211871d24102404ce8cb062d1495a8914cbe7406ac60","first_computed_at":"2026-07-05T11:17:25.557977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:25.557977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vF1SFNdl5wPFezP6x7dPsFzB6f3fwwq2A6VM8qMG2cpaGeHNDkiGmXUMxOZlZAkyZYRlPpSOZTwtQAtrYQb6Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:25.558523Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:136e60af90918d750d3c68b1ec047e2e3d31c57b973587d3fed4130527924265","sha256:388086b0fe2bb1e7581dfeb41b2443f296bc2481871782e923f47d6dde9ea4d1"],"state_sha256":"6de04cf9b4ed7c265dfa2c37907e0cf0ef9e1bf047f16f92221e1036ad981fb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSP7ykQEzTNaftxqnQ9hCNW4mNn+PlBnwKG1TNUttljpquaHzdHkwdk6FnFDktUGJLEJkpY0317m8HVEnrcjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:13:33.561273Z","bundle_sha256":"f3331b4f4651b4bd758ce3bfa623975d0cb12768bec36381642b7692798b8ee4"}}