{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HGBEE36WFLB5V6QWPWW4EBZANA","short_pith_number":"pith:HGBEE36W","schema_version":"1.0","canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","source":{"kind":"arxiv","id":"1903.10010","version":1},"attestation_state":"computed","paper":{"title":"Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in $\\mathbb{N}[x],$ $\\mathbb{N}[x,y]$)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RA","authors_text":"Andrey Grinblat, Viktor Lopatkin","submitted_at":"2019-03-24T16:12:05Z","abstract_excerpt":"The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \\in \\mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\\in\\mathbb{N}[x,y]$, and vise verse. We also show that the multiplication in semirings $\\mathbb{N}[x]$, $\\mathbb{N}[x,y]$ correspondences to a operations of the corresponding graphs which looks like a ``perturbed'' products of graphs. As an application, we give a new point of view to dividing in semirings $\\mathbb{N}[x]$, $\\mathbb{N}[x,y]$. Finally, we endow the set of all bipartite graph"},"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":"1903.10010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2019-03-24T16:12:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f1c5a3a76c434e6e7fa4a4d90ebdd1e14e3e3ab90c119a539ae298ed5d2a13f","abstract_canon_sha256":"6c917bd2e01118e7ae849f434aa202f4a6a2fda10c8f7aebca02abb2eb61079c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:34.800252Z","signature_b64":"JiUWOuRUoQkTmm07FLfIEGPjUViBKzLnck5ceO5hGzYnwS+gWPpVPlahgq9Nz19U9WMJ652UrPl1/qwtrFN5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","last_reissued_at":"2026-05-17T23:50:34.799586Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:34.799586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in $\\mathbb{N}[x],$ $\\mathbb{N}[x,y]$)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RA","authors_text":"Andrey Grinblat, Viktor Lopatkin","submitted_at":"2019-03-24T16:12:05Z","abstract_excerpt":"The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \\in \\mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\\in\\mathbb{N}[x,y]$, and vise verse. We also show that the multiplication in semirings $\\mathbb{N}[x]$, $\\mathbb{N}[x,y]$ correspondences to a operations of the corresponding graphs which looks like a ``perturbed'' products of graphs. As an application, we give a new point of view to dividing in semirings $\\mathbb{N}[x]$, $\\mathbb{N}[x,y]$. Finally, we endow the set of all bipartite graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10010","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":"1903.10010","created_at":"2026-05-17T23:50:34.799689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10010v1","created_at":"2026-05-17T23:50:34.799689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10010","created_at":"2026-05-17T23:50:34.799689+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGBEE36WFLB5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGBEE36WFLB5V6QW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGBEE36W","created_at":"2026-05-18T12:33:18.533446+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/HGBEE36WFLB5V6QWPWW4EBZANA","json":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA.json","graph_json":"https://pith.science/api/pith-number/HGBEE36WFLB5V6QWPWW4EBZANA/graph.json","events_json":"https://pith.science/api/pith-number/HGBEE36WFLB5V6QWPWW4EBZANA/events.json","paper":"https://pith.science/paper/HGBEE36W"},"agent_actions":{"view_html":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA","download_json":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA.json","view_paper":"https://pith.science/paper/HGBEE36W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10010&json=true","fetch_graph":"https://pith.science/api/pith-number/HGBEE36WFLB5V6QWPWW4EBZANA/graph.json","fetch_events":"https://pith.science/api/pith-number/HGBEE36WFLB5V6QWPWW4EBZANA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/action/storage_attestation","attest_author":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/action/author_attestation","sign_citation":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/action/citation_signature","submit_replication":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/action/replication_record"}},"created_at":"2026-05-17T23:50:34.799689+00:00","updated_at":"2026-05-17T23:50:34.799689+00:00"}