{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KGJN7DKM464XEDK6JKXSJPSQQ5","short_pith_number":"pith:KGJN7DKM","canonical_record":{"source":{"id":"1210.6161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T08:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"13c5f5ee62342b76bc67bf05964a92435852689f774e23b4f6a6789b660a3616","abstract_canon_sha256":"2f7b6b5f7bab0fd5b5f1b6aa6d453aaf1c890bb235fdb33f775cc614e10ccfc2"},"schema_version":"1.0"},"canonical_sha256":"5192df8d4ce7b9720d5e4aaf24be508763452af287a99a477421f36f82642321","source":{"kind":"arxiv","id":"1210.6161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6161","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6161v1","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6161","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"KGJN7DKM464X","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KGJN7DKM464XEDK6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KGJN7DKM","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KGJN7DKM464XEDK6JKXSJPSQQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T08:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"13c5f5ee62342b76bc67bf05964a92435852689f774e23b4f6a6789b660a3616","abstract_canon_sha256":"2f7b6b5f7bab0fd5b5f1b6aa6d453aaf1c890bb235fdb33f775cc614e10ccfc2"},"schema_version":"1.0"},"canonical_sha256":"5192df8d4ce7b9720d5e4aaf24be508763452af287a99a477421f36f82642321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:33.030879Z","signature_b64":"+dWA0QPKOX84CV/PWD8MxtaZxyhdZRm1anwm1/W3eu6ltz+lu2U0SJbF238vCu35L7Ci2sAPcvJ/eeuFa//vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5192df8d4ce7b9720d5e4aaf24be508763452af287a99a477421f36f82642321","last_reissued_at":"2026-05-18T03:42:33.030424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:33.030424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6161","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:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tpeyex8UEJyPSTJxHn8E2H0EfZ7YUCLThtAten3RlmTW64CubVSQZ4E1UrgHlBFIKFpR6k6gSJl+D8cHh//JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:09:03.441798Z"},"content_sha256":"4a871ab1940b4ad83fe2f5192441b475b78c9a44acba4032b41790cd580e4ba3","schema_version":"1.0","event_id":"sha256:4a871ab1940b4ad83fe2f5192441b475b78c9a44acba4032b41790cd580e4ba3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KGJN7DKM464XEDK6JKXSJPSQQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound for the crossing number of augmented cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Wenping Zheng, Xuezhi Yang, Yuansheng Yang","submitted_at":"2012-10-23T08:16:11Z","abstract_excerpt":"A {\\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex or a crossing. The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a good drawing of $G$ in the plane. The {\\it $n$-dimensional augmented cube} $AQ_n$, proposed by S.A. Choudum and V. Sunitha, is an important interconnection network with good topological properties and applications. In this paper, we obtain an upper bound on the crossing number of $AQ_n$ less than $26/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6161","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:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FHT9wwsEK/jiK3H0c4Ef77EXIdl+thHsAjEe8OXcgc7p2I2VcevGLYsR300Jm6u6mcVC0x48lY0l0IxL0wiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:09:03.442147Z"},"content_sha256":"c0ec8da8942f51b1515f1529c1ac8eed9b0cc082e7b0d172072eefd9318c2088","schema_version":"1.0","event_id":"sha256:c0ec8da8942f51b1515f1529c1ac8eed9b0cc082e7b0d172072eefd9318c2088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/bundle.json","state_url":"https://pith.science/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/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-30T16:09:03Z","links":{"resolver":"https://pith.science/pith/KGJN7DKM464XEDK6JKXSJPSQQ5","bundle":"https://pith.science/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/bundle.json","state":"https://pith.science/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGJN7DKM464XEDK6JKXSJPSQQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KGJN7DKM464XEDK6JKXSJPSQQ5","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":"2f7b6b5f7bab0fd5b5f1b6aa6d453aaf1c890bb235fdb33f775cc614e10ccfc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T08:16:11Z","title_canon_sha256":"13c5f5ee62342b76bc67bf05964a92435852689f774e23b4f6a6789b660a3616"},"schema_version":"1.0","source":{"id":"1210.6161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6161","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6161v1","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6161","created_at":"2026-05-18T03:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"KGJN7DKM464X","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KGJN7DKM464XEDK6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KGJN7DKM","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:c0ec8da8942f51b1515f1529c1ac8eed9b0cc082e7b0d172072eefd9318c2088","target":"graph","created_at":"2026-05-18T03:42:33Z","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":"A {\\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex or a crossing. The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a good drawing of $G$ in the plane. The {\\it $n$-dimensional augmented cube} $AQ_n$, proposed by S.A. Choudum and V. Sunitha, is an important interconnection network with good topological properties and applications. In this paper, we obtain an upper bound on the crossing number of $AQ_n$ less than $26/","authors_text":"Guoqing Wang, Haoli Wang, Wenping Zheng, Xuezhi Yang, Yuansheng Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T08:16:11Z","title":"An upper bound for the crossing number of augmented cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6161","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:4a871ab1940b4ad83fe2f5192441b475b78c9a44acba4032b41790cd580e4ba3","target":"record","created_at":"2026-05-18T03:42:33Z","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":"2f7b6b5f7bab0fd5b5f1b6aa6d453aaf1c890bb235fdb33f775cc614e10ccfc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T08:16:11Z","title_canon_sha256":"13c5f5ee62342b76bc67bf05964a92435852689f774e23b4f6a6789b660a3616"},"schema_version":"1.0","source":{"id":"1210.6161","kind":"arxiv","version":1}},"canonical_sha256":"5192df8d4ce7b9720d5e4aaf24be508763452af287a99a477421f36f82642321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5192df8d4ce7b9720d5e4aaf24be508763452af287a99a477421f36f82642321","first_computed_at":"2026-05-18T03:42:33.030424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:33.030424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dWA0QPKOX84CV/PWD8MxtaZxyhdZRm1anwm1/W3eu6ltz+lu2U0SJbF238vCu35L7Ci2sAPcvJ/eeuFa//vDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:33.030879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a871ab1940b4ad83fe2f5192441b475b78c9a44acba4032b41790cd580e4ba3","sha256:c0ec8da8942f51b1515f1529c1ac8eed9b0cc082e7b0d172072eefd9318c2088"],"state_sha256":"6646eda5f380bbff429d6f99df49d0a3a4f40d5ee8eb0d80aa63f0a9c47c2f99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7s3Y1cg1mMixW48+0QxONxWyTVFXNdx9x+HT9saFUXBJP92EuVRmwONlXsAl9EGxitQprxclhhJTrQAdMu5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:09:03.444234Z","bundle_sha256":"38857dd3ed49d362374e6ee5dc9e54519dc158f4280462f8a214ce3aa7039869"}}