{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:42HDN6D4RTUCLNPLHT43WUIEAO","short_pith_number":"pith:42HDN6D4","canonical_record":{"source":{"id":"1304.3090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"a9806ac65568febf31834cce4a1f3484608c109edd218a6654261290ed076cd1","abstract_canon_sha256":"a74ccbdfc587f00291cff4364520baf36cb58216b3a1ef45de6ba8ec677d076a"},"schema_version":"1.0"},"canonical_sha256":"e68e36f87c8ce825b5eb3cf9bb510403982433df598fe54131475911dea182ca","source":{"kind":"arxiv","id":"1304.3090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3090","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3090v1","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3090","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"42HDN6D4RTUC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"42HDN6D4RTUCLNPL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"42HDN6D4","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:42HDN6D4RTUCLNPLHT43WUIEAO","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"a9806ac65568febf31834cce4a1f3484608c109edd218a6654261290ed076cd1","abstract_canon_sha256":"a74ccbdfc587f00291cff4364520baf36cb58216b3a1ef45de6ba8ec677d076a"},"schema_version":"1.0"},"canonical_sha256":"e68e36f87c8ce825b5eb3cf9bb510403982433df598fe54131475911dea182ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:18.823927Z","signature_b64":"Xxw9Ro09UmBaUjXdqzovICW5j9z9qHB0xAteDY7X6WZbCSvFwl2QHBu0WSnLeV5bPMHfwzYrgk/50sjJN4AiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68e36f87c8ce825b5eb3cf9bb510403982433df598fe54131475911dea182ca","last_reissued_at":"2026-05-18T03:28:18.823379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:18.823379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3090","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAPff1cEbIb9WgEoinCyrEGQBcLYHYu/oP+P/zY4XBfwTu/GAfl1IjinKCrLV4QspGrvVoICz4EdYUMs/Kc6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:23:27.827499Z"},"content_sha256":"7618016be203aaf4963a8b0c6b4ed7e713515fd256341c8416133940b9fca0b4","schema_version":"1.0","event_id":"sha256:7618016be203aaf4963a8b0c6b4ed7e713515fd256341c8416133940b9fca0b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:42HDN6D4RTUCLNPLHT43WUIEAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Myth of Modularity in Rule-Based Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Heckerman, Eric J. Horvitz","submitted_at":"2013-03-27T19:52:23Z","abstract_excerpt":"In this paper, we examine the concept of modularity, an often cited advantage of the ruled-based representation methodology. We argue that the notion of modularity consists of two distinct concepts which we call syntactic modularity and semantic modularity. We argue that when reasoning under certainty, it is reasonable to regard the rule-based approach as both syntactically and semantically modular. However, we argue that in the case of plausible reasoning, rules are syntactically modular but are rarely semantically modular. To illustrate this point, we examine a particular approach for managi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3090","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5TVoqzCaEVGr+Lfxa6qgI/xU9hQLy35cDzNwnowi3H5LWqROUXpKc8ed5psIquMZ23VCsrIXzVHuJ9EcEv+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:23:27.827846Z"},"content_sha256":"285c4b5f3488b592aa57344f7a3beb98e277a47d17121ad5df8da0857a70a206","schema_version":"1.0","event_id":"sha256:285c4b5f3488b592aa57344f7a3beb98e277a47d17121ad5df8da0857a70a206"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42HDN6D4RTUCLNPLHT43WUIEAO/bundle.json","state_url":"https://pith.science/pith/42HDN6D4RTUCLNPLHT43WUIEAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42HDN6D4RTUCLNPLHT43WUIEAO/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-07-02T09:23:27Z","links":{"resolver":"https://pith.science/pith/42HDN6D4RTUCLNPLHT43WUIEAO","bundle":"https://pith.science/pith/42HDN6D4RTUCLNPLHT43WUIEAO/bundle.json","state":"https://pith.science/pith/42HDN6D4RTUCLNPLHT43WUIEAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42HDN6D4RTUCLNPLHT43WUIEAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:42HDN6D4RTUCLNPLHT43WUIEAO","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":"a74ccbdfc587f00291cff4364520baf36cb58216b3a1ef45de6ba8ec677d076a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:52:23Z","title_canon_sha256":"a9806ac65568febf31834cce4a1f3484608c109edd218a6654261290ed076cd1"},"schema_version":"1.0","source":{"id":"1304.3090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3090","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3090v1","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3090","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"42HDN6D4RTUC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"42HDN6D4RTUCLNPL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"42HDN6D4","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:285c4b5f3488b592aa57344f7a3beb98e277a47d17121ad5df8da0857a70a206","target":"graph","created_at":"2026-05-18T03:28:18Z","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 paper, we examine the concept of modularity, an often cited advantage of the ruled-based representation methodology. We argue that the notion of modularity consists of two distinct concepts which we call syntactic modularity and semantic modularity. We argue that when reasoning under certainty, it is reasonable to regard the rule-based approach as both syntactically and semantically modular. However, we argue that in the case of plausible reasoning, rules are syntactically modular but are rarely semantically modular. To illustrate this point, we examine a particular approach for managi","authors_text":"David Heckerman, Eric J. Horvitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:52:23Z","title":"The Myth of Modularity in Rule-Based Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3090","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:7618016be203aaf4963a8b0c6b4ed7e713515fd256341c8416133940b9fca0b4","target":"record","created_at":"2026-05-18T03:28:18Z","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":"a74ccbdfc587f00291cff4364520baf36cb58216b3a1ef45de6ba8ec677d076a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:52:23Z","title_canon_sha256":"a9806ac65568febf31834cce4a1f3484608c109edd218a6654261290ed076cd1"},"schema_version":"1.0","source":{"id":"1304.3090","kind":"arxiv","version":1}},"canonical_sha256":"e68e36f87c8ce825b5eb3cf9bb510403982433df598fe54131475911dea182ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68e36f87c8ce825b5eb3cf9bb510403982433df598fe54131475911dea182ca","first_computed_at":"2026-05-18T03:28:18.823379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:18.823379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xxw9Ro09UmBaUjXdqzovICW5j9z9qHB0xAteDY7X6WZbCSvFwl2QHBu0WSnLeV5bPMHfwzYrgk/50sjJN4AiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:18.823927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7618016be203aaf4963a8b0c6b4ed7e713515fd256341c8416133940b9fca0b4","sha256:285c4b5f3488b592aa57344f7a3beb98e277a47d17121ad5df8da0857a70a206"],"state_sha256":"54374534e08ddfd8561a6fda27d0ba68bdb2fddac2842117a417b2069b7983f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86xzMyengZE1I1dV+E/hyX56lMqHaTo4svejOlU+jvotkdocM7WA8Lwh//G36CIZhDE5SBwHfEkguXfhHGaOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:23:27.829859Z","bundle_sha256":"656c0929689b540ad0755d48ef77eb8ac0b0e794297480d73660d7ecf1438028"}}