{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2V72ILVXAEWEOBW2O3OBRJEYFJ","short_pith_number":"pith:2V72ILVX","schema_version":"1.0","canonical_sha256":"d57fa42eb7012c4706da76dc18a4982a4822b2b04ec6687e51cc74c25ad3170d","source":{"kind":"arxiv","id":"1711.04242","version":2},"attestation_state":"computed","paper":{"title":"Higher dimensional electrical circuits and the matroid dual of a nonplanar graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hariharan Narayanan, H. Narayanan","submitted_at":"2017-11-12T06:04:49Z","abstract_excerpt":"In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\\mathbb{R} ^3$ rather than graphs. However, we show that, for the skeleton of this complex, involving only triangles and edges, we can build a matroid dual which is a graph. On this graph we build an `ordinary' electrical circuit, solving which we obtain the solution to our original problem. Construction of this graph is through a `sliding' algorithm which simulates sliding on the surfa"},"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":"1711.04242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-12T06:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"98678a070506a70a5e1dcae37111b8d39f1d141ef1be22e399600925f240b367","abstract_canon_sha256":"64b1ca2d318538c960bad344f659ba8867387079ca1abc6bd318501291b73861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:27.519481Z","signature_b64":"DH5IlZTJXdzOXqqb7tXPmGxiIYKL7VOikgd8ds7WWi/+P5BGPVL+d3yL/QKCA9t7nHOuB8UV6TXIKTW8qOU9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d57fa42eb7012c4706da76dc18a4982a4822b2b04ec6687e51cc74c25ad3170d","last_reissued_at":"2026-05-18T00:30:27.518943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:27.518943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher dimensional electrical circuits and the matroid dual of a nonplanar graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hariharan Narayanan, H. Narayanan","submitted_at":"2017-11-12T06:04:49Z","abstract_excerpt":"In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\\mathbb{R} ^3$ rather than graphs. However, we show that, for the skeleton of this complex, involving only triangles and edges, we can build a matroid dual which is a graph. On this graph we build an `ordinary' electrical circuit, solving which we obtain the solution to our original problem. Construction of this graph is through a `sliding' algorithm which simulates sliding on the surfa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04242","kind":"arxiv","version":2},"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":"1711.04242","created_at":"2026-05-18T00:30:27.519012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04242v2","created_at":"2026-05-18T00:30:27.519012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04242","created_at":"2026-05-18T00:30:27.519012+00:00"},{"alias_kind":"pith_short_12","alias_value":"2V72ILVXAEWE","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2V72ILVXAEWEOBW2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2V72ILVX","created_at":"2026-05-18T12:30:55.937587+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/2V72ILVXAEWEOBW2O3OBRJEYFJ","json":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ.json","graph_json":"https://pith.science/api/pith-number/2V72ILVXAEWEOBW2O3OBRJEYFJ/graph.json","events_json":"https://pith.science/api/pith-number/2V72ILVXAEWEOBW2O3OBRJEYFJ/events.json","paper":"https://pith.science/paper/2V72ILVX"},"agent_actions":{"view_html":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ","download_json":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ.json","view_paper":"https://pith.science/paper/2V72ILVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04242&json=true","fetch_graph":"https://pith.science/api/pith-number/2V72ILVXAEWEOBW2O3OBRJEYFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2V72ILVXAEWEOBW2O3OBRJEYFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ/action/storage_attestation","attest_author":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ/action/author_attestation","sign_citation":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ/action/citation_signature","submit_replication":"https://pith.science/pith/2V72ILVXAEWEOBW2O3OBRJEYFJ/action/replication_record"}},"created_at":"2026-05-18T00:30:27.519012+00:00","updated_at":"2026-05-18T00:30:27.519012+00:00"}