{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QDX375P4FGJGNGVUE22PWGNICG","short_pith_number":"pith:QDX375P4","schema_version":"1.0","canonical_sha256":"80efbff5fc2992669ab426b4fb19a8118c39d1a126bac68013414ab6d0d73cf6","source":{"kind":"arxiv","id":"1409.0277","version":2},"attestation_state":"computed","paper":{"title":"Regularity of powers of forests and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Huy Tai Ha, Selvi Kara, Tran Nam Trung","submitted_at":"2014-09-01T01:23:01Z","abstract_excerpt":"Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear function reg(I^s) as s > 0, and the initial value of s starting from which reg(I^s) attains its linear form. We also give new bounds on the regularity of I when G contains a Hamiltonian path and when G is a Hamiltonian 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":"1409.0277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2014-09-01T01:23:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b5ab56bdea183147c9a1c39255aadad91697cf8890ff1faa5906db79e1b1bf6","abstract_canon_sha256":"9d644e5b37b6fa22a0b1e056611574d8721afedb47ccbfa64ddcd25786b70db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:58.216510Z","signature_b64":"JlrqGOdCpnV6cnhfXHMAC+FAhppbbvP7LQGtdQrTPPsodOJVAUS99/0FPlkcEkfI2PiRpSL2dLS8oxa2E5k1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80efbff5fc2992669ab426b4fb19a8118c39d1a126bac68013414ab6d0d73cf6","last_reissued_at":"2026-07-05T05:01:58.216096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:58.216096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularity of powers of forests and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Huy Tai Ha, Selvi Kara, Tran Nam Trung","submitted_at":"2014-09-01T01:23:01Z","abstract_excerpt":"Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear function reg(I^s) as s > 0, and the initial value of s starting from which reg(I^s) attains its linear form. We also give new bounds on the regularity of I when G contains a Hamiltonian path and when G is a Hamiltonian graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0277","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/1409.0277/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":"1409.0277","created_at":"2026-07-05T05:01:58.216148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0277v2","created_at":"2026-07-05T05:01:58.216148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0277","created_at":"2026-07-05T05:01:58.216148+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDX375P4FGJG","created_at":"2026-07-05T05:01:58.216148+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDX375P4FGJGNGVU","created_at":"2026-07-05T05:01:58.216148+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDX375P4","created_at":"2026-07-05T05:01:58.216148+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/QDX375P4FGJGNGVUE22PWGNICG","json":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG.json","graph_json":"https://pith.science/api/pith-number/QDX375P4FGJGNGVUE22PWGNICG/graph.json","events_json":"https://pith.science/api/pith-number/QDX375P4FGJGNGVUE22PWGNICG/events.json","paper":"https://pith.science/paper/QDX375P4"},"agent_actions":{"view_html":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG","download_json":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG.json","view_paper":"https://pith.science/paper/QDX375P4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0277&json=true","fetch_graph":"https://pith.science/api/pith-number/QDX375P4FGJGNGVUE22PWGNICG/graph.json","fetch_events":"https://pith.science/api/pith-number/QDX375P4FGJGNGVUE22PWGNICG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG/action/storage_attestation","attest_author":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG/action/author_attestation","sign_citation":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG/action/citation_signature","submit_replication":"https://pith.science/pith/QDX375P4FGJGNGVUE22PWGNICG/action/replication_record"}},"created_at":"2026-07-05T05:01:58.216148+00:00","updated_at":"2026-07-05T05:01:58.216148+00:00"}