{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TTYCNDFXHE6JZDOQMTWXVJHCXE","short_pith_number":"pith:TTYCNDFX","schema_version":"1.0","canonical_sha256":"9cf0268cb7393c9c8dd064ed7aa4e2b93ff7e92d37955a47b9d17adc43f099e2","source":{"kind":"arxiv","id":"1508.05804","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.05804","created_at":"2026-05-18T01:10:38.438973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05804v2","created_at":"2026-05-18T01:10:38.438973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05804","created_at":"2026-05-18T01:10:38.438973+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTYCNDFXHE6J","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTYCNDFXHE6JZDOQ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTYCNDFX","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE","json":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE.json","graph_json":"https://pith.science/api/pith-number/TTYCNDFXHE6JZDOQMTWXVJHCXE/graph.json","events_json":"https://pith.science/api/pith-number/TTYCNDFXHE6JZDOQMTWXVJHCXE/events.json","paper":"https://pith.science/paper/TTYCNDFX"},"agent_actions":{"view_html":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE","download_json":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE.json","view_paper":"https://pith.science/paper/TTYCNDFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05804&json=true","fetch_graph":"https://pith.science/api/pith-number/TTYCNDFXHE6JZDOQMTWXVJHCXE/graph.json","fetch_events":"https://pith.science/api/pith-number/TTYCNDFXHE6JZDOQMTWXVJHCXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/action/storage_attestation","attest_author":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/action/author_attestation","sign_citation":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/action/citation_signature","submit_replication":"https://pith.science/pith/TTYCNDFXHE6JZDOQMTWXVJHCXE/action/replication_record"}},"created_at":"2026-05-18T01:10:38.438973+00:00","updated_at":"2026-05-18T01:10:38.438973+00:00"}