{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3RIWKT7FLPR7A6Z3EXWT2YXBRV","short_pith_number":"pith:3RIWKT7F","canonical_record":{"source":{"id":"1312.7506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T06:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"e51f2c24eb728c170f53d417b5059ffdec707245257af41bed2ab8f3bbaa4d95","abstract_canon_sha256":"9c8a1e0046989309d35036a6dee6e71c86222fc7a3367f1cf44abcbbe85e7e26"},"schema_version":"1.0"},"canonical_sha256":"dc51654fe55be3f07b3b25ed3d62e18d4b41436d3ea3a0d39bb9c616db13fab5","source":{"kind":"arxiv","id":"1312.7506","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7506","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7506v2","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7506","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"3RIWKT7FLPR7","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3RIWKT7FLPR7A6Z3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3RIWKT7F","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3RIWKT7FLPR7A6Z3EXWT2YXBRV","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T06:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"e51f2c24eb728c170f53d417b5059ffdec707245257af41bed2ab8f3bbaa4d95","abstract_canon_sha256":"9c8a1e0046989309d35036a6dee6e71c86222fc7a3367f1cf44abcbbe85e7e26"},"schema_version":"1.0"},"canonical_sha256":"dc51654fe55be3f07b3b25ed3d62e18d4b41436d3ea3a0d39bb9c616db13fab5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:15.740855Z","signature_b64":"SKKCShlUO5nApDAHM9EEp0jxlYkoHC7s6CRrOrauWudBP2R3QYKBlQi4/zr7N922YdyteFjavmx7RcVPfO+xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc51654fe55be3f07b3b25ed3d62e18d4b41436d3ea3a0d39bb9c616db13fab5","last_reissued_at":"2026-05-18T02:47:15.740233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:15.740233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7506","source_version":2,"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-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J6UqenAqE2pnNJQFATDD+bTCnGUZxiTL55i2JpYfbK/2aU6FGgNLysBbzrj0cbLIp+8Wv/gcZZy8O2PiIqyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:09:00.425304Z"},"content_sha256":"1662e2c1b8d552e7326d0bd4b2e08ba387b1ff63993100fb23f4a83c35782a4e","schema_version":"1.0","event_id":"sha256:1662e2c1b8d552e7326d0bd4b2e08ba387b1ff63993100fb23f4a83c35782a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3RIWKT7FLPR7A6Z3EXWT2YXBRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The edge cover polynomials of cubic graphs of order 10","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Saeid Alikhani, Somayeh Jahari","submitted_at":"2013-12-29T06:58:20Z","abstract_excerpt":"Let $G$ be a simple graph of order $n$ and size $m$. The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.\n  The edge cover polynomial of $G$ is the polynomial $E(G,x)=\\sum_{i=\\rho(G)}^{m} e(G,i) x^{i}$, where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and $\\rho(G)$ is the edge covering number of $G$. In this paper we study the edge cover polynomials of cubic graphs of order $10$. We show that all cubic graphs of order $10$ (especially the Petersen graph) are determined uniquely by their edge cover polynomials. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7506","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":""},"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-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGmHmwCBOz22+hDgvsnF1aIgoWr9gmYdey77Toj0sN32k3VzTcU2pZNZVmev4CCDbyJGwGEIQBrXRpuz4+KmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:09:00.425806Z"},"content_sha256":"8dec67c13e97863c1c74d6bee2d267a72f2957c6d1173f62988003d3e2644817","schema_version":"1.0","event_id":"sha256:8dec67c13e97863c1c74d6bee2d267a72f2957c6d1173f62988003d3e2644817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/bundle.json","state_url":"https://pith.science/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/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-24T08:09:00Z","links":{"resolver":"https://pith.science/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV","bundle":"https://pith.science/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/bundle.json","state":"https://pith.science/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RIWKT7FLPR7A6Z3EXWT2YXBRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3RIWKT7FLPR7A6Z3EXWT2YXBRV","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":"9c8a1e0046989309d35036a6dee6e71c86222fc7a3367f1cf44abcbbe85e7e26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T06:58:20Z","title_canon_sha256":"e51f2c24eb728c170f53d417b5059ffdec707245257af41bed2ab8f3bbaa4d95"},"schema_version":"1.0","source":{"id":"1312.7506","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7506","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7506v2","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7506","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"3RIWKT7FLPR7","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3RIWKT7FLPR7A6Z3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3RIWKT7F","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:8dec67c13e97863c1c74d6bee2d267a72f2957c6d1173f62988003d3e2644817","target":"graph","created_at":"2026-05-18T02:47:15Z","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 graph of order $n$ and size $m$. The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.\n  The edge cover polynomial of $G$ is the polynomial $E(G,x)=\\sum_{i=\\rho(G)}^{m} e(G,i) x^{i}$, where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and $\\rho(G)$ is the edge covering number of $G$. In this paper we study the edge cover polynomials of cubic graphs of order $10$. We show that all cubic graphs of order $10$ (especially the Petersen graph) are determined uniquely by their edge cover polynomials. A","authors_text":"Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T06:58:20Z","title":"The edge cover polynomials of cubic graphs of order 10"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7506","kind":"arxiv","version":2},"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:1662e2c1b8d552e7326d0bd4b2e08ba387b1ff63993100fb23f4a83c35782a4e","target":"record","created_at":"2026-05-18T02:47:15Z","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":"9c8a1e0046989309d35036a6dee6e71c86222fc7a3367f1cf44abcbbe85e7e26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T06:58:20Z","title_canon_sha256":"e51f2c24eb728c170f53d417b5059ffdec707245257af41bed2ab8f3bbaa4d95"},"schema_version":"1.0","source":{"id":"1312.7506","kind":"arxiv","version":2}},"canonical_sha256":"dc51654fe55be3f07b3b25ed3d62e18d4b41436d3ea3a0d39bb9c616db13fab5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc51654fe55be3f07b3b25ed3d62e18d4b41436d3ea3a0d39bb9c616db13fab5","first_computed_at":"2026-05-18T02:47:15.740233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:15.740233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKKCShlUO5nApDAHM9EEp0jxlYkoHC7s6CRrOrauWudBP2R3QYKBlQi4/zr7N922YdyteFjavmx7RcVPfO+xBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:15.740855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7506","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1662e2c1b8d552e7326d0bd4b2e08ba387b1ff63993100fb23f4a83c35782a4e","sha256:8dec67c13e97863c1c74d6bee2d267a72f2957c6d1173f62988003d3e2644817"],"state_sha256":"6aceb7a8726e32c41407aef5cca6322293c7ed8d8fecf48b6a30f8e9144d753b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"559faKh34eYvGt2fVPMHT11G0tinS/Hz/xv4pGk137ORQ5gvnvDw4EATAt2dPv3lqDsq68fNIpNKiZGR8RhaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:09:00.428243Z","bundle_sha256":"9d5c6db7ccb4e8bcca1264f2fc27eb46ab10a85243deee343f05b7d2d051d26c"}}