{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PZ2Y4EQJAKJRJM36X5RXHIWJRX","short_pith_number":"pith:PZ2Y4EQJ","canonical_record":{"source":{"id":"1609.09068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T14:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"854681d17581c702920efc273c48db2701e9c863c8ef1b99a38d2f2bfdfa7538","abstract_canon_sha256":"77fd33808a2ae802f327c8647ae83a3cdae5dba1e6717588c99bb459b8dfb8cf"},"schema_version":"1.0"},"canonical_sha256":"7e758e1209029314b37ebf6373a2c98dcadf615a6121573335188c08c2a3ef62","source":{"kind":"arxiv","id":"1609.09068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09068","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09068v1","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09068","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"PZ2Y4EQJAKJR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZ2Y4EQJAKJRJM36","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZ2Y4EQJ","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PZ2Y4EQJAKJRJM36X5RXHIWJRX","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T14:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"854681d17581c702920efc273c48db2701e9c863c8ef1b99a38d2f2bfdfa7538","abstract_canon_sha256":"77fd33808a2ae802f327c8647ae83a3cdae5dba1e6717588c99bb459b8dfb8cf"},"schema_version":"1.0"},"canonical_sha256":"7e758e1209029314b37ebf6373a2c98dcadf615a6121573335188c08c2a3ef62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.254446Z","signature_b64":"7w7HoA9l6kSkZj7M0ugjBz54WTPJoVjTq5KkbTdAUfhw6zNbNf0MX4LZBqnUJnhD93r0DSvT9rGqELPcQ78YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e758e1209029314b37ebf6373a2c98dcadf615a6121573335188c08c2a3ef62","last_reissued_at":"2026-05-18T01:03:40.253930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.253930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09068","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-18T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W38fLVmBogBzaJ4uTlILmIJx7AeVEq13BufUBHkX819G6tYGPQZSNtVZFIFvkH6KyXlACDIYa/sdqcMkdLHkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:29:43.376584Z"},"content_sha256":"d82a3c84a8db2d765d8ca5763feeb9112e31dd53368afdb18122ebb929962fb8","schema_version":"1.0","event_id":"sha256:d82a3c84a8db2d765d8ca5763feeb9112e31dd53368afdb18122ebb929962fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PZ2Y4EQJAKJRJM36X5RXHIWJRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph partitioning and a componentwise PageRank algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Engstr\\\"om, Sergei Silvestrov","submitted_at":"2016-09-28T14:21:24Z","abstract_excerpt":"In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known `strongly connected components' as well as another type of components we call `connected acyclic component'. We will give an algorithm based on Tarjan's algorithm for finding strongly connected components used to find such a partitioning. We will also show that the partitioning given by the algorithm is unique and that the underlying graph can be represented as a directed acyclic graph (similar to a pure strongly connected component partitioning).\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09068","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-18T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwuBnUfCX6eSR2Yv/S4Ub5tq4uFQnrBpHa3z6T0mnMmWzJsFuIl/yZMPyoFQI0UfL9ZUFvBFEGoT2MTR8rPrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:29:43.376963Z"},"content_sha256":"9861d331af70ed99c6d0dbd965296e3cc1d854762d7575bb48499488e3f3e2a9","schema_version":"1.0","event_id":"sha256:9861d331af70ed99c6d0dbd965296e3cc1d854762d7575bb48499488e3f3e2a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/bundle.json","state_url":"https://pith.science/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/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-27T20:29:43Z","links":{"resolver":"https://pith.science/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX","bundle":"https://pith.science/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/bundle.json","state":"https://pith.science/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZ2Y4EQJAKJRJM36X5RXHIWJRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PZ2Y4EQJAKJRJM36X5RXHIWJRX","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":"77fd33808a2ae802f327c8647ae83a3cdae5dba1e6717588c99bb459b8dfb8cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T14:21:24Z","title_canon_sha256":"854681d17581c702920efc273c48db2701e9c863c8ef1b99a38d2f2bfdfa7538"},"schema_version":"1.0","source":{"id":"1609.09068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09068","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09068v1","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09068","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"PZ2Y4EQJAKJR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZ2Y4EQJAKJRJM36","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZ2Y4EQJ","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:9861d331af70ed99c6d0dbd965296e3cc1d854762d7575bb48499488e3f3e2a9","target":"graph","created_at":"2026-05-18T01:03:40Z","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 this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known `strongly connected components' as well as another type of components we call `connected acyclic component'. We will give an algorithm based on Tarjan's algorithm for finding strongly connected components used to find such a partitioning. We will also show that the partitioning given by the algorithm is unique and that the underlying graph can be represented as a directed acyclic graph (similar to a pure strongly connected component partitioning).\n  In ","authors_text":"Christopher Engstr\\\"om, Sergei Silvestrov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T14:21:24Z","title":"Graph partitioning and a componentwise PageRank algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09068","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:d82a3c84a8db2d765d8ca5763feeb9112e31dd53368afdb18122ebb929962fb8","target":"record","created_at":"2026-05-18T01:03:40Z","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":"77fd33808a2ae802f327c8647ae83a3cdae5dba1e6717588c99bb459b8dfb8cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T14:21:24Z","title_canon_sha256":"854681d17581c702920efc273c48db2701e9c863c8ef1b99a38d2f2bfdfa7538"},"schema_version":"1.0","source":{"id":"1609.09068","kind":"arxiv","version":1}},"canonical_sha256":"7e758e1209029314b37ebf6373a2c98dcadf615a6121573335188c08c2a3ef62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e758e1209029314b37ebf6373a2c98dcadf615a6121573335188c08c2a3ef62","first_computed_at":"2026-05-18T01:03:40.253930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:40.253930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7w7HoA9l6kSkZj7M0ugjBz54WTPJoVjTq5KkbTdAUfhw6zNbNf0MX4LZBqnUJnhD93r0DSvT9rGqELPcQ78YAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:40.254446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d82a3c84a8db2d765d8ca5763feeb9112e31dd53368afdb18122ebb929962fb8","sha256:9861d331af70ed99c6d0dbd965296e3cc1d854762d7575bb48499488e3f3e2a9"],"state_sha256":"cf4230e4d79797027e8c6cbc0795e7827026160e7a21299dfa6a16650d27e730"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSlYaXDfxdc/MrqKdXzJ6jSorJoH14nWpeEmh3KzxyCKBsd3Omg0W87tTS2i9rJd2TdI2peMKzxm3gqi+mjHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:29:43.379275Z","bundle_sha256":"f0a195cf11664e4e397aabf4dcd23ad55668b3cbff27cf156327a28c7f59bf1b"}}