{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TKYSFJ4B5ZD2XMRFHRCP7U75D2","short_pith_number":"pith:TKYSFJ4B","canonical_record":{"source":{"id":"2412.05684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-07T15:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"28f2838d77a63640ba49f95523a960e072ec091672ac345b55cde38c801607f8","abstract_canon_sha256":"47ed0c5539b1da438ac4a4718365e49fe271b1ceef6706730395117a853e36a7"},"schema_version":"1.0"},"canonical_sha256":"9ab122a781ee47abb2253c44ffd3fd1e8f19287222a30e9bcbbc90ffc75b59c6","source":{"kind":"arxiv","id":"2412.05684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05684","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05684v2","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05684","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"TKYSFJ4B5ZD2","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"TKYSFJ4B5ZD2XMRF","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"TKYSFJ4B","created_at":"2026-07-05T09:47:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TKYSFJ4B5ZD2XMRFHRCP7U75D2","target":"record","payload":{"canonical_record":{"source":{"id":"2412.05684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-07T15:40:21Z","cross_cats_sorted":[],"title_canon_sha256":"28f2838d77a63640ba49f95523a960e072ec091672ac345b55cde38c801607f8","abstract_canon_sha256":"47ed0c5539b1da438ac4a4718365e49fe271b1ceef6706730395117a853e36a7"},"schema_version":"1.0"},"canonical_sha256":"9ab122a781ee47abb2253c44ffd3fd1e8f19287222a30e9bcbbc90ffc75b59c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:37.724857Z","signature_b64":"LauvMXhJPrGf/OF5sLBEMIBcf2gyRtvyVlpGxPyviaW/UVz6BG2b9ekt2C0Z/LgW7QjzkSbS1IkXpHu30qngAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab122a781ee47abb2253c44ffd3fd1e8f19287222a30e9bcbbc90ffc75b59c6","last_reissued_at":"2026-07-05T09:47:37.724414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:37.724414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.05684","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-05T09:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfhUazcsF6G7fJSi6zsS6+98Mvmt5o6spLLVmUDUecarJATEDyYOzc7Pbt1StjVoZeMTvqi0RvpvnQcNLD42Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:00:53.808270Z"},"content_sha256":"e03c4fd790013f28e71ab7abbd81eba53110c387e40b1474f3c9f42ab66bce9d","schema_version":"1.0","event_id":"sha256:e03c4fd790013f28e71ab7abbd81eba53110c387e40b1474f3c9f42ab66bce9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TKYSFJ4B5ZD2XMRFHRCP7U75D2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Computation of Path Homology for Stratified Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Zhengtong Zhu, Zhiyi Chi","submitted_at":"2024-12-07T15:40:21Z","abstract_excerpt":"Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute certain high-dimensional (reduced) path homologies of stratified digraphs. By recursion on matrix representations of homologies of subgraphs, the algorithm efficiently computes the full-depth path homology of a stratified digraph, i.e. homology with dimension equal to the depth of the graph. The algorithm can be used to compute full-depth persistent homologies a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05684","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/2412.05684/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-05T09:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISsxxJgykh8KSKm8qktlXL+x75xThgTIqGfATNgqgCOSxRKd21ZOFLbGN0zP+ynj4SgEK/viA0hRkLWK1iaJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:00:53.808767Z"},"content_sha256":"2a5e7b92169faf17093023d28756c6e57c820536f264f2a7482a1e93e67ebd74","schema_version":"1.0","event_id":"sha256:2a5e7b92169faf17093023d28756c6e57c820536f264f2a7482a1e93e67ebd74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/bundle.json","state_url":"https://pith.science/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/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-08-16T02:00:53Z","links":{"resolver":"https://pith.science/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2","bundle":"https://pith.science/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/bundle.json","state":"https://pith.science/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKYSFJ4B5ZD2XMRFHRCP7U75D2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TKYSFJ4B5ZD2XMRFHRCP7U75D2","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":"47ed0c5539b1da438ac4a4718365e49fe271b1ceef6706730395117a853e36a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-07T15:40:21Z","title_canon_sha256":"28f2838d77a63640ba49f95523a960e072ec091672ac345b55cde38c801607f8"},"schema_version":"1.0","source":{"id":"2412.05684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05684","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05684v2","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05684","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"TKYSFJ4B5ZD2","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"TKYSFJ4B5ZD2XMRF","created_at":"2026-07-05T09:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"TKYSFJ4B","created_at":"2026-07-05T09:47:37Z"}],"graph_snapshots":[{"event_id":"sha256:2a5e7b92169faf17093023d28756c6e57c820536f264f2a7482a1e93e67ebd74","target":"graph","created_at":"2026-07-05T09:47:37Z","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/2412.05684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute certain high-dimensional (reduced) path homologies of stratified digraphs. By recursion on matrix representations of homologies of subgraphs, the algorithm efficiently computes the full-depth path homology of a stratified digraph, i.e. homology with dimension equal to the depth of the graph. The algorithm can be used to compute full-depth persistent homologies a","authors_text":"Zhengtong Zhu, Zhiyi Chi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-07T15:40:21Z","title":"Recursive Computation of Path Homology for Stratified Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05684","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:e03c4fd790013f28e71ab7abbd81eba53110c387e40b1474f3c9f42ab66bce9d","target":"record","created_at":"2026-07-05T09:47:37Z","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":"47ed0c5539b1da438ac4a4718365e49fe271b1ceef6706730395117a853e36a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-07T15:40:21Z","title_canon_sha256":"28f2838d77a63640ba49f95523a960e072ec091672ac345b55cde38c801607f8"},"schema_version":"1.0","source":{"id":"2412.05684","kind":"arxiv","version":2}},"canonical_sha256":"9ab122a781ee47abb2253c44ffd3fd1e8f19287222a30e9bcbbc90ffc75b59c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ab122a781ee47abb2253c44ffd3fd1e8f19287222a30e9bcbbc90ffc75b59c6","first_computed_at":"2026-07-05T09:47:37.724414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:37.724414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LauvMXhJPrGf/OF5sLBEMIBcf2gyRtvyVlpGxPyviaW/UVz6BG2b9ekt2C0Z/LgW7QjzkSbS1IkXpHu30qngAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:37.724857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.05684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e03c4fd790013f28e71ab7abbd81eba53110c387e40b1474f3c9f42ab66bce9d","sha256:2a5e7b92169faf17093023d28756c6e57c820536f264f2a7482a1e93e67ebd74"],"state_sha256":"7d0fa68d57020ccc4e7e452021326a837b82f0a960a021f4611bc74286518798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLXvuLe6O5KPEeKimFxYaKYabY7NsyrfpazfoByr2z2ZPQIr1B+C2XdgNHSubE9Xb82nzOqke3K5b//cIjw7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T02:00:53.813558Z","bundle_sha256":"aa8c70b609350ebb0266ccbcef5355700573c59e4e9bb3950bafed58041ab19f"}}