{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZXBRVAUJPS2DBM25NW762PX4DB","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":"38e33a2382c882c63d812d6244e75378c5f70d8c08d20da0f4149d7d48faac7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T19:26:01Z","title_canon_sha256":"6e99880ce0d520df942ce48e02faf21f9f7837d23a83ddb66f47693255766417"},"schema_version":"1.0","source":{"id":"1408.5873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5873","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5873v1","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5873","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZXBRVAUJPS2D","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXBRVAUJPS2DBM25","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXBRVAUJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:358f8a74e8f6c7e233cf0b4298b2fa52f02aa6a2440fa7117978356f17afcfea","target":"graph","created_at":"2026-05-18T02:44:23Z","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":"Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only their values differ by a number which is composed of primes from S. We prove e.g. that for every G there exist infinitely many finite sets S such that G is an S-graph. We deal with cycles and complete bipartite graphs G. We consider the triangles in G for a deeper analysis. Finally we prove that G is an S-graph for all S if and only if G is cubical. Besides","authors_text":"K. Gy\\H{o}ry, L. Hajdu, R. Tijdeman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T19:26:01Z","title":"Representation of finite graphs as difference graphs of S-units, I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5873","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:cda0f980d72241b30d995708dcd9ff35ec8ffef1902b257bfe999adba0078edb","target":"record","created_at":"2026-05-18T02:44:23Z","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":"38e33a2382c882c63d812d6244e75378c5f70d8c08d20da0f4149d7d48faac7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T19:26:01Z","title_canon_sha256":"6e99880ce0d520df942ce48e02faf21f9f7837d23a83ddb66f47693255766417"},"schema_version":"1.0","source":{"id":"1408.5873","kind":"arxiv","version":1}},"canonical_sha256":"cdc31a82897cb430b35d6dbfed3efc187b7c9912faed970ded0eb97b79816ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdc31a82897cb430b35d6dbfed3efc187b7c9912faed970ded0eb97b79816ad2","first_computed_at":"2026-05-18T02:44:23.923577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:23.923577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5SScASHhwk9f5S/KI18iGZr2M4NWJ4ML3U5TNHU2efXel8R0MXRxFSGl5UyR+4JAc1yJujRo8lQzvRSGRtYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:23.924046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda0f980d72241b30d995708dcd9ff35ec8ffef1902b257bfe999adba0078edb","sha256:358f8a74e8f6c7e233cf0b4298b2fa52f02aa6a2440fa7117978356f17afcfea"],"state_sha256":"3ec1ce08e886bde93deb2c0c40235190ca7c1da4fbf659376c5737f14bff7a47"}