{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OQAAJKBIKPU5SHKL3ERYFAAMMA","short_pith_number":"pith:OQAAJKBI","canonical_record":{"source":{"id":"1112.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T23:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"99596a51440230a83e63b09261e41f605d7a4ef58f1026e589432e9b0f69cdb5","abstract_canon_sha256":"9597090dc4ac4a7be733a48a058e32648a788624ab6cb0845af9e8055ad75f61"},"schema_version":"1.0"},"canonical_sha256":"740004a82853e9d91d4bd92382800c6030d44695d6995c9a5a351b5209876665","source":{"kind":"arxiv","id":"1112.1444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1444","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1444v2","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1444","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"OQAAJKBIKPU5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OQAAJKBIKPU5SHKL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OQAAJKBI","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OQAAJKBIKPU5SHKL3ERYFAAMMA","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T23:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"99596a51440230a83e63b09261e41f605d7a4ef58f1026e589432e9b0f69cdb5","abstract_canon_sha256":"9597090dc4ac4a7be733a48a058e32648a788624ab6cb0845af9e8055ad75f61"},"schema_version":"1.0"},"canonical_sha256":"740004a82853e9d91d4bd92382800c6030d44695d6995c9a5a351b5209876665","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.364566Z","signature_b64":"t/AYMupzSqJ7xQ7tXa4n9p8aSM5TNj4DT0i6NzrAePuttQFENfgs1S3wSwdMQ15AuCNezqzRTLNIkwZy933bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"740004a82853e9d91d4bd92382800c6030d44695d6995c9a5a351b5209876665","last_reissued_at":"2026-05-18T02:54:47.364146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.364146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1444","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-05-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvLscuqBft1wN9h+DjS0ADT4ywihqTHa7WypPNbDXSjjSqZ6dxrnwT2MX5zzNBd4uXigEIhSViRqrk7vB7hPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:40:57.939519Z"},"content_sha256":"9822dc650c81cdacdec3ad650c601b28e4ca130287d7ce714e470c46d5c5da9a","schema_version":"1.0","event_id":"sha256:9822dc650c81cdacdec3ad650c601b28e4ca130287d7ce714e470c46d5c5da9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OQAAJKBIKPU5SHKL3ERYFAAMMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of strongly connected components in directed hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Xavier Allamigeon","submitted_at":"2011-12-06T23:26:05Z","abstract_excerpt":"We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). \"Almost linear\" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1444","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":""},"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-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bN/PzBtdKPP2MTvXVhiqF1nEZCZREhiFVyANB84fPxvvAbZXPGR92BIrR+raRfmf+3zpKrJ8k4LTQ2u8pAFoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:40:57.940189Z"},"content_sha256":"46205e4da87346d862538ad4af4310e731229195362289a8580ba20adac13656","schema_version":"1.0","event_id":"sha256:46205e4da87346d862538ad4af4310e731229195362289a8580ba20adac13656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/bundle.json","state_url":"https://pith.science/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/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-25T12:40:57Z","links":{"resolver":"https://pith.science/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA","bundle":"https://pith.science/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/bundle.json","state":"https://pith.science/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQAAJKBIKPU5SHKL3ERYFAAMMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OQAAJKBIKPU5SHKL3ERYFAAMMA","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":"9597090dc4ac4a7be733a48a058e32648a788624ab6cb0845af9e8055ad75f61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T23:26:05Z","title_canon_sha256":"99596a51440230a83e63b09261e41f605d7a4ef58f1026e589432e9b0f69cdb5"},"schema_version":"1.0","source":{"id":"1112.1444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1444","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1444v2","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1444","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"OQAAJKBIKPU5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OQAAJKBIKPU5SHKL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OQAAJKBI","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:46205e4da87346d862538ad4af4310e731229195362289a8580ba20adac13656","target":"graph","created_at":"2026-05-18T02:54:47Z","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 study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). \"Almost linear\" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergrap","authors_text":"Xavier Allamigeon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T23:26:05Z","title":"On the complexity of strongly connected components in directed hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1444","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:9822dc650c81cdacdec3ad650c601b28e4ca130287d7ce714e470c46d5c5da9a","target":"record","created_at":"2026-05-18T02:54:47Z","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":"9597090dc4ac4a7be733a48a058e32648a788624ab6cb0845af9e8055ad75f61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T23:26:05Z","title_canon_sha256":"99596a51440230a83e63b09261e41f605d7a4ef58f1026e589432e9b0f69cdb5"},"schema_version":"1.0","source":{"id":"1112.1444","kind":"arxiv","version":2}},"canonical_sha256":"740004a82853e9d91d4bd92382800c6030d44695d6995c9a5a351b5209876665","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"740004a82853e9d91d4bd92382800c6030d44695d6995c9a5a351b5209876665","first_computed_at":"2026-05-18T02:54:47.364146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:47.364146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/AYMupzSqJ7xQ7tXa4n9p8aSM5TNj4DT0i6NzrAePuttQFENfgs1S3wSwdMQ15AuCNezqzRTLNIkwZy933bCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:47.364566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9822dc650c81cdacdec3ad650c601b28e4ca130287d7ce714e470c46d5c5da9a","sha256:46205e4da87346d862538ad4af4310e731229195362289a8580ba20adac13656"],"state_sha256":"f5f5e99930c5c4bffad27115eb1cb521d7b0346d8f33385663180567da989a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Na5pVbJl106VAlzEW38xnUL1ziahIqXypIAU/ZYDpEObcfDZ0wL+9SVpWtAjfMtsDgMITFdonluo2RDrfFW5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:40:57.943674Z","bundle_sha256":"48b0243efd8937287500649d737937672962790fcb6d0c5dcbd7c56542eddb13"}}