{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7PQNDTZIRXMIDO3ASF3IOOSFUL","short_pith_number":"pith:7PQNDTZI","canonical_record":{"source":{"id":"1308.3322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-15T07:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"e90157339caa022ef17925f64498b3fd2dae3e141daa386372ed0fbca9ef4d99","abstract_canon_sha256":"99a7603aef8de3e0db7067833bac76e78a5ff4d435ceae86c66a87a50b4d2ad4"},"schema_version":"1.0"},"canonical_sha256":"fbe0d1cf288dd881bb609176873a45a2e3068f7708528a7b391d576e59e27b70","source":{"kind":"arxiv","id":"1308.3322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3322","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3322v1","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3322","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"7PQNDTZIRXMI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7PQNDTZIRXMIDO3A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7PQNDTZI","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7PQNDTZIRXMIDO3ASF3IOOSFUL","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-15T07:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"e90157339caa022ef17925f64498b3fd2dae3e141daa386372ed0fbca9ef4d99","abstract_canon_sha256":"99a7603aef8de3e0db7067833bac76e78a5ff4d435ceae86c66a87a50b4d2ad4"},"schema_version":"1.0"},"canonical_sha256":"fbe0d1cf288dd881bb609176873a45a2e3068f7708528a7b391d576e59e27b70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.044990Z","signature_b64":"1qZe1Lr+N4Vm65DXmKTivEZVj1BoXh2xH5ApyBZ4dgp/QF5f9tKf7fL4atJKt0qW1nZzek2WYchKVQzzeZCqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe0d1cf288dd881bb609176873a45a2e3068f7708528a7b391d576e59e27b70","last_reissued_at":"2026-05-18T03:15:55.044208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.044208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3322","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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLHZjS8HPrxd0gPNMmIBxm7rlqgc6wYChg7Qhpg4iGmlfMEnu3f49WbZ13XC0lgmqDKGrj4Zt/ZAcw9itA66Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:02:23.687439Z"},"content_sha256":"cf2f2d837168fc7cc53dce761469688e4b2b0d26184512006f8533e4c2df149f","schema_version":"1.0","event_id":"sha256:cf2f2d837168fc7cc53dce761469688e4b2b0d26184512006f8533e4c2df149f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7PQNDTZIRXMIDO3ASF3IOOSFUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some remarks on relations between the $\\mu$-parameters of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"N.N. Davtyan, R.R. Kamalian","submitted_at":"2013-08-15T07:07:50Z","abstract_excerpt":"For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\\varphi:E(G)\\rightarrow \\{1,...,t\\}$ is called a proper edge $t$-coloring of a graph $G$, if adjacent edges are colored differently and each of $t$ colors is used. The least value of $t$ for which there exists a proper edge $t$-coloring of a graph $G$ is denoted by $\\chi'(G)$. For any graph $G$, and for any integer $t$ satisfying the inequality $\\chi'(G)\\leq t\\leq |E(G)|$, we denote by $\\alpha(G,t)$ the set of all proper edge $t$-colorings of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3322","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-18T03:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+ensku3GNmpeWTi33UfDfvlX0jgpyFY+kU55VSIKR+kMXnxoWPmLVcVoCdOrNqyzgRBvk/u5eBMG10d1Yj3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:02:23.688054Z"},"content_sha256":"d822ef223ffdc565a7673562e183b60d374f4dd4a201101d4c917a37fae3cf50","schema_version":"1.0","event_id":"sha256:d822ef223ffdc565a7673562e183b60d374f4dd4a201101d4c917a37fae3cf50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/bundle.json","state_url":"https://pith.science/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/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-05-30T01:02:23Z","links":{"resolver":"https://pith.science/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL","bundle":"https://pith.science/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/bundle.json","state":"https://pith.science/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PQNDTZIRXMIDO3ASF3IOOSFUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7PQNDTZIRXMIDO3ASF3IOOSFUL","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":"99a7603aef8de3e0db7067833bac76e78a5ff4d435ceae86c66a87a50b4d2ad4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-15T07:07:50Z","title_canon_sha256":"e90157339caa022ef17925f64498b3fd2dae3e141daa386372ed0fbca9ef4d99"},"schema_version":"1.0","source":{"id":"1308.3322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3322","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3322v1","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3322","created_at":"2026-05-18T03:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"7PQNDTZIRXMI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7PQNDTZIRXMIDO3A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7PQNDTZI","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:d822ef223ffdc565a7673562e183b60d374f4dd4a201101d4c917a37fae3cf50","target":"graph","created_at":"2026-05-18T03:15:55Z","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":"For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\\varphi:E(G)\\rightarrow \\{1,...,t\\}$ is called a proper edge $t$-coloring of a graph $G$, if adjacent edges are colored differently and each of $t$ colors is used. The least value of $t$ for which there exists a proper edge $t$-coloring of a graph $G$ is denoted by $\\chi'(G)$. For any graph $G$, and for any integer $t$ satisfying the inequality $\\chi'(G)\\leq t\\leq |E(G)|$, we denote by $\\alpha(G,t)$ the set of all proper edge $t$-colorings of $G$.","authors_text":"N.N. Davtyan, R.R. Kamalian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-15T07:07:50Z","title":"Some remarks on relations between the $\\mu$-parameters of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3322","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:cf2f2d837168fc7cc53dce761469688e4b2b0d26184512006f8533e4c2df149f","target":"record","created_at":"2026-05-18T03:15:55Z","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":"99a7603aef8de3e0db7067833bac76e78a5ff4d435ceae86c66a87a50b4d2ad4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-08-15T07:07:50Z","title_canon_sha256":"e90157339caa022ef17925f64498b3fd2dae3e141daa386372ed0fbca9ef4d99"},"schema_version":"1.0","source":{"id":"1308.3322","kind":"arxiv","version":1}},"canonical_sha256":"fbe0d1cf288dd881bb609176873a45a2e3068f7708528a7b391d576e59e27b70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe0d1cf288dd881bb609176873a45a2e3068f7708528a7b391d576e59e27b70","first_computed_at":"2026-05-18T03:15:55.044208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:55.044208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1qZe1Lr+N4Vm65DXmKTivEZVj1BoXh2xH5ApyBZ4dgp/QF5f9tKf7fL4atJKt0qW1nZzek2WYchKVQzzeZCqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:55.044990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf2f2d837168fc7cc53dce761469688e4b2b0d26184512006f8533e4c2df149f","sha256:d822ef223ffdc565a7673562e183b60d374f4dd4a201101d4c917a37fae3cf50"],"state_sha256":"300639f47a2d69500ac0d19450d2ce234bb649b4d595f0c0310e411efd20b66f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqQp/6fG7dn7h3YcyS8EDi55a4mmcO430OABgRCDma7ulRg89SUi6FkFUySbrZWJqc5SEXvwaVCtmCN+BabMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:02:23.691472Z","bundle_sha256":"4fe47abd46e60214d4d9e84a7007b6d08384c30c601f36aa27c84576617d0eed"}}