{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RITFQ5MRGDZITCQWD2CU456CYE","short_pith_number":"pith:RITFQ5MR","canonical_record":{"source":{"id":"1103.4502","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2011-03-23T12:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"b7ce34e1c2a68cf2c3e2b10d40974ebe955c15d5da490f5a6cb9ef17b9b03599","abstract_canon_sha256":"d2014f42fbac1ef6534ab70572478bd074b8e01a67c1bd5f71f4d662b526c55d"},"schema_version":"1.0"},"canonical_sha256":"8a2658759130f2898a161e854e77c2c1001cabcdc181be817339502736ca9d9e","source":{"kind":"arxiv","id":"1103.4502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4502","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4502v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4502","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"RITFQ5MRGDZI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RITFQ5MRGDZITCQW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RITFQ5MR","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RITFQ5MRGDZITCQWD2CU456CYE","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4502","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2011-03-23T12:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"b7ce34e1c2a68cf2c3e2b10d40974ebe955c15d5da490f5a6cb9ef17b9b03599","abstract_canon_sha256":"d2014f42fbac1ef6534ab70572478bd074b8e01a67c1bd5f71f4d662b526c55d"},"schema_version":"1.0"},"canonical_sha256":"8a2658759130f2898a161e854e77c2c1001cabcdc181be817339502736ca9d9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:01.916237Z","signature_b64":"BxaR83/A5p479xQ8LlfGSIrkwfT3M3qnfY0pZx+H4aEUaPFJj9XgyOjXxN95m1sraQKlLCiERlkaLXwUryofBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2658759130f2898a161e854e77c2c1001cabcdc181be817339502736ca9d9e","last_reissued_at":"2026-05-18T04:26:01.915818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:01.915818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4502","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-18T04:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZA6e5v3Tq1gIC81FfekXXq+STmcVI5MgSRMIMKdWZrHGA9PDCu5twr9+mhw50sPLkdHr+ii1NadGExMf1dwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:43:50.643777Z"},"content_sha256":"48be89c43f9fb18bc7d3b3336947bef7e8670a49145eeb0483e093597fae137c","schema_version":"1.0","event_id":"sha256:48be89c43f9fb18bc7d3b3336947bef7e8670a49145eeb0483e093597fae137c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RITFQ5MRGDZITCQWD2CU456CYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Odd Gracefulness of the Tensor Product of Two Line Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Benha, Egypt), M. Ibrahim Moussa (Benha University","submitted_at":"2011-03-23T12:35:58Z","abstract_excerpt":"An odd graceful labeling of a graph G=(V,E) is a function f:V(G)->[0,1,2,...,2|E(G)|-1} such that |f(u)-f(v)| is odd value less than or equal to 2|E(G)-1| for any u, v in V(G). In spite of the large number of papers published on the subject of graph labeling, there are few algorithms to be used by researchers to gracefully label graphs. This work provides generalized odd graceful solutions to all the vertices and edges for the tensor product of the two paths P_n and P_m denoted P_n^P_m . Firstly, we describe an algorithm to label the vertices and the edges of the vertex set V(P_n^P_m) and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4502","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-18T04:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYSCvCP8FjojccAQIMRTN+m1LQ7/Ubzoz1aSgZpQlEwKrxIn9xgI9wDNhNuC9L0VVXLdTJULyif3a6aw1phKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:43:50.644123Z"},"content_sha256":"7d1fb2bb8b1ed121e5032c349cef3e6fc1e70cc66c6e136c79cc10774bc65a8e","schema_version":"1.0","event_id":"sha256:7d1fb2bb8b1ed121e5032c349cef3e6fc1e70cc66c6e136c79cc10774bc65a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RITFQ5MRGDZITCQWD2CU456CYE/bundle.json","state_url":"https://pith.science/pith/RITFQ5MRGDZITCQWD2CU456CYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RITFQ5MRGDZITCQWD2CU456CYE/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-06-25T05:43:50Z","links":{"resolver":"https://pith.science/pith/RITFQ5MRGDZITCQWD2CU456CYE","bundle":"https://pith.science/pith/RITFQ5MRGDZITCQWD2CU456CYE/bundle.json","state":"https://pith.science/pith/RITFQ5MRGDZITCQWD2CU456CYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RITFQ5MRGDZITCQWD2CU456CYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RITFQ5MRGDZITCQWD2CU456CYE","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":"d2014f42fbac1ef6534ab70572478bd074b8e01a67c1bd5f71f4d662b526c55d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2011-03-23T12:35:58Z","title_canon_sha256":"b7ce34e1c2a68cf2c3e2b10d40974ebe955c15d5da490f5a6cb9ef17b9b03599"},"schema_version":"1.0","source":{"id":"1103.4502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4502","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4502v1","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4502","created_at":"2026-05-18T04:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"RITFQ5MRGDZI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RITFQ5MRGDZITCQW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RITFQ5MR","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:7d1fb2bb8b1ed121e5032c349cef3e6fc1e70cc66c6e136c79cc10774bc65a8e","target":"graph","created_at":"2026-05-18T04:26:01Z","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":"An odd graceful labeling of a graph G=(V,E) is a function f:V(G)->[0,1,2,...,2|E(G)|-1} such that |f(u)-f(v)| is odd value less than or equal to 2|E(G)-1| for any u, v in V(G). In spite of the large number of papers published on the subject of graph labeling, there are few algorithms to be used by researchers to gracefully label graphs. This work provides generalized odd graceful solutions to all the vertices and edges for the tensor product of the two paths P_n and P_m denoted P_n^P_m . Firstly, we describe an algorithm to label the vertices and the edges of the vertex set V(P_n^P_m) and the ","authors_text":"Benha, Egypt), M. Ibrahim Moussa (Benha University","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2011-03-23T12:35:58Z","title":"An Algorithm for Odd Gracefulness of the Tensor Product of Two Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4502","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:48be89c43f9fb18bc7d3b3336947bef7e8670a49145eeb0483e093597fae137c","target":"record","created_at":"2026-05-18T04:26:01Z","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":"d2014f42fbac1ef6534ab70572478bd074b8e01a67c1bd5f71f4d662b526c55d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2011-03-23T12:35:58Z","title_canon_sha256":"b7ce34e1c2a68cf2c3e2b10d40974ebe955c15d5da490f5a6cb9ef17b9b03599"},"schema_version":"1.0","source":{"id":"1103.4502","kind":"arxiv","version":1}},"canonical_sha256":"8a2658759130f2898a161e854e77c2c1001cabcdc181be817339502736ca9d9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a2658759130f2898a161e854e77c2c1001cabcdc181be817339502736ca9d9e","first_computed_at":"2026-05-18T04:26:01.915818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:01.915818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BxaR83/A5p479xQ8LlfGSIrkwfT3M3qnfY0pZx+H4aEUaPFJj9XgyOjXxN95m1sraQKlLCiERlkaLXwUryofBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:01.916237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48be89c43f9fb18bc7d3b3336947bef7e8670a49145eeb0483e093597fae137c","sha256:7d1fb2bb8b1ed121e5032c349cef3e6fc1e70cc66c6e136c79cc10774bc65a8e"],"state_sha256":"8f194df0f2a7a474100e5393d696f1398473a61ac69ecaa5eaca6ff41469370f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOnags/0jzqCJ4K0G+NFKpc6+Ix/Td/e9WfdlIB51Av2hKTkM/CVZK/pUc9ERv3NdqqqPgFShU4CToAHjMaADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:43:50.646112Z","bundle_sha256":"224334b31f00b1e06acc7052e8b61367f3d051b712b398d0ac1c97d4865a4601"}}