{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UCXIEM2LUPYQYNXWTZQGUOCFPR","short_pith_number":"pith:UCXIEM2L","schema_version":"1.0","canonical_sha256":"a0ae82334ba3f10c36f69e606a38457c491f423734c03e4f1b53859418186696","source":{"kind":"arxiv","id":"1302.3064","version":1},"attestation_state":"computed","paper":{"title":"Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AT"],"primary_cat":"math.CO","authors_text":"Turker Biyikoglu, Yusuf Civan","submitted_at":"2013-02-13T12:37:56Z","abstract_excerpt":"We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a graph can be bounded from above by a function of its induced matching number. We also prove that the regularity of a graph is always less than or equal to the sum of its induced matching and decycling numbers."},"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":"1302.3064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-13T12:37:56Z","cross_cats_sorted":["math.AC","math.AT"],"title_canon_sha256":"b7cb73db7d9d00a83dfb09a02a49237b9b44331b7959e4691a2a26470b22010d","abstract_canon_sha256":"7cd14cf59aeb4a9e5f1db12b0b0d6127062d85da265d6db525f8f20ea7f89b1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.859630Z","signature_b64":"yzKesmR1x0Q5Y9+E9TJtWxf8c7qwK3c80jTwJcZolX8/xnrBR+boKMQFgi4RGUCWg7zeX1VFSeV89xjsVdNjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0ae82334ba3f10c36f69e606a38457c491f423734c03e4f1b53859418186696","last_reissued_at":"2026-05-18T03:33:48.858977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.858977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AT"],"primary_cat":"math.CO","authors_text":"Turker Biyikoglu, Yusuf Civan","submitted_at":"2013-02-13T12:37:56Z","abstract_excerpt":"We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a graph can be bounded from above by a function of its induced matching number. We also prove that the regularity of a graph is always less than or equal to the sum of its induced matching and decycling numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3064","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":"1302.3064","created_at":"2026-05-18T03:33:48.859074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3064v1","created_at":"2026-05-18T03:33:48.859074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3064","created_at":"2026-05-18T03:33:48.859074+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCXIEM2LUPYQ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCXIEM2LUPYQYNXW","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCXIEM2L","created_at":"2026-05-18T12:28:02.375192+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/UCXIEM2LUPYQYNXWTZQGUOCFPR","json":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR.json","graph_json":"https://pith.science/api/pith-number/UCXIEM2LUPYQYNXWTZQGUOCFPR/graph.json","events_json":"https://pith.science/api/pith-number/UCXIEM2LUPYQYNXWTZQGUOCFPR/events.json","paper":"https://pith.science/paper/UCXIEM2L"},"agent_actions":{"view_html":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR","download_json":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR.json","view_paper":"https://pith.science/paper/UCXIEM2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3064&json=true","fetch_graph":"https://pith.science/api/pith-number/UCXIEM2LUPYQYNXWTZQGUOCFPR/graph.json","fetch_events":"https://pith.science/api/pith-number/UCXIEM2LUPYQYNXWTZQGUOCFPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR/action/storage_attestation","attest_author":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR/action/author_attestation","sign_citation":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR/action/citation_signature","submit_replication":"https://pith.science/pith/UCXIEM2LUPYQYNXWTZQGUOCFPR/action/replication_record"}},"created_at":"2026-05-18T03:33:48.859074+00:00","updated_at":"2026-05-18T03:33:48.859074+00:00"}