{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IE4X4TCQDLUHDJZF74VWESNAW5","short_pith_number":"pith:IE4X4TCQ","schema_version":"1.0","canonical_sha256":"41397e4c501ae871a725ff2b6249a0b77a065087b87f09eb0dc0d8e5cb106969","source":{"kind":"arxiv","id":"2108.03229","version":2},"attestation_state":"computed","paper":{"title":"Internal edge vectors on plabic networks in the disk and a generalization of Talaska formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Petr G. Grinevich, Simonetta Abenda","submitted_at":"2021-08-06T17:59:32Z","abstract_excerpt":"Following [42], positroid cells ${\\mathcal S}_{\\mathcal M}^{\\mbox{TNN}}$ in totally non-negative Grassmannians ${Gr^{\\mbox{TNN}} (k,n)}$ admit parametrizations by positive weights on planar bicolored directed perfect networks in the disk. An explicit formula for elements of matrices representing the points in ${\\mathcal S}_{\\mathcal M}^{\\mbox{TNN}}$ was obtained in [49] in terms of flows on such networks. The formulas from [42,49] are defined on the boundary edge vectors. In this paper we propose an extension of these formulas for vectors on internal edges defined as summations over paths on t"},"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":"2108.03229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-06T17:59:32Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"6f978dba6f2ffef5dbdc92268d63c1d627fadff182d91c2ad0c8fcf8f97d284d","abstract_canon_sha256":"549bf6990abf6dde9975533d2c90ccedf650b9fa12abdb4afc3e8b8340b0f64a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:07.738690Z","signature_b64":"TvHpgnYyv1EAVPe1zBaOSJcsRJgkmWrUJpxXOrq6etr+beIAjAwDnQSBbfqDQuCvRwtfHIiDZmaAyPsxXUnRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41397e4c501ae871a725ff2b6249a0b77a065087b87f09eb0dc0d8e5cb106969","last_reissued_at":"2026-07-05T03:48:07.738208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:07.738208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Internal edge vectors on plabic networks in the disk and a generalization of Talaska formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Petr G. Grinevich, Simonetta Abenda","submitted_at":"2021-08-06T17:59:32Z","abstract_excerpt":"Following [42], positroid cells ${\\mathcal S}_{\\mathcal M}^{\\mbox{TNN}}$ in totally non-negative Grassmannians ${Gr^{\\mbox{TNN}} (k,n)}$ admit parametrizations by positive weights on planar bicolored directed perfect networks in the disk. An explicit formula for elements of matrices representing the points in ${\\mathcal S}_{\\mathcal M}^{\\mbox{TNN}}$ was obtained in [49] in terms of flows on such networks. The formulas from [42,49] are defined on the boundary edge vectors. In this paper we propose an extension of these formulas for vectors on internal edges defined as summations over paths on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.03229/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":"2108.03229","created_at":"2026-07-05T03:48:07.738270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.03229v2","created_at":"2026-07-05T03:48:07.738270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03229","created_at":"2026-07-05T03:48:07.738270+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE4X4TCQDLUH","created_at":"2026-07-05T03:48:07.738270+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE4X4TCQDLUHDJZF","created_at":"2026-07-05T03:48:07.738270+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE4X4TCQ","created_at":"2026-07-05T03:48:07.738270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08645","citing_title":"Learnable Sparsification of Die-to-Die Communication via Spike-Based Encoding","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5","json":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5.json","graph_json":"https://pith.science/api/pith-number/IE4X4TCQDLUHDJZF74VWESNAW5/graph.json","events_json":"https://pith.science/api/pith-number/IE4X4TCQDLUHDJZF74VWESNAW5/events.json","paper":"https://pith.science/paper/IE4X4TCQ"},"agent_actions":{"view_html":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5","download_json":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5.json","view_paper":"https://pith.science/paper/IE4X4TCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.03229&json=true","fetch_graph":"https://pith.science/api/pith-number/IE4X4TCQDLUHDJZF74VWESNAW5/graph.json","fetch_events":"https://pith.science/api/pith-number/IE4X4TCQDLUHDJZF74VWESNAW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5/action/storage_attestation","attest_author":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5/action/author_attestation","sign_citation":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5/action/citation_signature","submit_replication":"https://pith.science/pith/IE4X4TCQDLUHDJZF74VWESNAW5/action/replication_record"}},"created_at":"2026-07-05T03:48:07.738270+00:00","updated_at":"2026-07-05T03:48:07.738270+00:00"}