{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TTYCNDFXHE6JZDOQMTWXVJHCXE","short_pith_number":"pith:TTYCNDFX","canonical_record":{"source":{"id":"1508.05804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-24T13:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"0cf7b1093e183557343a0ba10bc55d57c80aa2cc5d411c35337866d342a9b1c6","abstract_canon_sha256":"8bf6d7f5112d0e7bd1a8edbaa0301ce001b826b86cd8f66b456ffee9d21f083c"},"schema_version":"1.0"},"canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","source":{"kind":"arxiv","id":"1508.05804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05804","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05804v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05804","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"TTYCNDFXHE6J","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TTYCNDFXHE6JZDOQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TTYCNDFX","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TTYCNDFXHE6JZDOQMTWXVJHCXE","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-24T13:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"0cf7b1093e183557343a0ba10bc55d57c80aa2cc5d411c35337866d342a9b1c6","abstract_canon_sha256":"8bf6d7f5112d0e7bd1a8edbaa0301ce001b826b86cd8f66b456ffee9d21f083c"},"schema_version":"1.0"},"canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.439426Z","signature_b64":"Q0DD9UCD579n7Y4TC2EZx4gcsTWeLy2W9ZaXCIBvXvem/ePqM3n06tlt5bbOFyGyhulMYb1lJyI3Htt29yxHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","last_reissued_at":"2026-05-18T01:10:38.438888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.438888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05804","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-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdiOnZ63QT3HCon7V7b0VVsqx8PsXbHfHAvSeDrJNqN3g/KRRDSks8bCFhm2mGzi7BMqLxUJTsN50SaGDty+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:01:22.830144Z"},"content_sha256":"29d364cfdd994b784c9c5ffa87ff4f358daae259d5f77fd5ce6cecd3edf294dc","schema_version":"1.0","event_id":"sha256:29d364cfdd994b784c9c5ffa87ff4f358daae259d5f77fd5ce6cecd3edf294dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TTYCNDFXHE6JZDOQMTWXVJHCXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the complexity of the causal ordering problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bernardo Gon\\c{c}alves, Fabio Porto","submitted_at":"2015-08-24T13:56:32Z","abstract_excerpt":"In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical algorithm to infer causal ordering is NP-Hard---an intractability previously guessed but never proven. We present then a detailed account based on Nayak's suggested algorithmic solution (the best available), which is dominated by computing transitive closure---bounded in time by $O(|\\mathcal V|\\cdot |\\mathcal S|)$, where $\\mathcal S(\\mathcal E, \\mathcal V)$ is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05804","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-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HySwaGXj0LrbEEuqQy1Nda6N4rSVlCs3spMz82sddL2zJ5RHT2NPKnBgnLHTpwasLRo1+A7e6xtit97n+UUUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:01:22.830510Z"},"content_sha256":"f69bf92a503ad5759468a8e1642a6dabedab3af5334932e556be14ab00b2c48f","schema_version":"1.0","event_id":"sha256:f69bf92a503ad5759468a8e1642a6dabedab3af5334932e556be14ab00b2c48f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/bundle.json","state_url":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/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-11T11:01:22Z","links":{"resolver":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE","bundle":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/bundle.json","state":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TTYCNDFXHE6JZDOQMTWXVJHCXE","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":"8bf6d7f5112d0e7bd1a8edbaa0301ce001b826b86cd8f66b456ffee9d21f083c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-24T13:56:32Z","title_canon_sha256":"0cf7b1093e183557343a0ba10bc55d57c80aa2cc5d411c35337866d342a9b1c6"},"schema_version":"1.0","source":{"id":"1508.05804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05804","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05804v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05804","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"TTYCNDFXHE6J","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TTYCNDFXHE6JZDOQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TTYCNDFX","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f69bf92a503ad5759468a8e1642a6dabedab3af5334932e556be14ab00b2c48f","target":"graph","created_at":"2026-05-18T01:10:38Z","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 note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical algorithm to infer causal ordering is NP-Hard---an intractability previously guessed but never proven. We present then a detailed account based on Nayak's suggested algorithmic solution (the best available), which is dominated by computing transitive closure---bounded in time by $O(|\\mathcal V|\\cdot |\\mathcal S|)$, where $\\mathcal S(\\mathcal E, \\mathcal V)$ is t","authors_text":"Bernardo Gon\\c{c}alves, Fabio Porto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-24T13:56:32Z","title":"A note on the complexity of the causal ordering problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05804","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:29d364cfdd994b784c9c5ffa87ff4f358daae259d5f77fd5ce6cecd3edf294dc","target":"record","created_at":"2026-05-18T01:10:38Z","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":"8bf6d7f5112d0e7bd1a8edbaa0301ce001b826b86cd8f66b456ffee9d21f083c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-24T13:56:32Z","title_canon_sha256":"0cf7b1093e183557343a0ba10bc55d57c80aa2cc5d411c35337866d342a9b1c6"},"schema_version":"1.0","source":{"id":"1508.05804","kind":"arxiv","version":2}},"canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","first_computed_at":"2026-05-18T01:10:38.438888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:38.438888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q0DD9UCD579n7Y4TC2EZx4gcsTWeLy2W9ZaXCIBvXvem/ePqM3n06tlt5bbOFyGyhulMYb1lJyI3Htt29yxHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:38.439426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29d364cfdd994b784c9c5ffa87ff4f358daae259d5f77fd5ce6cecd3edf294dc","sha256:f69bf92a503ad5759468a8e1642a6dabedab3af5334932e556be14ab00b2c48f"],"state_sha256":"ada3d593c2fc5a426423ed2bcc375fffc351cfba54a232083b7224afbee6ccb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dvui+3R72iZB7eQdIY8dPvsMmNPKxMG87E51MXIDIqdH0VFajwmBkTMDGbGrJyAyhYEebLp8cxSSEzr4X/lCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:01:22.832515Z","bundle_sha256":"ef15c3a747f73685ab4bcdc1ff4e2399f4b3f7cb97945c191ed692cdb878e10e"}}