{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IUGYK53YD3V4RPPWZVWJ2EMGID","short_pith_number":"pith:IUGYK53Y","canonical_record":{"source":{"id":"1804.09448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T09:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"4385eba1bab1a5d9511c1bca2c10cfe630543265e97de3360cff3c61d65b8041","abstract_canon_sha256":"c2eacc4022edc8dd2dbc06d3901e9e9271a339af156848df034fe945cda8a1bd"},"schema_version":"1.0"},"canonical_sha256":"450d8577781eebc8bdf6cd6c9d118640f87aed124e4091764fe15e14db279017","source":{"kind":"arxiv","id":"1804.09448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09448","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09448v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09448","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"IUGYK53YD3V4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUGYK53YD3V4RPPW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUGYK53Y","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IUGYK53YD3V4RPPWZVWJ2EMGID","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T09:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"4385eba1bab1a5d9511c1bca2c10cfe630543265e97de3360cff3c61d65b8041","abstract_canon_sha256":"c2eacc4022edc8dd2dbc06d3901e9e9271a339af156848df034fe945cda8a1bd"},"schema_version":"1.0"},"canonical_sha256":"450d8577781eebc8bdf6cd6c9d118640f87aed124e4091764fe15e14db279017","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.777450Z","signature_b64":"pEijir48qTR6ybjGo/TvL4Dj+eMKuvdqdAyLQud1CrspBCy2PsbVjaEH7JC4DqwwNTL687/0rlhPvJhLPVtDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450d8577781eebc8bdf6cd6c9d118640f87aed124e4091764fe15e14db279017","last_reissued_at":"2026-05-18T00:17:31.776802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.776802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09448","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jl8DZaCrZ1aAcmpM5gU2zB5sUntWVPXSv+RyXVMzf99+PSFHTqgiT+O1DEaAzvfmsAm3nehv3/6xYpEHwx3sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:21.338808Z"},"content_sha256":"c93bd08c6e5c5e04570bfd2f722bf02718617ca42376298c0db3cb04609317b9","schema_version":"1.0","event_id":"sha256:c93bd08c6e5c5e04570bfd2f722bf02718617ca42376298c0db3cb04609317b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IUGYK53YD3V4RPPWZVWJ2EMGID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extensor-Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cornelius Brand, Holger Dell, Thore Husfeldt","submitted_at":"2018-04-25T09:29:09Z","abstract_excerpt":"We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \\pm \\varepsilon$. Our algorithm runs in time $\\varepsilon^{-2} 4^k(n+m) \\operatorname{poly}(k)$. The algorithm is based on associating with each vertex an element in the exterior (or, Grassmann) algebra, called an extensor, and then performing computations in this algebra. This connection to exterior algebra generalizes a number of previous approaches for the longest path problem and is of independent conceptual interest. Using this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09448","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVU+NqjSnSOB6Njy4vLHc/YTqqK/cDfcNZXR25LRkagjCd5FBbT6kFSE0MF/wOek9St1abHXNXAay4TXsTNiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:21.339199Z"},"content_sha256":"a9699180803d85a4615cc91ad2acbf7ec70cc3ed34c108b945b10e13057fb0d5","schema_version":"1.0","event_id":"sha256:a9699180803d85a4615cc91ad2acbf7ec70cc3ed34c108b945b10e13057fb0d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/bundle.json","state_url":"https://pith.science/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/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-30T11:05:21Z","links":{"resolver":"https://pith.science/pith/IUGYK53YD3V4RPPWZVWJ2EMGID","bundle":"https://pith.science/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/bundle.json","state":"https://pith.science/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUGYK53YD3V4RPPWZVWJ2EMGID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IUGYK53YD3V4RPPWZVWJ2EMGID","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":"c2eacc4022edc8dd2dbc06d3901e9e9271a339af156848df034fe945cda8a1bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T09:29:09Z","title_canon_sha256":"4385eba1bab1a5d9511c1bca2c10cfe630543265e97de3360cff3c61d65b8041"},"schema_version":"1.0","source":{"id":"1804.09448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09448","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09448v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09448","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"IUGYK53YD3V4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUGYK53YD3V4RPPW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUGYK53Y","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a9699180803d85a4615cc91ad2acbf7ec70cc3ed34c108b945b10e13057fb0d5","target":"graph","created_at":"2026-05-18T00:17:31Z","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":"We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \\pm \\varepsilon$. Our algorithm runs in time $\\varepsilon^{-2} 4^k(n+m) \\operatorname{poly}(k)$. The algorithm is based on associating with each vertex an element in the exterior (or, Grassmann) algebra, called an extensor, and then performing computations in this algebra. This connection to exterior algebra generalizes a number of previous approaches for the longest path problem and is of independent conceptual interest. Using this","authors_text":"Cornelius Brand, Holger Dell, Thore Husfeldt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T09:29:09Z","title":"Extensor-Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09448","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:c93bd08c6e5c5e04570bfd2f722bf02718617ca42376298c0db3cb04609317b9","target":"record","created_at":"2026-05-18T00:17:31Z","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":"c2eacc4022edc8dd2dbc06d3901e9e9271a339af156848df034fe945cda8a1bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T09:29:09Z","title_canon_sha256":"4385eba1bab1a5d9511c1bca2c10cfe630543265e97de3360cff3c61d65b8041"},"schema_version":"1.0","source":{"id":"1804.09448","kind":"arxiv","version":1}},"canonical_sha256":"450d8577781eebc8bdf6cd6c9d118640f87aed124e4091764fe15e14db279017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450d8577781eebc8bdf6cd6c9d118640f87aed124e4091764fe15e14db279017","first_computed_at":"2026-05-18T00:17:31.776802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:31.776802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pEijir48qTR6ybjGo/TvL4Dj+eMKuvdqdAyLQud1CrspBCy2PsbVjaEH7JC4DqwwNTL687/0rlhPvJhLPVtDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:31.777450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c93bd08c6e5c5e04570bfd2f722bf02718617ca42376298c0db3cb04609317b9","sha256:a9699180803d85a4615cc91ad2acbf7ec70cc3ed34c108b945b10e13057fb0d5"],"state_sha256":"6dca774d570252ad9c95da5f41308650f658629ebbca2824cb97fd8a85f9eb34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/ydAhgfoohTNsvz4ANkNe7wF5HZAcOrtrw8iuhO9h6HG5uMEOy3rep1PmNfhikq/LCYc7LDkgkxh7QYdw+QCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:05:21.341798Z","bundle_sha256":"5d2a5446ed2dde23070450626d2ee29ea0dfa8bfa25569369d9f42546c0ef8ea"}}