{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NV5SSUZ6UR5CPS7FM4U3YFWRP3","short_pith_number":"pith:NV5SSUZ6","schema_version":"1.0","canonical_sha256":"6d7b29533ea47a27cbe56729bc16d17ef1f1f5c4c0b4e8c80feb6cc2a8a16da4","source":{"kind":"arxiv","id":"2004.09284","version":1},"attestation_state":"computed","paper":{"title":"The effective impedances of infinite ladder networks and Dirichlet problem on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Anna Muranova","submitted_at":"2020-04-20T13:38:59Z","abstract_excerpt":"We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related to the classical differential operators on weighted graphs. As an auxiliary result, we solve a discrete boundary value Dirichlet problem on a finite ladder network."},"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":"2004.09284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-20T13:38:59Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"5f918c370d692e04c1212179e8d8637c71e95f03df890d0c63ccbe12c9157bcb","abstract_canon_sha256":"d7d03e3c404f86c9935ae0b19bf3881255dca6a539f02afc689783697c97b7b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:06.966909Z","signature_b64":"n5C/kS1vS/du5EydjzAnqpv4Dfw3MiiYPAjDe8QxD+B7PsKZMmRqiAAKEYyEFFc4+BRk8PQgFEzSdQC1rZmIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7b29533ea47a27cbe56729bc16d17ef1f1f5c4c0b4e8c80feb6cc2a8a16da4","last_reissued_at":"2026-06-19T16:11:06.966489Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:06.966489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The effective impedances of infinite ladder networks and Dirichlet problem on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Anna Muranova","submitted_at":"2020-04-20T13:38:59Z","abstract_excerpt":"We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related to the classical differential operators on weighted graphs. As an auxiliary result, we solve a discrete boundary value Dirichlet problem on a finite ladder network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.09284","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/2004.09284/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":"2004.09284","created_at":"2026-06-19T16:11:06.966543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.09284v1","created_at":"2026-06-19T16:11:06.966543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.09284","created_at":"2026-06-19T16:11:06.966543+00:00"},{"alias_kind":"pith_short_12","alias_value":"NV5SSUZ6UR5C","created_at":"2026-06-19T16:11:06.966543+00:00"},{"alias_kind":"pith_short_16","alias_value":"NV5SSUZ6UR5CPS7F","created_at":"2026-06-19T16:11:06.966543+00:00"},{"alias_kind":"pith_short_8","alias_value":"NV5SSUZ6","created_at":"2026-06-19T16:11:06.966543+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/NV5SSUZ6UR5CPS7FM4U3YFWRP3","json":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3.json","graph_json":"https://pith.science/api/pith-number/NV5SSUZ6UR5CPS7FM4U3YFWRP3/graph.json","events_json":"https://pith.science/api/pith-number/NV5SSUZ6UR5CPS7FM4U3YFWRP3/events.json","paper":"https://pith.science/paper/NV5SSUZ6"},"agent_actions":{"view_html":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3","download_json":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3.json","view_paper":"https://pith.science/paper/NV5SSUZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.09284&json=true","fetch_graph":"https://pith.science/api/pith-number/NV5SSUZ6UR5CPS7FM4U3YFWRP3/graph.json","fetch_events":"https://pith.science/api/pith-number/NV5SSUZ6UR5CPS7FM4U3YFWRP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3/action/storage_attestation","attest_author":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3/action/author_attestation","sign_citation":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3/action/citation_signature","submit_replication":"https://pith.science/pith/NV5SSUZ6UR5CPS7FM4U3YFWRP3/action/replication_record"}},"created_at":"2026-06-19T16:11:06.966543+00:00","updated_at":"2026-06-19T16:11:06.966543+00:00"}