{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HGBEE36WFLB5V6QWPWW4EBZANA","short_pith_number":"pith:HGBEE36W","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"},"canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","source":{"kind":"arxiv","id":"1903.10010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10010","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10010v1","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10010","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"HGBEE36WFLB5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGBEE36WFLB5V6QW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGBEE36W","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HGBEE36WFLB5V6QWPWW4EBZANA","target":"record","payload":{"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"},"canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","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"},"source_kind":"arxiv","source_id":"1903.10010","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85G2NY70VHAsEN7dl1mZREkTqiHdM+zDY1lD+FnkGyMTaRpCJ4tjJxUFmvdlQBiiyVbpAIdEH8qH7KIUnZ0oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:35:56.516297Z"},"content_sha256":"ea06988cb595bf3c7ab9e602a415d4f077eac1c3ba56323ef9e113ef34ea27d2","schema_version":"1.0","event_id":"sha256:ea06988cb595bf3c7ab9e602a415d4f077eac1c3ba56323ef9e113ef34ea27d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HGBEE36WFLB5V6QWPWW4EBZANA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjVTp5+IRt0wm3Esxf7DFmh6/W5lSseo4e5ozyu3++XDOfMDpuP3/IoH0C8ege6JnSR+ggEwy6UwJu/bjeg9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:35:56.517027Z"},"content_sha256":"9a3d36f9646eb9eecf1603f210cfcf6c57da94711f2b836f72c7b500794aa861","schema_version":"1.0","event_id":"sha256:9a3d36f9646eb9eecf1603f210cfcf6c57da94711f2b836f72c7b500794aa861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/bundle.json","state_url":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGBEE36WFLB5V6QWPWW4EBZANA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T18:35:56Z","links":{"resolver":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA","bundle":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/bundle.json","state":"https://pith.science/pith/HGBEE36WFLB5V6QWPWW4EBZANA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGBEE36WFLB5V6QWPWW4EBZANA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HGBEE36WFLB5V6QWPWW4EBZANA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c917bd2e01118e7ae849f434aa202f4a6a2fda10c8f7aebca02abb2eb61079c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2019-03-24T16:12:05Z","title_canon_sha256":"0f1c5a3a76c434e6e7fa4a4d90ebdd1e14e3e3ab90c119a539ae298ed5d2a13f"},"schema_version":"1.0","source":{"id":"1903.10010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10010","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10010v1","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10010","created_at":"2026-05-17T23:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"HGBEE36WFLB5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGBEE36WFLB5V6QW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGBEE36W","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:9a3d36f9646eb9eecf1603f210cfcf6c57da94711f2b836f72c7b500794aa861","target":"graph","created_at":"2026-05-17T23:50:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrey Grinblat, Viktor Lopatkin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2019-03-24T16:12:05Z","title":"Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in $\\mathbb{N}[x],$ $\\mathbb{N}[x,y]$)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10010","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ea06988cb595bf3c7ab9e602a415d4f077eac1c3ba56323ef9e113ef34ea27d2","target":"record","created_at":"2026-05-17T23:50:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6c917bd2e01118e7ae849f434aa202f4a6a2fda10c8f7aebca02abb2eb61079c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2019-03-24T16:12:05Z","title_canon_sha256":"0f1c5a3a76c434e6e7fa4a4d90ebdd1e14e3e3ab90c119a539ae298ed5d2a13f"},"schema_version":"1.0","source":{"id":"1903.10010","kind":"arxiv","version":1}},"canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3982426fd62ac3dafa167dadc2072068079f64843c383b29bb81947cd38554f2","first_computed_at":"2026-05-17T23:50:34.799586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:34.799586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiUWOuRUoQkTmm07FLfIEGPjUViBKzLnck5ceO5hGzYnwS+gWPpVPlahgq9Nz19U9WMJ652UrPl1/qwtrFN5CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:34.800252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea06988cb595bf3c7ab9e602a415d4f077eac1c3ba56323ef9e113ef34ea27d2","sha256:9a3d36f9646eb9eecf1603f210cfcf6c57da94711f2b836f72c7b500794aa861"],"state_sha256":"1d3f011c59cb31f5ac89734b42d10015e6b8b3e572fe9bf20d7cc248519c1aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMyEaNXWHT/d9PMTjvyeUEDP4MogEreKp7BU0Rtf3vsxf3QU7+w8o1tYVZgw/QJW5IU2XP/dw95R8R/M+gUFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:35:56.520711Z","bundle_sha256":"152fdbe8edf8e2e21f4da41009547ee6f4449a5b2b99284224e745c0a77d7b8e"}}