{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5FDGVAYCNW5SRWGMOYN64D7WZ4","short_pith_number":"pith:5FDGVAYC","canonical_record":{"source":{"id":"2312.15138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-23T02:24:59Z","cross_cats_sorted":[],"title_canon_sha256":"68f6760626f0493d51cffbe1f1cecd6bfca2d8d1dc3e624b79b7ae447dc81bbf","abstract_canon_sha256":"c2ce92a6dc4d9c8841d99c5139ea0f3e6db12ac8a529213b48897394b2cf35f7"},"schema_version":"1.0"},"canonical_sha256":"e9466a83026dbb28d8cc761bee0ff6cf2f48d79e19e6c837d4f9c03144f8bbb2","source":{"kind":"arxiv","id":"2312.15138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15138","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15138v2","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15138","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"5FDGVAYCNW5S","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"5FDGVAYCNW5SRWGM","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"5FDGVAYC","created_at":"2026-07-05T08:13:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5FDGVAYCNW5SRWGMOYN64D7WZ4","target":"record","payload":{"canonical_record":{"source":{"id":"2312.15138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-23T02:24:59Z","cross_cats_sorted":[],"title_canon_sha256":"68f6760626f0493d51cffbe1f1cecd6bfca2d8d1dc3e624b79b7ae447dc81bbf","abstract_canon_sha256":"c2ce92a6dc4d9c8841d99c5139ea0f3e6db12ac8a529213b48897394b2cf35f7"},"schema_version":"1.0"},"canonical_sha256":"e9466a83026dbb28d8cc761bee0ff6cf2f48d79e19e6c837d4f9c03144f8bbb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:10.943507Z","signature_b64":"aMh9HJshtl/0mypI9Too3ilBdNpmds1FV4Apm3KmLFaVKey142uEnY37I3qj3g4UjzPdZqU2HbxQI5CQZWj2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9466a83026dbb28d8cc761bee0ff6cf2f48d79e19e6c837d4f9c03144f8bbb2","last_reissued_at":"2026-07-05T08:13:10.943048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:10.943048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.15138","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-07-05T08:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G85+ffa8G+IkDvgDn2+QpUItG9TpRI9pO8mKBkCzvt6zxrulp3KNhV8bVYEleRABB0FjJuZaU/i7IvytVj4sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:57:16.940872Z"},"content_sha256":"7cea8f93fcc2c797e2c9e91711e1926d660dc50a63d58e784a7cc67d6206cd67","schema_version":"1.0","event_id":"sha256:7cea8f93fcc2c797e2c9e91711e1926d660dc50a63d58e784a7cc67d6206cd67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5FDGVAYCNW5SRWGMOYN64D7WZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPGA-Based Accelerator for Graph Embedding using Sequential Training Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hiroki Matsutani, Kazuki Sunaga, Keisuke Sugiura","submitted_at":"2023-12-23T02:24:59Z","abstract_excerpt":"A graph embedding is an emerging approach that can represent a graph structure with a fixed-length low-dimensional vector. node2vec is a well-known algorithm to obtain such a graph embedding by sampling neighboring nodes on a given graph with a random walk technique. However, the original node2vec algorithm typically relies on a batch training of graph structures; thus, it is not suited for applications in which the graph structure changes after the deployment. In this paper, we focus on node2vec applications for IoT (Internet of Things) environments. To handle the changes of graph structures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15138","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.15138/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-05T08:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmd9paaesnU1xM3oAXd9MoGMbhiEhSkBw0eGjYKYwgNp4w+ciX5LEgOuJprHrxEMQ7F7ufSEnfKKEbj8CQmTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:57:16.941241Z"},"content_sha256":"110c516dc74cbdeb752a9e81e2896d8d343d033f43c8befd59c62d607e3e7ec0","schema_version":"1.0","event_id":"sha256:110c516dc74cbdeb752a9e81e2896d8d343d033f43c8befd59c62d607e3e7ec0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/bundle.json","state_url":"https://pith.science/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/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-07-07T09:57:16Z","links":{"resolver":"https://pith.science/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4","bundle":"https://pith.science/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/bundle.json","state":"https://pith.science/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FDGVAYCNW5SRWGMOYN64D7WZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5FDGVAYCNW5SRWGMOYN64D7WZ4","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":"c2ce92a6dc4d9c8841d99c5139ea0f3e6db12ac8a529213b48897394b2cf35f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-23T02:24:59Z","title_canon_sha256":"68f6760626f0493d51cffbe1f1cecd6bfca2d8d1dc3e624b79b7ae447dc81bbf"},"schema_version":"1.0","source":{"id":"2312.15138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15138","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15138v2","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15138","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"5FDGVAYCNW5S","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"5FDGVAYCNW5SRWGM","created_at":"2026-07-05T08:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"5FDGVAYC","created_at":"2026-07-05T08:13:10Z"}],"graph_snapshots":[{"event_id":"sha256:110c516dc74cbdeb752a9e81e2896d8d343d033f43c8befd59c62d607e3e7ec0","target":"graph","created_at":"2026-07-05T08:13: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.15138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph embedding is an emerging approach that can represent a graph structure with a fixed-length low-dimensional vector. node2vec is a well-known algorithm to obtain such a graph embedding by sampling neighboring nodes on a given graph with a random walk technique. However, the original node2vec algorithm typically relies on a batch training of graph structures; thus, it is not suited for applications in which the graph structure changes after the deployment. In this paper, we focus on node2vec applications for IoT (Internet of Things) environments. To handle the changes of graph structures ","authors_text":"Hiroki Matsutani, Kazuki Sunaga, Keisuke Sugiura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-23T02:24:59Z","title":"An FPGA-Based Accelerator for Graph Embedding using Sequential Training Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15138","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:7cea8f93fcc2c797e2c9e91711e1926d660dc50a63d58e784a7cc67d6206cd67","target":"record","created_at":"2026-07-05T08:13: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":"c2ce92a6dc4d9c8841d99c5139ea0f3e6db12ac8a529213b48897394b2cf35f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-23T02:24:59Z","title_canon_sha256":"68f6760626f0493d51cffbe1f1cecd6bfca2d8d1dc3e624b79b7ae447dc81bbf"},"schema_version":"1.0","source":{"id":"2312.15138","kind":"arxiv","version":2}},"canonical_sha256":"e9466a83026dbb28d8cc761bee0ff6cf2f48d79e19e6c837d4f9c03144f8bbb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9466a83026dbb28d8cc761bee0ff6cf2f48d79e19e6c837d4f9c03144f8bbb2","first_computed_at":"2026-07-05T08:13:10.943048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:13:10.943048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aMh9HJshtl/0mypI9Too3ilBdNpmds1FV4Apm3KmLFaVKey142uEnY37I3qj3g4UjzPdZqU2HbxQI5CQZWj2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:13:10.943507Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.15138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cea8f93fcc2c797e2c9e91711e1926d660dc50a63d58e784a7cc67d6206cd67","sha256:110c516dc74cbdeb752a9e81e2896d8d343d033f43c8befd59c62d607e3e7ec0"],"state_sha256":"bafca97e6d0599b89ae29947db691debfd4738cabd3bc8d6adc8008c12020e7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rLK2Tc//YuRIs1OF+sU3cuj6qy4OvgZLQoOWJ13lE7yLFIgCOjdjbX7uM1E3qCJkiw8eH7UDojiqYD78vjkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:57:16.943246Z","bundle_sha256":"c27d43a30038021a1842aa18b14d430096597fb5b457b1c5bd0076b263045899"}}