{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PGMNME5GXPZPXP23OCR43M3LN7","short_pith_number":"pith:PGMNME5G","canonical_record":{"source":{"id":"1708.07044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"e4369659d5ec90aa9f227f4b855dd086834c6c51963375c78734988619383294","abstract_canon_sha256":"3a8c99eaa2c1bf727facfaed0e8d36c24a4e05ec3b48a8cf2b3b0c64a77c06be"},"schema_version":"1.0"},"canonical_sha256":"7998d613a6bbf2fbbf5b70a3cdb36b6fdd89fe09c6c1d84d46efceaed640a747","source":{"kind":"arxiv","id":"1708.07044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07044","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07044v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07044","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"PGMNME5GXPZP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PGMNME5GXPZPXP23","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PGMNME5G","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PGMNME5GXPZPXP23OCR43M3LN7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"e4369659d5ec90aa9f227f4b855dd086834c6c51963375c78734988619383294","abstract_canon_sha256":"3a8c99eaa2c1bf727facfaed0e8d36c24a4e05ec3b48a8cf2b3b0c64a77c06be"},"schema_version":"1.0"},"canonical_sha256":"7998d613a6bbf2fbbf5b70a3cdb36b6fdd89fe09c6c1d84d46efceaed640a747","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.537440Z","signature_b64":"lowQFEZp69aATSpz/cgpL1w4jpA55yNoDaTXDXu3Vzi9HE7+P67IqQW8kp9J8SumNEVDku/pR+h1xuCQp3tDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7998d613a6bbf2fbbf5b70a3cdb36b6fdd89fe09c6c1d84d46efceaed640a747","last_reissued_at":"2026-05-18T00:36:48.536668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.536668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07044","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hSBHJawrfhKu/LVESUCal8wpXrI2AQIqmYT4jMIezKnsnY614GagLsBDvj9qkpnIWoEQe9dc933jALn9U6eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T05:08:06.138030Z"},"content_sha256":"d2759107e43eff4f69cbd3a933d6dbd3cc150ef83a7febc4a8377018483caa9f","schema_version":"1.0","event_id":"sha256:d2759107e43eff4f69cbd3a933d6dbd3cc150ef83a7febc4a8377018483caa9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PGMNME5GXPZPXP23OCR43M3LN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EZ-AG: Structure-free data aggregation in MANETs using push-assisted self-repelling random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Masahiro Nakagawa, Vinod Kulathumani","submitted_at":"2017-08-23T15:17:26Z","abstract_excerpt":"This paper describes EZ-AG, a structure-free protocol for duplicate insensitive data aggregation in MANETs. The key idea in EZ-AG is to introduce a token that performs a self-repelling random walk in the network and aggregates information from nodes when they are visited for the first time. A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often. While self-repelling random walks visit all nodes in the network much faster than plain random walks, they tend to slow down when most of the nodes are already vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07044","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoL62vxGYsb/AE9OOWE9tmU6ivTcm9E4IdnZK8dtSPxYoaR9aXVg+GWALzv2K5TGk+AApWJQzUu6nmnARbAFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T05:08:06.138401Z"},"content_sha256":"6d6027a23dfb00c477ce739d0e6f06e2c5928095b9781aedfa86306eb7694c76","schema_version":"1.0","event_id":"sha256:6d6027a23dfb00c477ce739d0e6f06e2c5928095b9781aedfa86306eb7694c76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGMNME5GXPZPXP23OCR43M3LN7/bundle.json","state_url":"https://pith.science/pith/PGMNME5GXPZPXP23OCR43M3LN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGMNME5GXPZPXP23OCR43M3LN7/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-19T05:08:06Z","links":{"resolver":"https://pith.science/pith/PGMNME5GXPZPXP23OCR43M3LN7","bundle":"https://pith.science/pith/PGMNME5GXPZPXP23OCR43M3LN7/bundle.json","state":"https://pith.science/pith/PGMNME5GXPZPXP23OCR43M3LN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGMNME5GXPZPXP23OCR43M3LN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PGMNME5GXPZPXP23OCR43M3LN7","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":"3a8c99eaa2c1bf727facfaed0e8d36c24a4e05ec3b48a8cf2b3b0c64a77c06be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:17:26Z","title_canon_sha256":"e4369659d5ec90aa9f227f4b855dd086834c6c51963375c78734988619383294"},"schema_version":"1.0","source":{"id":"1708.07044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07044","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07044v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07044","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"PGMNME5GXPZP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PGMNME5GXPZPXP23","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PGMNME5G","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:6d6027a23dfb00c477ce739d0e6f06e2c5928095b9781aedfa86306eb7694c76","target":"graph","created_at":"2026-05-18T00:36:48Z","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":"This paper describes EZ-AG, a structure-free protocol for duplicate insensitive data aggregation in MANETs. The key idea in EZ-AG is to introduce a token that performs a self-repelling random walk in the network and aggregates information from nodes when they are visited for the first time. A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often. While self-repelling random walks visit all nodes in the network much faster than plain random walks, they tend to slow down when most of the nodes are already vi","authors_text":"Anish Arora, Masahiro Nakagawa, Vinod Kulathumani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:17:26Z","title":"EZ-AG: Structure-free data aggregation in MANETs using push-assisted self-repelling random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07044","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:d2759107e43eff4f69cbd3a933d6dbd3cc150ef83a7febc4a8377018483caa9f","target":"record","created_at":"2026-05-18T00:36:48Z","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":"3a8c99eaa2c1bf727facfaed0e8d36c24a4e05ec3b48a8cf2b3b0c64a77c06be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:17:26Z","title_canon_sha256":"e4369659d5ec90aa9f227f4b855dd086834c6c51963375c78734988619383294"},"schema_version":"1.0","source":{"id":"1708.07044","kind":"arxiv","version":1}},"canonical_sha256":"7998d613a6bbf2fbbf5b70a3cdb36b6fdd89fe09c6c1d84d46efceaed640a747","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7998d613a6bbf2fbbf5b70a3cdb36b6fdd89fe09c6c1d84d46efceaed640a747","first_computed_at":"2026-05-18T00:36:48.536668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.536668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lowQFEZp69aATSpz/cgpL1w4jpA55yNoDaTXDXu3Vzi9HE7+P67IqQW8kp9J8SumNEVDku/pR+h1xuCQp3tDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.537440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2759107e43eff4f69cbd3a933d6dbd3cc150ef83a7febc4a8377018483caa9f","sha256:6d6027a23dfb00c477ce739d0e6f06e2c5928095b9781aedfa86306eb7694c76"],"state_sha256":"8e82b6e5f8460484ffe56407b59fc8e4c50f064ea9e1c74a37bd2157bcc22ded"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHTtMYFQRQB8fqhHg4YJ3vhROZA46hrtEsgECep1PzDgvJZ5OIGQijWa8UVO9QVo6alz3rKKM1OsM7zjBTe/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T05:08:06.139817Z","bundle_sha256":"e269bf980c6193c4960796ce2345b2178473032c02cbeffa4dea34b5ce601ebb"}}