{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEC3DKU22S4YAH7IBBNNTPOGNV","short_pith_number":"pith:NEC3DKU2","schema_version":"1.0","canonical_sha256":"6905b1aa9ad4b9801fe8085ad9bdc66d43fc9e0942694f6f35cc4f601bdc56a2","source":{"kind":"arxiv","id":"1504.01277","version":1},"attestation_state":"computed","paper":{"title":"Inferring transition rates on networks with incomplete knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"q-bio.MN","authors_text":"Abhinav Jain, Gerhard Stock, Ken. A. Dill, Purushottam D. Dixit","submitted_at":"2015-04-06T13:05:53Z","abstract_excerpt":"Across many fields, a problem of interest is to predict the transition rates between nodes of a network, given limited stationary state and dynamical information. We give a solution using the principle of Maximum Caliber. We find the transition rate matrix by maximizing the path entropy of a random walker on the network constrained to reproducing a stationary distribution and a few dynamical averages. A main finding here is that when constrained only by the mean jump rate, the rate matrix is given by a square-root dependence of the rate, $\\omega_{ab} \\propto \\sqrt{p_b/p_a}$, on $p_a$ and $p_b$"},"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":"1504.01277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2015-04-06T13:05:53Z","cross_cats_sorted":["q-bio.BM"],"title_canon_sha256":"7144ed1bfb4822a75b3cd6b8a7df6da0e065375d827d7546ecb6386d972ee7de","abstract_canon_sha256":"e83e7da0722b020e5d762bf5e18a7366c0afa1f725735b7e076bded70fdf6f3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:34.747427Z","signature_b64":"k2HSen8zh9oTz1AEJ3qWnMP/tySHz9JdYHiZmjZ3PZFlj+KSbgbiQ8L5BlQerHp5i7LD9gOyHGnl/O9es6DhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6905b1aa9ad4b9801fe8085ad9bdc66d43fc9e0942694f6f35cc4f601bdc56a2","last_reissued_at":"2026-05-18T02:19:34.747013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:34.747013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inferring transition rates on networks with incomplete knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"q-bio.MN","authors_text":"Abhinav Jain, Gerhard Stock, Ken. A. Dill, Purushottam D. Dixit","submitted_at":"2015-04-06T13:05:53Z","abstract_excerpt":"Across many fields, a problem of interest is to predict the transition rates between nodes of a network, given limited stationary state and dynamical information. We give a solution using the principle of Maximum Caliber. We find the transition rate matrix by maximizing the path entropy of a random walker on the network constrained to reproducing a stationary distribution and a few dynamical averages. A main finding here is that when constrained only by the mean jump rate, the rate matrix is given by a square-root dependence of the rate, $\\omega_{ab} \\propto \\sqrt{p_b/p_a}$, on $p_a$ and $p_b$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01277","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01277","created_at":"2026-05-18T02:19:34.747071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01277v1","created_at":"2026-05-18T02:19:34.747071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01277","created_at":"2026-05-18T02:19:34.747071+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEC3DKU22S4Y","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEC3DKU22S4YAH7I","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEC3DKU2","created_at":"2026-05-18T12:29:32.376354+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/NEC3DKU22S4YAH7IBBNNTPOGNV","json":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV.json","graph_json":"https://pith.science/api/pith-number/NEC3DKU22S4YAH7IBBNNTPOGNV/graph.json","events_json":"https://pith.science/api/pith-number/NEC3DKU22S4YAH7IBBNNTPOGNV/events.json","paper":"https://pith.science/paper/NEC3DKU2"},"agent_actions":{"view_html":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV","download_json":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV.json","view_paper":"https://pith.science/paper/NEC3DKU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01277&json=true","fetch_graph":"https://pith.science/api/pith-number/NEC3DKU22S4YAH7IBBNNTPOGNV/graph.json","fetch_events":"https://pith.science/api/pith-number/NEC3DKU22S4YAH7IBBNNTPOGNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV/action/storage_attestation","attest_author":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV/action/author_attestation","sign_citation":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV/action/citation_signature","submit_replication":"https://pith.science/pith/NEC3DKU22S4YAH7IBBNNTPOGNV/action/replication_record"}},"created_at":"2026-05-18T02:19:34.747071+00:00","updated_at":"2026-05-18T02:19:34.747071+00:00"}