{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TNZB23CQJTEBAWLS5DCTM74PWU","short_pith_number":"pith:TNZB23CQ","schema_version":"1.0","canonical_sha256":"9b721d6c504cc8105972e8c5367f8fb510de7ae08f3007414801a2c4b85ee44d","source":{"kind":"arxiv","id":"2505.10207","version":1},"attestation_state":"computed","paper":{"title":"How to Color Temporal Graphs to Ensure Proper Transitions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Allen Ibiapina, Cl\\'eoph\\'ee Robin, Mika\\\"el Rabie, Minh Hang Nguyen","submitted_at":"2025-05-15T12:03:56Z","abstract_excerpt":"Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must happen all the time or not, and how to go from a coloring in one time to the next one.\n  In this paper, we define a coloring notion for Temporal Graphs where at each step, the coloring must be proper. It uses a notion of compatibility between two consecutive snapshots that implies that the coloring stays proper while the transition happens. Given a graph, 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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.10207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-15T12:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"c5ac561708105144396ecdb8b2606db770f22255a70eaf1bfec63da6e27944ed","abstract_canon_sha256":"db76ae257f0278468a00a60aa84d229004f0948942c6998a75c13b216c5c9ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:35.196653Z","signature_b64":"8BMvAf3hn8EsQUJxV96uhKPR6ujo21cniEiTV7ZQR492yO6ydO7OebyqLbpbhR5+8/PnnEibiP3fXOvbhjavBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b721d6c504cc8105972e8c5367f8fb510de7ae08f3007414801a2c4b85ee44d","last_reissued_at":"2026-07-05T11:03:35.196187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:35.196187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Color Temporal Graphs to Ensure Proper Transitions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Allen Ibiapina, Cl\\'eoph\\'ee Robin, Mika\\\"el Rabie, Minh Hang Nguyen","submitted_at":"2025-05-15T12:03:56Z","abstract_excerpt":"Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must happen all the time or not, and how to go from a coloring in one time to the next one.\n  In this paper, we define a coloring notion for Temporal Graphs where at each step, the coloring must be proper. It uses a notion of compatibility between two consecutive snapshots that implies that the coloring stays proper while the transition happens. Given a graph, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10207","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.10207/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":"2505.10207","created_at":"2026-07-05T11:03:35.196248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10207v1","created_at":"2026-07-05T11:03:35.196248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10207","created_at":"2026-07-05T11:03:35.196248+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNZB23CQJTEB","created_at":"2026-07-05T11:03:35.196248+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNZB23CQJTEBAWLS","created_at":"2026-07-05T11:03:35.196248+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNZB23CQ","created_at":"2026-07-05T11:03:35.196248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.01847","citing_title":"Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU","json":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU.json","graph_json":"https://pith.science/api/pith-number/TNZB23CQJTEBAWLS5DCTM74PWU/graph.json","events_json":"https://pith.science/api/pith-number/TNZB23CQJTEBAWLS5DCTM74PWU/events.json","paper":"https://pith.science/paper/TNZB23CQ"},"agent_actions":{"view_html":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU","download_json":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU.json","view_paper":"https://pith.science/paper/TNZB23CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10207&json=true","fetch_graph":"https://pith.science/api/pith-number/TNZB23CQJTEBAWLS5DCTM74PWU/graph.json","fetch_events":"https://pith.science/api/pith-number/TNZB23CQJTEBAWLS5DCTM74PWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU/action/storage_attestation","attest_author":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU/action/author_attestation","sign_citation":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU/action/citation_signature","submit_replication":"https://pith.science/pith/TNZB23CQJTEBAWLS5DCTM74PWU/action/replication_record"}},"created_at":"2026-07-05T11:03:35.196248+00:00","updated_at":"2026-07-05T11:03:35.196248+00:00"}