{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O4JAY6IAUKBSVSXP2VUJP4H7XN","short_pith_number":"pith:O4JAY6IA","canonical_record":{"source":{"id":"1809.01398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-05T09:17:56Z","cross_cats_sorted":["cs.DB","cs.DS","cs.PF","math.NA"],"title_canon_sha256":"76cb8c0278857de10f61784679985a5b013fb826a5aeded883d60749c3488210","abstract_canon_sha256":"4a76a1930574cf915008d2ecfd560da2416457a5c5316156de0dc541c29f0537"},"schema_version":"1.0"},"canonical_sha256":"77120c7900a2832acaefd56897f0ffbb737d723c7abd5d6c5a846bb733b03326","source":{"kind":"arxiv","id":"1809.01398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01398","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01398v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01398","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"O4JAY6IAUKBS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O4JAY6IAUKBSVSXP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O4JAY6IA","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O4JAY6IAUKBSVSXP2VUJP4H7XN","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-05T09:17:56Z","cross_cats_sorted":["cs.DB","cs.DS","cs.PF","math.NA"],"title_canon_sha256":"76cb8c0278857de10f61784679985a5b013fb826a5aeded883d60749c3488210","abstract_canon_sha256":"4a76a1930574cf915008d2ecfd560da2416457a5c5316156de0dc541c29f0537"},"schema_version":"1.0"},"canonical_sha256":"77120c7900a2832acaefd56897f0ffbb737d723c7abd5d6c5a846bb733b03326","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:27.730580Z","signature_b64":"C3zN3HCNFxro4xMCTGK2rMtAGr2fhEt8EoFOaDfQ5TLaN4yc/qnFG9mPgylLlt8UUz7fci5WrSWZVSlfcD/jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77120c7900a2832acaefd56897f0ffbb737d723c7abd5d6c5a846bb733b03326","last_reissued_at":"2026-05-18T00:06:27.729943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:27.729943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01398","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQg3u0gCIxHIclidrimHF5LdMLKBdB+I2woSUO8WgZiid7M7fWVgzeExssu38uJ0fQqbfBtJeRLPjXs6gPP/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T01:22:43.512927Z"},"content_sha256":"d2fec96d8fc56b6613e5c57bad57392fd35d100e4f51648155254b459f9b5e40","schema_version":"1.0","event_id":"sha256:d2fec96d8fc56b6613e5c57bad57392fd35d100e4f51648155254b459f9b5e40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O4JAY6IAUKBSVSXP2VUJP4H7XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Flow Analysis Using Graph based Combination of Iterative Methods and Vertex Contraction Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.PF","math.NA"],"primary_cat":"cs.DC","authors_text":"Chen Yuan, Guangyi Liu, Renchang Dai, Zhiwei Wang","submitted_at":"2018-09-05T09:17:56Z","abstract_excerpt":"Compared with relational database (RDB), graph database (GDB) is a more intuitive expression of the real world. Each node in the GDB is a both storage and logic unit. Since it is connected to its neighboring nodes through edges, and its neighboring information could be easily obtained in one-step graph traversal. It is able to conduct local computation independently and all nodes can do their local work in parallel. Then the whole system can be maximally analyzed and assessed in parallel to largely improve the computation performance without sacrificing the precision of final results. This pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01398","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:06:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3rgE8Xi9wldH3NS9iFNthzQ62XCH4dUJy4iKXxG7JNIdPw4/4V6D5BnFqAFnboFnJTRPWp+6dfsvuMD2cF7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T01:22:43.513274Z"},"content_sha256":"b8b923470c6b7e9e1a77f6f2fe3d6c2a0ed3d2d463d87e0efb68cc28c3d4b531","schema_version":"1.0","event_id":"sha256:b8b923470c6b7e9e1a77f6f2fe3d6c2a0ed3d2d463d87e0efb68cc28c3d4b531"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/bundle.json","state_url":"https://pith.science/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/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-21T01:22:43Z","links":{"resolver":"https://pith.science/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN","bundle":"https://pith.science/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/bundle.json","state":"https://pith.science/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4JAY6IAUKBSVSXP2VUJP4H7XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O4JAY6IAUKBSVSXP2VUJP4H7XN","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":"4a76a1930574cf915008d2ecfd560da2416457a5c5316156de0dc541c29f0537","cross_cats_sorted":["cs.DB","cs.DS","cs.PF","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-05T09:17:56Z","title_canon_sha256":"76cb8c0278857de10f61784679985a5b013fb826a5aeded883d60749c3488210"},"schema_version":"1.0","source":{"id":"1809.01398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01398","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01398v1","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01398","created_at":"2026-05-18T00:06:27Z"},{"alias_kind":"pith_short_12","alias_value":"O4JAY6IAUKBS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O4JAY6IAUKBSVSXP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O4JAY6IA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b8b923470c6b7e9e1a77f6f2fe3d6c2a0ed3d2d463d87e0efb68cc28c3d4b531","target":"graph","created_at":"2026-05-18T00:06:27Z","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":"Compared with relational database (RDB), graph database (GDB) is a more intuitive expression of the real world. Each node in the GDB is a both storage and logic unit. Since it is connected to its neighboring nodes through edges, and its neighboring information could be easily obtained in one-step graph traversal. It is able to conduct local computation independently and all nodes can do their local work in parallel. Then the whole system can be maximally analyzed and assessed in parallel to largely improve the computation performance without sacrificing the precision of final results. This pap","authors_text":"Chen Yuan, Guangyi Liu, Renchang Dai, Zhiwei Wang","cross_cats":["cs.DB","cs.DS","cs.PF","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-05T09:17:56Z","title":"Power Flow Analysis Using Graph based Combination of Iterative Methods and Vertex Contraction Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01398","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:d2fec96d8fc56b6613e5c57bad57392fd35d100e4f51648155254b459f9b5e40","target":"record","created_at":"2026-05-18T00:06:27Z","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":"4a76a1930574cf915008d2ecfd560da2416457a5c5316156de0dc541c29f0537","cross_cats_sorted":["cs.DB","cs.DS","cs.PF","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-05T09:17:56Z","title_canon_sha256":"76cb8c0278857de10f61784679985a5b013fb826a5aeded883d60749c3488210"},"schema_version":"1.0","source":{"id":"1809.01398","kind":"arxiv","version":1}},"canonical_sha256":"77120c7900a2832acaefd56897f0ffbb737d723c7abd5d6c5a846bb733b03326","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77120c7900a2832acaefd56897f0ffbb737d723c7abd5d6c5a846bb733b03326","first_computed_at":"2026-05-18T00:06:27.729943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:27.729943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C3zN3HCNFxro4xMCTGK2rMtAGr2fhEt8EoFOaDfQ5TLaN4yc/qnFG9mPgylLlt8UUz7fci5WrSWZVSlfcD/jBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:27.730580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2fec96d8fc56b6613e5c57bad57392fd35d100e4f51648155254b459f9b5e40","sha256:b8b923470c6b7e9e1a77f6f2fe3d6c2a0ed3d2d463d87e0efb68cc28c3d4b531"],"state_sha256":"95f685f5de1e4555ce120d7f2e3cd53cecf503f7ecb6d840a3fb796dbb502581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZOowEJZzmAFOMW6DMucgPU56TlN5zjFC7ozu/oy7spHzQe3iXrQG+CXCPu2de3eQS/yB5rGeGTsqeqvBZHaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T01:22:43.515249Z","bundle_sha256":"51eb526da1adb8b3a251e02d90ceae707fecae78df38f18a6c2349fc192a29b8"}}