{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3FQVBPVQQ6BRWLXPKHTHQQM3GF","short_pith_number":"pith:3FQVBPVQ","schema_version":"1.0","canonical_sha256":"d96150beb087831b2eef51e678419b315afdf7d40bd772b705fcf107bbee4112","source":{"kind":"arxiv","id":"2405.07123","version":1},"attestation_state":"computed","paper":{"title":"CANA v1.0.0 and schematodes: efficient quantification of symmetry in Boolean automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"q-bio.MN","authors_text":"Austin M. Marcus, Herbert Sizek, Jordan Rozum, Luis M. Rocha","submitted_at":"2024-05-12T01:14:00Z","abstract_excerpt":"The biomolecular networks underpinning cell function exhibit canalization, or the buffering of fluctuations required to function in a noisy environment. One understudied putative mechanism for canalization is the functional equivalence of a biomolecular entity's regulators (e.g., among the transcription factors for a gene). In these discrete dynamical systems, activation and inhibition of biomolecular entities (e.g., transcription of genes) are modeled as the activity of coupled 2-state automata, and thus the equivalence of regulators can be studied using the theory of symmetry in discrete fun"},"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":"2405.07123","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2024-05-12T01:14:00Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"e13437e0d52fb5747b222ddb51566046c7fdfddef0037f85dad004825025849e","abstract_canon_sha256":"e5d7e3532a4241b2ad46174af627fa461c3989c3f5db59328595f88564378a33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:16.834909Z","signature_b64":"bM9XIM6KsMjXDSQvR0UqGpfL8l/c57I9B+14gX44ctI1hGR44p6l1UhMH29mDve5N315Qs8UMv/YyzAo6kueBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96150beb087831b2eef51e678419b315afdf7d40bd772b705fcf107bbee4112","last_reissued_at":"2026-07-05T08:18:16.834405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:16.834405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CANA v1.0.0 and schematodes: efficient quantification of symmetry in Boolean automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"q-bio.MN","authors_text":"Austin M. Marcus, Herbert Sizek, Jordan Rozum, Luis M. Rocha","submitted_at":"2024-05-12T01:14:00Z","abstract_excerpt":"The biomolecular networks underpinning cell function exhibit canalization, or the buffering of fluctuations required to function in a noisy environment. One understudied putative mechanism for canalization is the functional equivalence of a biomolecular entity's regulators (e.g., among the transcription factors for a gene). In these discrete dynamical systems, activation and inhibition of biomolecular entities (e.g., transcription of genes) are modeled as the activity of coupled 2-state automata, and thus the equivalence of regulators can be studied using the theory of symmetry in discrete fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07123","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.07123/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.07123","created_at":"2026-07-05T08:18:16.834483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07123v1","created_at":"2026-07-05T08:18:16.834483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07123","created_at":"2026-07-05T08:18:16.834483+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FQVBPVQQ6BR","created_at":"2026-07-05T08:18:16.834483+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FQVBPVQQ6BRWLXP","created_at":"2026-07-05T08:18:16.834483+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FQVBPVQ","created_at":"2026-07-05T08:18:16.834483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.00013","citing_title":"From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF","json":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF.json","graph_json":"https://pith.science/api/pith-number/3FQVBPVQQ6BRWLXPKHTHQQM3GF/graph.json","events_json":"https://pith.science/api/pith-number/3FQVBPVQQ6BRWLXPKHTHQQM3GF/events.json","paper":"https://pith.science/paper/3FQVBPVQ"},"agent_actions":{"view_html":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF","download_json":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF.json","view_paper":"https://pith.science/paper/3FQVBPVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07123&json=true","fetch_graph":"https://pith.science/api/pith-number/3FQVBPVQQ6BRWLXPKHTHQQM3GF/graph.json","fetch_events":"https://pith.science/api/pith-number/3FQVBPVQQ6BRWLXPKHTHQQM3GF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF/action/storage_attestation","attest_author":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF/action/author_attestation","sign_citation":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF/action/citation_signature","submit_replication":"https://pith.science/pith/3FQVBPVQQ6BRWLXPKHTHQQM3GF/action/replication_record"}},"created_at":"2026-07-05T08:18:16.834483+00:00","updated_at":"2026-07-05T08:18:16.834483+00:00"}