{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MLHEAOIXD7TPNXTRW5PX5MTNXQ","short_pith_number":"pith:MLHEAOIX","canonical_record":{"source":{"id":"1204.6181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2012-04-27T12:10:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"15e3a36af20fde105163c670a6cd1bc2aeb97f31cf9d5b7e955110f5fc41bd13","abstract_canon_sha256":"ac055ae6a5ddba64bcbca44b480a8bd729adb0ef6729ce8e24cdc2fc247ad3f3"},"schema_version":"1.0"},"canonical_sha256":"62ce4039171fe6f6de71b75f7eb26dbc191f83977c14da5b2138401620e38cca","source":{"kind":"arxiv","id":"1204.6181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6181","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6181v1","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6181","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"MLHEAOIXD7TP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLHEAOIXD7TPNXTR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLHEAOIX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MLHEAOIXD7TPNXTRW5PX5MTNXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2012-04-27T12:10:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"15e3a36af20fde105163c670a6cd1bc2aeb97f31cf9d5b7e955110f5fc41bd13","abstract_canon_sha256":"ac055ae6a5ddba64bcbca44b480a8bd729adb0ef6729ce8e24cdc2fc247ad3f3"},"schema_version":"1.0"},"canonical_sha256":"62ce4039171fe6f6de71b75f7eb26dbc191f83977c14da5b2138401620e38cca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:33.496767Z","signature_b64":"2IJ4e4Gpe/V4YQ+MUudtFI8oyt/6PgnyYeAYZlIFmlZdn5K0JIxWLWje5WcRLpv9OlQtAhgDMCKTotxnuNAfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ce4039171fe6f6de71b75f7eb26dbc191f83977c14da5b2138401620e38cca","last_reissued_at":"2026-05-18T03:25:33.495994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:33.495994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6181","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:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBmjfZ+BxNSwNn99Hzod1xijPJ/puNZKSLSledgvQKl/KeSItEOzIslT2ZRoRvU6cBabECBzPWrTcdMOk14wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:23:08.868896Z"},"content_sha256":"de8102aec4b075e9cde1444a5ce7997d821a808247c209f943199cc09bf2f9b6","schema_version":"1.0","event_id":"sha256:de8102aec4b075e9cde1444a5ce7997d821a808247c209f943199cc09bf2f9b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MLHEAOIXD7TPNXTRW5PX5MTNXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The conduciveness of CA-rule graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"nlin.CG","authors_text":"Valmir C. Barbosa","submitted_at":"2012-04-27T12:10:27Z","abstract_excerpt":"Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the possible solutions to certain problems of combinatorial optimization, choosing its edges appropriately has been shown to lead to conduciveness properties that provide useful insight into the performance of algorithms to solve those problems. Here we study the conduciveness of CA-rule graphs, that is, graphs whose node set is the set of all CA rules given a cell"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6181","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:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCZSbL7tLjUbysIzd2y1WT2oFWbJihBevfr479trcthZ4J3SeK/MEicLNjKxANuzengMAHsZaNs/liJtUo6vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:23:08.869228Z"},"content_sha256":"e099ec26dbe8149bfd7054f202683f63314a137eead2441ca1737410596ee129","schema_version":"1.0","event_id":"sha256:e099ec26dbe8149bfd7054f202683f63314a137eead2441ca1737410596ee129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/bundle.json","state_url":"https://pith.science/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/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-22T09:23:08Z","links":{"resolver":"https://pith.science/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ","bundle":"https://pith.science/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/bundle.json","state":"https://pith.science/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLHEAOIXD7TPNXTRW5PX5MTNXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MLHEAOIXD7TPNXTRW5PX5MTNXQ","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":"ac055ae6a5ddba64bcbca44b480a8bd729adb0ef6729ce8e24cdc2fc247ad3f3","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2012-04-27T12:10:27Z","title_canon_sha256":"15e3a36af20fde105163c670a6cd1bc2aeb97f31cf9d5b7e955110f5fc41bd13"},"schema_version":"1.0","source":{"id":"1204.6181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6181","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6181v1","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6181","created_at":"2026-05-18T03:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"MLHEAOIXD7TP","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLHEAOIXD7TPNXTR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLHEAOIX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:e099ec26dbe8149bfd7054f202683f63314a137eead2441ca1737410596ee129","target":"graph","created_at":"2026-05-18T03:25:33Z","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":"Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the possible solutions to certain problems of combinatorial optimization, choosing its edges appropriately has been shown to lead to conduciveness properties that provide useful insight into the performance of algorithms to solve those problems. Here we study the conduciveness of CA-rule graphs, that is, graphs whose node set is the set of all CA rules given a cell","authors_text":"Valmir C. Barbosa","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2012-04-27T12:10:27Z","title":"The conduciveness of CA-rule graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6181","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:de8102aec4b075e9cde1444a5ce7997d821a808247c209f943199cc09bf2f9b6","target":"record","created_at":"2026-05-18T03:25:33Z","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":"ac055ae6a5ddba64bcbca44b480a8bd729adb0ef6729ce8e24cdc2fc247ad3f3","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2012-04-27T12:10:27Z","title_canon_sha256":"15e3a36af20fde105163c670a6cd1bc2aeb97f31cf9d5b7e955110f5fc41bd13"},"schema_version":"1.0","source":{"id":"1204.6181","kind":"arxiv","version":1}},"canonical_sha256":"62ce4039171fe6f6de71b75f7eb26dbc191f83977c14da5b2138401620e38cca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62ce4039171fe6f6de71b75f7eb26dbc191f83977c14da5b2138401620e38cca","first_computed_at":"2026-05-18T03:25:33.495994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:33.495994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IJ4e4Gpe/V4YQ+MUudtFI8oyt/6PgnyYeAYZlIFmlZdn5K0JIxWLWje5WcRLpv9OlQtAhgDMCKTotxnuNAfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:33.496767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de8102aec4b075e9cde1444a5ce7997d821a808247c209f943199cc09bf2f9b6","sha256:e099ec26dbe8149bfd7054f202683f63314a137eead2441ca1737410596ee129"],"state_sha256":"5246c4e97d26f3477e8a166f75135451ac351acfc6cc6096e4197e34fc1ea48b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wpPVCDBc3xvB4uH5BRbsh7FPP7qlaywE/inCgx3XcLX0GPPWJOrs91D0c/i5DjKPFTHiYWItE24Cf5lopPiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:23:08.871131Z","bundle_sha256":"5f569c2ae7686fb41c5ba5f4e8cd026e91aece719680f9d034e0750248b8e486"}}