{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OVY6D66BV7RPUHVN4RUPJRFHC7","short_pith_number":"pith:OVY6D66B","schema_version":"1.0","canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","source":{"kind":"arxiv","id":"2605.13610","version":1},"attestation_state":"computed","paper":{"title":"A merging procedure for labelings of bipartite graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucia Marino, Paola Bonacini","submitted_at":"2026-05-13T14:43:31Z","abstract_excerpt":"Let $G$ a bipartite graph with vertex bipartition $\\{A,B\\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\\colon V\\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\\lambda\\in \\mathbb N$ such that $f(a)\\le \\lambda$ and $f(b)>\\lambda$ for all $a\\in A$ and $b\\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case th"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"c37ac3247b6ba830812a16058fa813dd0e67fc1e62e9cb5f293031f6cba2c188","abstract_canon_sha256":"dd9f425bb3798195939070dfde85670092edb7f3728b54a1797586cf2411d1b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:18.069610Z","signature_b64":"wRek/TXWWGmLzbL5ZWUO0tVMGSUw0kU7ROZcMX4zIa889QlYRZkL0qTh5XBNcXG+kF9qPGSwqG4ccrkR0lbWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","last_reissued_at":"2026-05-18T02:44:18.069176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:18.069176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A merging procedure for labelings of bipartite graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucia Marino, Paola Bonacini","submitted_at":"2026-05-13T14:43:31Z","abstract_excerpt":"Let $G$ a bipartite graph with vertex bipartition $\\{A,B\\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\\colon V\\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\\lambda\\in \\mathbb N$ such that $f(a)\\le \\lambda$ and $f(b)>\\lambda$ for all $a\\in A$ and $b\\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5c0cc598618cbf7f8e65720682a772a241d989abbc81f9e9c71d084056ff4cd9"},"source":{"id":"2605.13610","kind":"arxiv","version":1},"verdict":{"id":"c4438964-d3d2-4990-95ce-00a0765e9720","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:05:54.024545Z","strongest_claim":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path.","one_line_summary":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements.","pith_extraction_headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths."},"references":{"count":5,"sample":[{"doi":"","year":2012,"title":"K. Brewington, R. C. Bunge, L. J. Cross, S. I. El-Zanati, C. K. Pawlak, J. L. Smith, S. M. Zeppetello,On cyclicG-designs whereGis the one-point union of two cycles, J. Combin. Math. Combin. Comput. 83","work_id":"e4da1c90-0691-475c-a388-57a7922d0609","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"R. C. Bunge, S. I. El-Zanati, W. O’Hanlon, C. Vanden Eynden,Onγlabeling the almost bipartite graphP m +e, Ars Combin. 107 (2012), 65–80","work_id":"ef982eba-9f08-4cee-a7ef-9729ca4e4d37","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"S. I. El-Zanati, C. Vanden Eynden, N. Punnim,On the cyclic decomposition of com- plete graphs into bipartite graphs, Australas. J. Combin.24(2001), 209–219","work_id":"a1336c97-6bb1-438a-9c2e-886de94f2d1f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"J. A. Gallian,A Dynamic Survey of Graph Labeling, Dynamic Survey 6, Electron. J. Combin., (2025), 805 pp","work_id":"2853229b-ee2e-42a7-9acf-8964c48a5cae","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1966,"title":"Rosa,On certain valuations of the vertices of a graph, in:Th´ eorie des graphes, journ´ ees internationales d’´ etudes, Rome 1966 (Dunod, Paris, 1967), 349–355","work_id":"6dc8502b-246e-4598-aed8-7e51a280ec7b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":5,"snapshot_sha256":"e0436930fa8613090f1c172ed9e0c8feba0da43cc1a648606beedec72f172cf8","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":"2605.13610","created_at":"2026-05-18T02:44:18.069241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13610v1","created_at":"2026-05-18T02:44:18.069241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13610","created_at":"2026-05-18T02:44:18.069241+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVY6D66BV7RP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVY6D66BV7RPUHVN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVY6D66B","created_at":"2026-05-18T12:33:37.589309+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/OVY6D66BV7RPUHVN4RUPJRFHC7","json":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7.json","graph_json":"https://pith.science/api/pith-number/OVY6D66BV7RPUHVN4RUPJRFHC7/graph.json","events_json":"https://pith.science/api/pith-number/OVY6D66BV7RPUHVN4RUPJRFHC7/events.json","paper":"https://pith.science/paper/OVY6D66B"},"agent_actions":{"view_html":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7","download_json":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7.json","view_paper":"https://pith.science/paper/OVY6D66B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13610&json=true","fetch_graph":"https://pith.science/api/pith-number/OVY6D66BV7RPUHVN4RUPJRFHC7/graph.json","fetch_events":"https://pith.science/api/pith-number/OVY6D66BV7RPUHVN4RUPJRFHC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/action/storage_attestation","attest_author":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/action/author_attestation","sign_citation":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/action/citation_signature","submit_replication":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/action/replication_record"}},"created_at":"2026-05-18T02:44:18.069241+00:00","updated_at":"2026-05-18T02:44:18.069241+00:00"}