{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PW7OBP7SNH6VVZUGU7K7HGVR5U","short_pith_number":"pith:PW7OBP7S","canonical_record":{"source":{"id":"1711.06906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-18T18:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"5ca7c678f2b1c4d6586b6c5780c58a60a7cb9962f4c6f068167b628ed76bf870","abstract_canon_sha256":"55b79a713f1b52737b0af153211a6603c26907c9f0ecdb5fbf8a2b2ab27b81a8"},"schema_version":"1.0"},"canonical_sha256":"7dbee0bff269fd5ae686a7d5f39ab1ed2d74c0365d63e9f350061d959206369a","source":{"kind":"arxiv","id":"1711.06906","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06906","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06906v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06906","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"PW7OBP7SNH6V","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PW7OBP7SNH6VVZUG","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PW7OBP7S","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PW7OBP7SNH6VVZUGU7K7HGVR5U","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-18T18:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"5ca7c678f2b1c4d6586b6c5780c58a60a7cb9962f4c6f068167b628ed76bf870","abstract_canon_sha256":"55b79a713f1b52737b0af153211a6603c26907c9f0ecdb5fbf8a2b2ab27b81a8"},"schema_version":"1.0"},"canonical_sha256":"7dbee0bff269fd5ae686a7d5f39ab1ed2d74c0365d63e9f350061d959206369a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.746286Z","signature_b64":"umGPu9ClwY/o5buNwJfUYR1LD7qQQRoB1q5gN5tCnaurU1VgvrysQhzi9NDiO9YkpJSUS+EGvU/T7yzfDNuKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dbee0bff269fd5ae686a7d5f39ab1ed2d74c0365d63e9f350061d959206369a","last_reissued_at":"2026-05-18T00:19:56.745549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.745549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06906","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-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ch+aTS6D5xvBXNENK4hylTPj9Ee606/V6ypFeGUZkw6phgSdn1LpwKFXwCw88NMYNXzkuM4GWRTitWJynTnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:54:57.703568Z"},"content_sha256":"5ed8081390644d9f19f2a81aa0e13d23bce6500dfc92d68da96965fd380078d1","schema_version":"1.0","event_id":"sha256:5ed8081390644d9f19f2a81aa0e13d23bce6500dfc92d68da96965fd380078d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PW7OBP7SNH6VVZUGU7K7HGVR5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Open problem on $\\sigma$-invariant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kinkar Ch. Das, Seyed Ahmad Mojallal","submitted_at":"2017-11-18T18:08:06Z","abstract_excerpt":"Let $G$ be a graph of order $n$ with $m$ edges. Also let $\\mu_1\\geq \\mu_2\\geq \\cdots\\geq \\mu_{n-1}\\geq \\mu_n=0$ be the Laplacian eigenvalues of graph $G$ and let $\\sigma=\\sigma(G)$ $(1\\leq \\sigma\\leq n)$ be the largest positive integer such that $\\mu_{\\sigma}\\geq \\frac{2m}{n}$. In this paper, we prove that $\\mu_2(G)\\geq \\frac{2m}{n}$ for almost all graphs. Moreover, we characterize the extremal graphs for any graphs. Finally, we provide the answer to Problem 3 in \\cite{KMT}, that is, the characterization of all graphs with $\\sigma=1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06906","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-18T00:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAze2s14SKqH47S9jyYo+5QLA1HWmyUqpxAfjUvz8tBnDeSr6Q/zuqV5JEGBsX1pVYhajjTphi6FhMt/EaTZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:54:57.703905Z"},"content_sha256":"b3864a12be1ae68f1c6700f673a8d03856afb7af373eb6bb689810fad4831df0","schema_version":"1.0","event_id":"sha256:b3864a12be1ae68f1c6700f673a8d03856afb7af373eb6bb689810fad4831df0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/bundle.json","state_url":"https://pith.science/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/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-02T17:54:57Z","links":{"resolver":"https://pith.science/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U","bundle":"https://pith.science/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/bundle.json","state":"https://pith.science/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PW7OBP7SNH6VVZUGU7K7HGVR5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PW7OBP7SNH6VVZUGU7K7HGVR5U","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":"55b79a713f1b52737b0af153211a6603c26907c9f0ecdb5fbf8a2b2ab27b81a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-18T18:08:06Z","title_canon_sha256":"5ca7c678f2b1c4d6586b6c5780c58a60a7cb9962f4c6f068167b628ed76bf870"},"schema_version":"1.0","source":{"id":"1711.06906","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06906","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06906v2","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06906","created_at":"2026-05-18T00:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"PW7OBP7SNH6V","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PW7OBP7SNH6VVZUG","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PW7OBP7S","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:b3864a12be1ae68f1c6700f673a8d03856afb7af373eb6bb689810fad4831df0","target":"graph","created_at":"2026-05-18T00:19:56Z","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 graph of order $n$ with $m$ edges. Also let $\\mu_1\\geq \\mu_2\\geq \\cdots\\geq \\mu_{n-1}\\geq \\mu_n=0$ be the Laplacian eigenvalues of graph $G$ and let $\\sigma=\\sigma(G)$ $(1\\leq \\sigma\\leq n)$ be the largest positive integer such that $\\mu_{\\sigma}\\geq \\frac{2m}{n}$. In this paper, we prove that $\\mu_2(G)\\geq \\frac{2m}{n}$ for almost all graphs. Moreover, we characterize the extremal graphs for any graphs. Finally, we provide the answer to Problem 3 in \\cite{KMT}, that is, the characterization of all graphs with $\\sigma=1$.","authors_text":"Kinkar Ch. Das, Seyed Ahmad Mojallal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-18T18:08:06Z","title":"Open problem on $\\sigma$-invariant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06906","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:5ed8081390644d9f19f2a81aa0e13d23bce6500dfc92d68da96965fd380078d1","target":"record","created_at":"2026-05-18T00:19:56Z","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":"55b79a713f1b52737b0af153211a6603c26907c9f0ecdb5fbf8a2b2ab27b81a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-18T18:08:06Z","title_canon_sha256":"5ca7c678f2b1c4d6586b6c5780c58a60a7cb9962f4c6f068167b628ed76bf870"},"schema_version":"1.0","source":{"id":"1711.06906","kind":"arxiv","version":2}},"canonical_sha256":"7dbee0bff269fd5ae686a7d5f39ab1ed2d74c0365d63e9f350061d959206369a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dbee0bff269fd5ae686a7d5f39ab1ed2d74c0365d63e9f350061d959206369a","first_computed_at":"2026-05-18T00:19:56.745549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:56.745549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umGPu9ClwY/o5buNwJfUYR1LD7qQQRoB1q5gN5tCnaurU1VgvrysQhzi9NDiO9YkpJSUS+EGvU/T7yzfDNuKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:56.746286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06906","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ed8081390644d9f19f2a81aa0e13d23bce6500dfc92d68da96965fd380078d1","sha256:b3864a12be1ae68f1c6700f673a8d03856afb7af373eb6bb689810fad4831df0"],"state_sha256":"98132b76a867bdb4c7ce34bef0b148839b70304cfd868a475aa70aa9f0c86580"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmDJxCKBQbX5nI83SJZca4+OgyGPTPVMbXeFcypNC+HZGwopqfTiMULDUISJMepdb/sVNIV2Hy1S9sxwRt3/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:54:57.705911Z","bundle_sha256":"2bfa22a5fb059496432f5961ab99b6029da2140b2665117abcf38205ec7a9335"}}