{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6MCLI46FLLLDJ5IQNSP2JL7DHZ","short_pith_number":"pith:6MCLI46F","canonical_record":{"source":{"id":"1206.4393","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T06:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"f252abb38cd7a0b3dfac12168ae339d3b293039e073507a58f239fc8f6a51593","abstract_canon_sha256":"3c8675b49ad522b88fa25eca540a4e75f6eb4a5e838aa531886981e18eb0d0d0"},"schema_version":"1.0"},"canonical_sha256":"f304b473c55ad634f5106c9fa4afe33e4db6642bca5ff3c73ab750c094b8716b","source":{"kind":"arxiv","id":"1206.4393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4393","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4393v1","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4393","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"6MCLI46FLLLD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MCLI46FLLLDJ5IQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MCLI46F","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6MCLI46FLLLDJ5IQNSP2JL7DHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4393","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T06:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"f252abb38cd7a0b3dfac12168ae339d3b293039e073507a58f239fc8f6a51593","abstract_canon_sha256":"3c8675b49ad522b88fa25eca540a4e75f6eb4a5e838aa531886981e18eb0d0d0"},"schema_version":"1.0"},"canonical_sha256":"f304b473c55ad634f5106c9fa4afe33e4db6642bca5ff3c73ab750c094b8716b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:05.966525Z","signature_b64":"AiXi1Hd/4qyhGYT65SVOu8Q+1ODaMk2Y5ZaeJfoMoy7250iNf3M7llQJWKt4v/KQlpHpLQSymJuKCiWlLZo2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f304b473c55ad634f5106c9fa4afe33e4db6642bca5ff3c73ab750c094b8716b","last_reissued_at":"2026-05-18T03:53:05.965946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:05.965946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4393","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:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDPLWjF/WblclnIMH6myEn+Pl+3jp4Ycsgp+eGnxGLYSGxIFIjOxRnm6irP+T+9AAY/Gg8fE0UpHhuVy1DN8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:39.951262Z"},"content_sha256":"c0777602fbf191f8bb63f7f1532ccbadc72602a0127386349c901bfe7bc65b04","schema_version":"1.0","event_id":"sha256:c0777602fbf191f8bb63f7f1532ccbadc72602a0127386349c901bfe7bc65b04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6MCLI46FLLLDJ5IQNSP2JL7DHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Yan Li","submitted_at":"2012-06-20T06:45:03Z","abstract_excerpt":"The trees, respectively unicyclic graphs, on $n$ vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the $n$-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the $n$-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian permanent are characterized. Consequently, the $n$-vertex bipartite unicyclic graphs with the first, second and third smallest Laplacian permanent are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4393","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:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPeMu80c4E8f9E323mlMtbEjw4OD7skpySOuOXA1H+sMhmjwoJjJw1/rBBdbEaOcSotm1jgiHGcSWtOOKtI1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:39.952010Z"},"content_sha256":"49ad3e654bcda2366baf99e7a6263f282c7d24adc2c054b60a5095d9fc7aa942","schema_version":"1.0","event_id":"sha256:49ad3e654bcda2366baf99e7a6263f282c7d24adc2c054b60a5095d9fc7aa942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/bundle.json","state_url":"https://pith.science/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/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-08T17:57:39Z","links":{"resolver":"https://pith.science/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ","bundle":"https://pith.science/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/bundle.json","state":"https://pith.science/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MCLI46FLLLDJ5IQNSP2JL7DHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6MCLI46FLLLDJ5IQNSP2JL7DHZ","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":"3c8675b49ad522b88fa25eca540a4e75f6eb4a5e838aa531886981e18eb0d0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T06:45:03Z","title_canon_sha256":"f252abb38cd7a0b3dfac12168ae339d3b293039e073507a58f239fc8f6a51593"},"schema_version":"1.0","source":{"id":"1206.4393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4393","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4393v1","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4393","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"6MCLI46FLLLD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MCLI46FLLLDJ5IQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MCLI46F","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:49ad3e654bcda2366baf99e7a6263f282c7d24adc2c054b60a5095d9fc7aa942","target":"graph","created_at":"2026-05-18T03:53:05Z","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":"The trees, respectively unicyclic graphs, on $n$ vertices with the smallest Laplacian permanent are studied. In this paper, by edge-grafting transformations, the $n$-vertex trees of given bipartition having the second and third smallest Laplacian permanent are identified. Similarly, the $n$-vertex bipartite unicyclic graphs of given bipartition having the first, second and third smallest Laplacian permanent are characterized. Consequently, the $n$-vertex bipartite unicyclic graphs with the first, second and third smallest Laplacian permanent are determined.","authors_text":"Shuchao Li, Yan Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T06:45:03Z","title":"Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4393","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:c0777602fbf191f8bb63f7f1532ccbadc72602a0127386349c901bfe7bc65b04","target":"record","created_at":"2026-05-18T03:53:05Z","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":"3c8675b49ad522b88fa25eca540a4e75f6eb4a5e838aa531886981e18eb0d0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T06:45:03Z","title_canon_sha256":"f252abb38cd7a0b3dfac12168ae339d3b293039e073507a58f239fc8f6a51593"},"schema_version":"1.0","source":{"id":"1206.4393","kind":"arxiv","version":1}},"canonical_sha256":"f304b473c55ad634f5106c9fa4afe33e4db6642bca5ff3c73ab750c094b8716b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f304b473c55ad634f5106c9fa4afe33e4db6642bca5ff3c73ab750c094b8716b","first_computed_at":"2026-05-18T03:53:05.965946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:05.965946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AiXi1Hd/4qyhGYT65SVOu8Q+1ODaMk2Y5ZaeJfoMoy7250iNf3M7llQJWKt4v/KQlpHpLQSymJuKCiWlLZo2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:05.966525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0777602fbf191f8bb63f7f1532ccbadc72602a0127386349c901bfe7bc65b04","sha256:49ad3e654bcda2366baf99e7a6263f282c7d24adc2c054b60a5095d9fc7aa942"],"state_sha256":"56d705e33577f79d771e19c971f4b7619b8d61a9be48b7725d64b5eecbf09b6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoigVu2g5HPNY4Kf7Td3xF//WYJi9vf1NE8Jai0sZEvA5R91n19hB+ZrIxAKYhFX3oYl1jnY9kNcH4Od60tHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:57:39.956368Z","bundle_sha256":"b23f44f528db49b014a6e9b8ebcc4fff627032186450b4d1cd67c09d887803fe"}}