{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UECPXHHMK24BIKVFCVJQ2FLNQQ","short_pith_number":"pith:UECPXHHM","canonical_record":{"source":{"id":"1605.07692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T00:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"615b5c4e6c5a422ed9ec7efe5d031eff7b8a925a45189acfaf2d6b306d6350cf","abstract_canon_sha256":"72353a415b6713c11f5c4da5c4e122220ba519b8b6a974f5c6f681242ce52cb9"},"schema_version":"1.0"},"canonical_sha256":"a104fb9cec56b8142aa515530d156d843640016f62dc4029da3ce20ebde19f66","source":{"kind":"arxiv","id":"1605.07692","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07692","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07692v2","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07692","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"UECPXHHMK24B","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UECPXHHMK24BIKVF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UECPXHHM","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UECPXHHMK24BIKVFCVJQ2FLNQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T00:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"615b5c4e6c5a422ed9ec7efe5d031eff7b8a925a45189acfaf2d6b306d6350cf","abstract_canon_sha256":"72353a415b6713c11f5c4da5c4e122220ba519b8b6a974f5c6f681242ce52cb9"},"schema_version":"1.0"},"canonical_sha256":"a104fb9cec56b8142aa515530d156d843640016f62dc4029da3ce20ebde19f66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:04.393185Z","signature_b64":"Bg4PiOiHDudaDQuPgpfQIJQCpbYRecABLnUoBeoFZVcQkkeaL6R8XueV9GeKzdb/ajS4oPrfuAzTooJxB13PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a104fb9cec56b8142aa515530d156d843640016f62dc4029da3ce20ebde19f66","last_reissued_at":"2026-05-18T00:38:04.392558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:04.392558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07692","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-18T00:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNwK4eExr9Vgbj9pwd7G8lDiffhRcdcEXQQHEKz9YttFKMg74edXfMNnzDFw2VCaqO1rySuVLupqKow70Y30DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:54.132009Z"},"content_sha256":"d8b920311d61fd3413cd691a61618465998350d64f005d66a16c3a3bd892c44d","schema_version":"1.0","event_id":"sha256:d8b920311d61fd3413cd691a61618465998350d64f005d66a16c3a3bd892c44d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UECPXHHMK24BIKVFCVJQ2FLNQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GROUPS-NET: Group Meetings Aware Routing in Multi-Hop D2D Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Antonio A. F. Loureiro, Clayson Celes, Ivan O. Nunes, Pedro O. S. Vaz de Melo","submitted_at":"2016-05-25T00:34:45Z","abstract_excerpt":"In the next generation cellular networks, device-to-device (D2D) communication is already considered a fundamental feature. A problem of multi-hop D2D networks is on how to define forwarding algorithms that achieve, at the same time, high delivery ratio and low network overhead. In this paper we aim to understand group meetings' properties by looking at their structure and regularity with the final goal of applying such knowledge in the design of a forwarding algorithm for D2D multi-hop networks. We introduce a forwarding protocol, namely GROUPS-NET, which is aware of social group meetings and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07692","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-18T00:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHETRuDmno97WLMnEpqOrMqsGXBcGFcosGso27KwtT2X9Rc7/vwl92pe8mVLDL5POmCe0Nti+Z8L9lEpHDuYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:55:54.132365Z"},"content_sha256":"932acb9419ba7b70933b0b07c09eaec9ecea661dc1fe381c2549aaf1533afb42","schema_version":"1.0","event_id":"sha256:932acb9419ba7b70933b0b07c09eaec9ecea661dc1fe381c2549aaf1533afb42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/bundle.json","state_url":"https://pith.science/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/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-26T13:55:54Z","links":{"resolver":"https://pith.science/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ","bundle":"https://pith.science/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/bundle.json","state":"https://pith.science/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UECPXHHMK24BIKVFCVJQ2FLNQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UECPXHHMK24BIKVFCVJQ2FLNQQ","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":"72353a415b6713c11f5c4da5c4e122220ba519b8b6a974f5c6f681242ce52cb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T00:34:45Z","title_canon_sha256":"615b5c4e6c5a422ed9ec7efe5d031eff7b8a925a45189acfaf2d6b306d6350cf"},"schema_version":"1.0","source":{"id":"1605.07692","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07692","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07692v2","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07692","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"UECPXHHMK24B","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UECPXHHMK24BIKVF","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UECPXHHM","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:932acb9419ba7b70933b0b07c09eaec9ecea661dc1fe381c2549aaf1533afb42","target":"graph","created_at":"2026-05-18T00:38:04Z","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":"In the next generation cellular networks, device-to-device (D2D) communication is already considered a fundamental feature. A problem of multi-hop D2D networks is on how to define forwarding algorithms that achieve, at the same time, high delivery ratio and low network overhead. In this paper we aim to understand group meetings' properties by looking at their structure and regularity with the final goal of applying such knowledge in the design of a forwarding algorithm for D2D multi-hop networks. We introduce a forwarding protocol, namely GROUPS-NET, which is aware of social group meetings and","authors_text":"Antonio A. F. Loureiro, Clayson Celes, Ivan O. Nunes, Pedro O. S. Vaz de Melo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T00:34:45Z","title":"GROUPS-NET: Group Meetings Aware Routing in Multi-Hop D2D Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07692","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:d8b920311d61fd3413cd691a61618465998350d64f005d66a16c3a3bd892c44d","target":"record","created_at":"2026-05-18T00:38:04Z","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":"72353a415b6713c11f5c4da5c4e122220ba519b8b6a974f5c6f681242ce52cb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T00:34:45Z","title_canon_sha256":"615b5c4e6c5a422ed9ec7efe5d031eff7b8a925a45189acfaf2d6b306d6350cf"},"schema_version":"1.0","source":{"id":"1605.07692","kind":"arxiv","version":2}},"canonical_sha256":"a104fb9cec56b8142aa515530d156d843640016f62dc4029da3ce20ebde19f66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a104fb9cec56b8142aa515530d156d843640016f62dc4029da3ce20ebde19f66","first_computed_at":"2026-05-18T00:38:04.392558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:04.392558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bg4PiOiHDudaDQuPgpfQIJQCpbYRecABLnUoBeoFZVcQkkeaL6R8XueV9GeKzdb/ajS4oPrfuAzTooJxB13PAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:04.393185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07692","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b920311d61fd3413cd691a61618465998350d64f005d66a16c3a3bd892c44d","sha256:932acb9419ba7b70933b0b07c09eaec9ecea661dc1fe381c2549aaf1533afb42"],"state_sha256":"88bbfc4783be5d5dfcb486d26cf9b927f494aa2d704d5f22da55764dc5cc80cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3E3doPe2vYki9guoNne1fj6gdLstbV3CuyidVvuPcnrkfnwPBjAL2b2M4zPJdEMDDArun3/YMm/OssIeZR4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:55:54.134309Z","bundle_sha256":"295a6b301c7302a048456c00d1a617a8003a367a9ddbcc15cc24ed38ce2c6d08"}}